Add files using upload-large-folder tool

applicant/10207837.xml

@@ -0,0 +1,281 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>10207837</doc-number>
+        <date>2002-07-31</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">
+      <confidence value="11">i~</confidence>
+ <confidence value="1">~</confidence>
+ <confidence value="1">~</confidence>
+   <confidence value="1">~</confidence>
+   <confidence value="1121">~~_'</confidence>
+ <confidence value="21">_.</confidence>
+ <confidence value="111">fi'</confidence>
+ <confidence value="1">~</confidence>
+  <confidence value="111">'r"</confidence>
+ -1- Method and System for Editing Text Messages Conveyed via a CATV Infrastructure at a TV Set-Top Box     </p>
+    <heading id="h-1">FIELD OF THE INVENTION</heading>
+    <p id="p-2" num="2">This invention relates to editing of text messages such as e-mails and SMS (short message service) messages conveyed via a cable television (CATV) infrastructure.</p>
+    <p id="p-3" num="3">
+      <boundary-data type="line-number">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+     </p>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-4" num="4">The increasing development of communication systems of one form or another and the infrastructure and expense that is required to maintain them has motivated the service providers of those systems to provide various "added value" <boundary-data type="line-number">
+        <confidence value="66">10</confidence>
+       </boundary-data>
+services. Thus, it is known for cable television (CATV) providers to allow subscribers to send SMS messages via the CATV system. One example is disclosed in WO <part-num-ref name="CATV system. One example is disclosed in WO">9856181</part-num-ref>
+ entitled "System at telecommunications network" (Tegler et al.) assigned to Telia AB of Sweden and published December <part-num-ref name="entitled &quot;System at telecommunications network&quot; (Tegler et al.) assigned to Telia AB of Sweden and published December">10,</part-num-ref>
+ <part-num-ref name="entitled &quot;System at telecommunications network&quot; (Tegler et al.) assigned to Telia AB of Sweden and published December 10,">1998.</part-num-ref>
+ This reference relates to an interactive broadband service such as digital transmission of video <boundary-data type="line-number">15 </boundary-data>
+channels, specifically using the GSM-system (Global System of Mobile Communication-system). By way of example, there is described a service which requires low capacity in uplink and that utilizes the SMS-function in GSM.    </p>
+    <p id="p-5" num="5">Interactive traffic between the transmitting and receiving equipment is managed by an interactive center, which is arranged to execute the desired broadband service.</p>
+    <p id="p-6" num="6">
+      <boundary-data type="line-number">20 </boundary-data>
+The interactive centre is also coupled to a distributive centre for distribution of the broadband signals on the telecommunications network.    </p>
+    <p id="p-7" num="7">Such an arrangement is typical of known systems that allow a TV set-top box to send SMS messages via the cellular network. Some digital TV operators <page-break num="2"/>
+      <confidence value="1">l</confidence>
+ <confidence value="11">7u</confidence>
+ <confidence value="1">;</confidence>
+  <confidence value="1">r</confidence>
+  <confidence value="177">rit</confidence>
+   <confidence value="1">:</confidence>
+  <confidence value="221">''r</confidence>
+  <confidence value="2111">;_"~</confidence>
+  <confidence value="11">:;</confidence>
+ <confidence value="1121">,,,r</confidence>
+ <confidence value="1111121">y!i';.'</confidence>
+ -2- provide a service, wherein a TV subscriber can send SMS messages via his/her TV set to a mobile subscriber.    </p>
+    <p id="p-8" num="8">This may typically be implemented by communicating with an SMS gateway that receives the SMS messages from the TV subscribers and sends them <boundary-data type="line-number">5 </boundary-data>
+through the existing Short Messaging Service Center (SMSC) machines on each of the wireless operator's networks. This is similar to the ability to send SMS messages from a PC, by using a web site that offers this kind of service.    </p>
+    <p id="p-9" num="9">Spell-check programs are known in the field of text-processing that are able to highlight misspellings, offer a list of suggested alternatives upon selection of an <boundary-data type="line-number">10 </boundary-data>
+incorrect word and replace the incorrect word with a selected alternative.    </p>
+    <p id="p-10" num="10">US Patent No. 6,298,158 (Egozi et a<confidence value="5">l</confidence>
+.) issued October 2, 2001 to Babylon, Ltd. and entitled "Recognition and Translation System and Method" discloses a method and system of recognition and translation, stored on a digital storage device with an operating system and running computer applications, such as a personal <boundary-data type="line-number">15 </boundary-data>
+computer. Input by a computer user is recognized and output is transmitted to the user. The system recognizes characters displayed on the output device of the digital storage device, and translates phrases contiguous to and including the phrase upon which the system is activated and translates words from one written phrase set to a second written phrase set. Such a system is particularly adapted to be operated <boundary-data type="line-number">20 </boundary-data>
+under a Microsoft Windows environment but there is no suggestion to provide such a system for use with a CATV infrastructure. Microsoft is a registered trademark of Microsoft Corporation, Inc., Redmond USA.    </p>
+    <p id="p-11" num="11">It would thus provide an expanded and useful service to allow SMS and other messages to be input to a TV set-top box and to be spell-checked or <boundary-data type="line-number">25 </boundary-data>
+translated. <confidence value="5">[</confidence>
+The prior art makes no provision for such a service.    </p>
+    <heading id="h-3">SUMMARY OF THE INVENTION</heading>
+    <p id="p-12" num="12">It is an object of the invention to provide a method and system for replacing at least one item in a source string input to a TV set-top box.</p>
+    <p id="p-13" num="13">
+      <page-break num="3"/>
+-3- This object is realized in accordance with a first aspect of the invention by a method for replacing at least one word in a source string input to a TV set-top box for conveying via a TV communication infrastructure, the method comprising the following operations all carried out by a TV communication gateway:    </p>
+    <p id="p-14" num="14">
+      <boundary-data type="line-number">5        </boundary-data>
+(a)  receiving the source string from the TV set-top box, (b) for each item that requires replacing determining at least one replacement item, and (c) forwarding to the TV set-top box data relating to the at least one replacement item.    </p>
+    <p id="p-15" num="15">
+      <boundary-data type="line-number">10         </boundary-data>
+According to one embodiment of the invention, the TV communication gateway parses the source string to identify at least one item that requires replacing.    </p>
+    <p id="p-16" num="16">This obviates the need for this to be done by the TV set-top box, which would require that sufficient processing power and memory be provided in the TV set-top box to effect the required parsing.</p>
+    <p id="p-17" num="17">
+      <boundary-data type="line-number">15         </boundary-data>
+According to a second aspect of the invention, there is provided a method for replacing at least one item in a source string input to a TV set-top box for conveying via a TV communication infrastructure, the method comprising the following operations all carried out by the TV set-top box:    </p>
+    <p id="p-18" num="18">(a) conveying the source string to a TV communication gateway, <boundary-data type="line-number">20       </boundary-data>
+(b) receiving therefrom data relating to at least one item in the source string that is to be replaced, and (c) outputting said data.    </p>
+    <p id="p-19" num="19">According to a third aspect of the invention, there is provided a TV communication gateway for replacing at least one item in a source string input to a <boundary-data type="line-number">25   </boundary-data>
+TV set-top box and received via a TV comm<confidence value="8">u</confidence>
+nication infrastructure, the TV communication gateway including:    </p>
+    <p id="p-20" num="20">an input port for receiving the source string, a memory coupled to the input port for storing the source string, <page-break num="4"/>
+      <confidence value="288">_4-</confidence>
+ a processor coupled to the input port for obtaining at least one item that requires replacing, and, for each item that requires replacing, determining at least one replacement item, and an output port coupled to the processor for forwarding to the TV set-top box <boundary-data type="line-number">5   </boundary-data>
+data relating to the at least one replacement item.    </p>
+    <p id="p-21" num="21">According to yet another aspect, the invention provides a TV set-top box for editing and outputting messages conveyed via a TV communication infrastructure, the TV set-top box comprising:</p>
+    <p id="p-22" num="22">a processor configured to display a user interface on a television connected to <boundary-data type="line-number">
+        <confidence value="66">10</confidence>
+        </boundary-data>
+the set-top box, the user interface being configured to accept a source string, the processor being further configured to obtain a list of at least one replacement item for the source string and, responsive to a command entered via the user interface, replace at least a portion of the source string identified by the command with at least one of the list of at least one replacement item.    </p>
+    <p id="p-23" num="23">
+      <boundary-data type="line-number">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+     </p>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-24" num="24">In order to understand the invention and to see how it may be carried out in practice, a preferred embodiment will now be described, by way of non-limiting example only, with reference to the accompanying drawings, in which:</p>
+    <p id="p-25" num="25">
+      <boundary-data type="line-number">20         </boundary-data>
+Fig. <confidence value="5">1</confidence>
+ is a pictorial representation of a system for allowing SMS messages to be conveyed via a CATV infrastructure to a TV set-top box of a destined subscriber;    </p>
+    <p id="p-26" num="26">Fig. 2 is a block diagram showing functionally a CATV gateway for use with the system of Fig. 1;</p>
+    <p id="p-27" num="27">
+      <boundary-data type="line-number">25         </boundary-data>
+Fig. 3 is a block diagram showing functionally the TV set-top box for use with the system of Fig. 1;    </p>
+    <p id="p-28" num="28">Fig. 4 is a flow diagram showing the principal operations carried out by the TV set-top box in the system of Fig. <confidence value="4">1</confidence>
+ prior to conveying a message to the CATV gateway;    </p>
+    <p id="p-29" num="29">
+      <page-break num="5"/>
+      <confidence value="588">-5-</confidence>
+ Fig. 5 is a flow diagram showing the principal operations carried out by the TV set-top box in the system of Fig. 1 after receiving replacement data from the CATV gateway; and Fig. 6 is a flow diagram showing the principal operations carried out by a <boundary-data type="line-number">5 </boundary-data>
+CATV gateway in the system of Fig. 1.    </p>
+    <heading id="h-5">DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS</heading>
+    <p id="p-30" num="30">The present invention is being described principally according to the embodiment in which text messages are input at the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ and an application is run by the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ in conjunction<confidence value="5">-</confidence>
+with the CATV gateway <boundary-data type="line-number">
+        <confidence value="66">10</confidence>
+         </boundary-data>
+      <part-num-ref name="CATV gateway">17</part-num-ref>
+ for editing such text messages, but the present invention is not limited to this embodiment. The application may be, for example, a translator that translates a source message (constituting a source string) to a specified foreign language. As noted above, US Patent No. 6,298,158 (Egozi et al.) entitled "Recognition and Translation System and Method" discloses a method and system of recognition and <boundary-data type="line-number">15 </boundary-data>
+translation and its contents are incorporated herein by reference.    </p>
+    <p id="p-31" num="31">Alternatively, it may be a spell checker that checks the spelling of the text message and suggests alternative words to words that are spelled incorrectly. Fig. 2 is a block diagram showing functionally the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ including a processor <part-num-ref name="processor">25</part-num-ref>
+ coupled to a memory <part-num-ref name="memory">26</part-num-ref>
+ storing data representative of a text message.    </p>
+    <p id="p-32" num="32">
+      <boundary-data type="line-number">20 </boundary-data>
+A logon request unit 27 is coupled to the processor <part-num-ref name="processor">25</part-num-ref>
+ for processing a logon request received from a TV set-top box and an optional scrambling unit <part-num-ref name="optional scrambling unit">28</part-num-ref>
+ allows a text message received from an external source (such as the cellular telephone <part-num-ref name="cellular telephone">14</part-num-ref>
+ or the computer <part-num-ref name="computer">19)</part-num-ref>
+ to be scrambled prior to conveying to a TV set-top box. This can be done using the unique address of the TV set-top box, so that only the destined <boundary-data type="line-number">25 </boundary-data>
+TV set-top box is able to unscramble the received message. An input port <part-num-ref name="input port">29</part-num-ref>
+ and an output port <part-num-ref name="output port">30</part-num-ref>
+ are coupled to the processor <part-num-ref name="processor">25</part-num-ref>
+ for respectively receiving a text message from the server <part-num-ref name="server">15</part-num-ref>
+ (shown in Fig. 1), and conveying it to a destined TV set-top box via the CATV infrastructure <part-num-ref name="CATV infrastructure">11</part-num-ref>
+ (shown in Fig. 1).    </p>
+    <p id="p-33" num="33">
+      <page-break num="6"/>
+      <confidence value="888">-6-</confidence>
+ The processor <part-num-ref name="processor">25</part-num-ref>
+ processes an incoming text message received at the input port <part-num-ref name="input port">29</part-num-ref>
+ from a CATV subscriber's TV set-top box <part-num-ref name="CATV subscriber's TV set-top box">12.</part-num-ref>
+ An application program such as spell checker or translator <part-num-ref name="application program such as spell checker or translator">31</part-num-ref>
+ is coupled to the processor <part-num-ref name="processor">25</part-num-ref>
+ and operates in association with a database <part-num-ref name="database">32.</part-num-ref>
+ for processing the source string stored in the <boundary-data type="line-number">5   </boundary-data>
+memory for choosing a replacement string. For example, the database can store a list of words and phrases to allow a spell checker to cross-refer each word in the source string with the database and, for each word not found therein, selects a list of possible alternatives. Typically, the alternatives are phonetically similar to the incorrectly spelled  word.  It should be noted that preliminary tests may be <boundary-data type="line-number">
+        <confidence value="66">10</confidence>
+         </boundary-data>
+performed by the spell checker routine to identify errors even before accessing the database <part-num-ref name="database">32.</part-num-ref>
+ By such means, unorthodox combinations of upper and lower case characters may be identified as faulty and suitable alternatives proposed. The suggested alternatives are compiled as a list by an XML formatter <part-num-ref name="XML formatter">33</part-num-ref>
+ coupled to the processor <part-num-ref name="processor">25.</part-num-ref>
+ For example, consider a source string reading:    </p>
+    <p id="p-34" num="34">
+      <boundary-data type="line-number">15         </boundary-data>
+"Dear Joh<confidence value="58">n,</confidence>
+ <confidence value="5">c</confidence>
+en we meet in the staf room tomorow?" This source contains three errors and the XML list will look as follows:    </p>
+    <p id="p-35" num="35">&lt;response&gt; &lt;word="cen", pos=3&gt;can &lt;/word&gt; &lt;word="cen<confidence value="5">"</confidence>
+, pos=3&gt;cent &lt;/word&gt; <boundary-data type="line-number">20               </boundary-data>
+&lt;word="cen", pos=3&gt;ken &lt;/word&gt; &lt;word="cen", pos=3&gt;can &lt;/word&gt; &lt;<confidence value="2222222222">word="staf</confidence>
+', pos=8&gt;staff &lt;/word&gt; &lt;word="staf', pos=8&gt;stave&lt;/word&gt; &lt;word="staf<confidence value="54">",</confidence>
+ pos=8&gt;stag &lt;/word&gt; <boundary-data type="line-number">25               </boundary-data>
+&lt;word="staf', pos=8&gt;stab &lt;/word&gt; &lt;<confidence value="2222222222">word="staf</confidence>
+', pos=8&gt;star &lt;/word&gt; &lt;word="tomorow<confidence value="5">"</confidence>
+, <confidence value="222222222222222">pos=10&gt;tomorrow</confidence>
+ &lt;/word&gt; &lt;/response&gt; The XML list constitutes data relating to at least one replacement word for <part-num-ref name="XML list constitutes data relating to at least one replacement word for">
+        <confidence value="86">30</confidence>
+      </part-num-ref>
+ each misspelled word and is conveyed via the output port <part-num-ref name="output port">30</part-num-ref>
+ of the CATV gateway <page-break num="7"/>
+-7- <part-num-ref name="CATV gateway -7-">17</part-num-ref>
+ back to the TV set-top box <part-num-ref name="TV set-top box">12,</part-num-ref>
+ where an application processes the data to extract therefrom an identity of an incorrectly spelled word in the source string, and displays the identified word using at least one fault attribute, such as different color or underline etc.    </p>
+    <p id="p-36" num="36">
+      <boundary-data type="line-number">5         </boundary-data>
+The logon request unit 27 processes a logon request sent by a TV set-top box  for establishing whether the logon request is valid, i.e. corresponds to a registered subscriber. The logon request identifies the unique address of the sending TV set-top box as well as the ID of the current group member where multiple group members are associated with the identified TV set-top box, each <boundary-data type="line-number">
+        <confidence value="86">10</confidence>
+         </boundary-data>
+having a separate ID. By such means, the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ can determine whether a text message stored in the memory <part-num-ref name="memory">26</part-num-ref>
+ belongs to the subscriber currently logged on from the identified TV set-top box <part-num-ref name="identified TV set-top box">12.</part-num-ref>
+ If so the text message content stored in the memory <part-num-ref name="memory">26</part-num-ref>
+ is scrambled by the scrambling unit <part-num-ref name="scrambling unit">28</part-num-ref>
+ and conveyed to the TV set- top box <part-num-ref name="TV set- top box">12.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">
+      <boundary-data type="line-number">15         </boundary-data>
+Fig. 3 is a block diagram showing functionally the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ comprising a processor <part-num-ref name="processor">40</part-num-ref>
+ coupled to a memory <part-num-ref name="memory">41</part-num-ref>
+ and a communication unit <part-num-ref name="communication unit">42</part-num-ref>
+ for establishing bi-directional communication with the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ The processor <part-num-ref name="processor">40</part-num-ref>
+ may operate in conjunction with a user interface <part-num-ref name="user interface">44</part-num-ref>
+ to run an application stored in the memory <part-num-ref name="memory">41</part-num-ref>
+ for identifying a selected incorrectly spelled <boundary-data type="line-number">20   </boundary-data>
+word in the source string and cross-referring the selected word in the XML list for identifying suggested alternatives. To this end, the user interface <part-num-ref name="user interface">44</part-num-ref>
+ may contain a pointing device such as a mouse for pointing to a selected item, term, or word in the source string. The alternative items, terms or words are then displayed for selection by a user at the TV set-top box <part-num-ref name="TV set-top box">12.</part-num-ref>
+ Upon selection by the user of a desired <boundary-data type="line-number">25   </boundary-data>
+replacement, the processor <part-num-ref name="processor">40</part-num-ref>
+ identifies the selected alternative item, term, or word, replaces the selected alternative in the source string, displays the source string and hides the fault attribute from the selected alternative. This process is repeated as required for further selected items, terms or words in the source string.    </p>
+    <p id="p-38" num="38">Figs. 4 and <part-num-ref name="and">5</part-num-ref>
+ are flow diagrams showing the principal operations carried out <part-num-ref name="principal operations carried out">
+        <confidence value="86">30</confidence>
+      </part-num-ref>
+   by the TV set-top box <part-num-ref name="TV set-top box">12,</part-num-ref>
+ upon establishing on-line communication with the CATV <page-break num="8"/>
+      <confidence value="111111">?!,1,3</confidence>
+  <confidence value="1">j</confidence>
+  <confidence value="11">f3</confidence>
+  <confidence value="111">tLa</confidence>
+ <confidence value="1">.</confidence>
+ <part-num-ref name="CATV ?!,1,3  j  f3  tLa .">
+        <confidence value="6">1</confidence>
+      </part-num-ref>
+  <confidence value="11">*3</confidence>
+  <part-num-ref name="*3">41</part-num-ref>
+  <confidence value="111">33i</confidence>
+  <part-num-ref name="33i">
+        <confidence value="1">3</confidence>
+      </part-num-ref>
+ <confidence value="1">k</confidence>
+ gateway <part-num-ref name="k gateway">17.</part-num-ref>
+ The user drafts a message and then selects the application that is required, e.g. spell check, translate etc. Assuming that spell check is selected, the message (constituting the source string) is conveyed to the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ for processing (as described below with reference to Fig. 6). The XML string formatted <boundary-data type="line-number">5   </boundary-data>
+by the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ is then downloaded to the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ and stored in the memory <part-num-ref name="memory">41,</part-num-ref>
+ which serves to cache the X<confidence value="5">M</confidence>
+L string. As explained above, the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ processes the XML string to extract therefrom an identity of an incorrectly spelled word in the source string, and displays the identified word using at least one fault attribute, such as different color or underline etc.    </p>
+    <p id="p-39" num="39">
+      <boundary-data type="line-number">10         </boundary-data>
+The spell check application, shown in Fig. 5, allows an incorrect word to be selected and cross-referenced in the cached XML file so as to display the alternative words. The incorrect word is then replaced by a selected alternative word and the fault attribute hidden. While an XML file is described as an illustrative example, it will be understood to those skilled in the art that a number of data handling <boundary-data type="line-number">15  </boundary-data>
+protocols and software, now known or later developed, can be used, so long as they are suitable to carry out the purposes of this invention.    </p>
+    <p id="p-40" num="40">Fig. 6 is a flow diagram showing the principal operations carried out by the CATV gateway <part-num-ref name="CATV gateway">17.</part-num-ref>
+ Thus, the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ receives and processes an incoming text message according to the application selected by the TV set-top box <boundary-data type="line-number">20   </boundary-data>
+      <part-num-ref name="TV set-top box">12.</part-num-ref>
+ It then constructs the replacement string and forwards it to the TV set-top box.    </p>
+    <p id="p-41" num="41">It will be understood that although a particular example of a spell check application has been described, the invention contemplates the use of other text processing applications, such as translation and so on. In the case of translation, the replacement string compiled by the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ is a complete translation of <boundary-data type="line-number">25  </boundary-data>
+the source string and no further interaction on the part of the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ may be necessary. Thus, in this case the data sent by the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ to the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ is the translated source string and is displayed by the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ instead of the original message.    </p>
+    <p id="p-42" num="42">It should also be appreciated that while particular applications of spell check <confidence value="86">30</confidence>
+   and translation have been described with reference to SMS messages conveyed via <page-break num="9"/>
+      <confidence value="888">-9-</confidence>
+ the CATV infrastructure, the invention is equally applicable for other kinds of text messages conveyed via the TV infrastructure such as Mail-T<confidence value="66">V,</confidence>
+ and so on.    </p>
+    <p id="p-43" num="43">It will also be understood that the features of the TV set-top box <part-num-ref name="TV set-top box">12</part-num-ref>
+ and of the CATV gateway <part-num-ref name="CATV gateway">17</part-num-ref>
+ herein described may be implemented via suitably <part-num-ref name="herein described may be implemented via suitably">
+        <confidence value="5">5</confidence>
+      </part-num-ref>
+   programmed computers. Further, the TV set-top box is to be broadly understood as any device capable of carrying out the functions associated with a set-top box, including a computer or other device coupled to a television, screen, or other display adapted to convey visual images to a user, and also includes a television that physically incorporates a TV set-top box or the functions of a TV set-top box.    </p>
+    <p id="p-44" num="44">
+      <confidence value="66">10</confidence>
+  Likewise, the invention contemplates computer programs being readable by the <confidence value="2">-</confidence>
+           processors in the respective units for executing the methods of the invention. The invention further contemplates machine-readable memories tangibly embodying programs of instructions executable by the respective units for executing the methods of the invention.    </p>
+    <p id="p-45" num="45">15        It will also be appreciated that, while the invention has been described with particular regard to a CATV communication infrastructure, it is equally applicable to a satellite TV communication infrastructure. Thus, within the context of the appended claims, the term "TV communication infrastructure" embraces both a CATV infrastructure and a DBS infrastructure. Likewise, the term "TV commu<confidence value="668">ni-</confidence>
+ <part-num-ref name="term &quot;TV communi-">20</part-num-ref>
+   cation gateway" embraces both a CATV gateway and a DBS (Direct Broadcasting via Satellite) gateway<confidence value="5">.</confidence>
+ In this connection it will be understood that the DBS gateway is accessed via a modem, typically connected to a telephone line in known manner.    </p>
+    <p id="p-46" num="46">In the method claims that follow, alphabetic characters and Roman numerals <part-num-ref name="method claims that follow, alphabetic characters and Roman numerals">25</part-num-ref>
+ used to designate claim operations are provided for convenience only and do not imply any particular order of performing the operations.    </p>
+  </description>
+</us-patent-application>
+

applicant/10429230.xml

@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<pat:SpecificationDocument xmlns:pat="urn:us:gov:doc:uspto:patent" xmlns="urn:us:gov:doc:uspto:patent" xmlns:ent="urn:us:gov:doc:uspto:enterprise" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tbl="http://www.oasis-open.org/tables/exchange/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:com="http://www.wipo.int/standards/XMLSchema/Common/1" pat:instanceFileName="10429230.12-22-2015.IIPIZW3EPXXIFW3.SPEC.xml" pat:id="IIPIZW3EPXXIFW3" xsi:schemaLocation="urn:us:gov:doc:uspto:patent XMLSchema/V1_3/SpecificationDocument_1_0.xsd">
+<pat:DocumentCode>SPEC</pat:DocumentCode><pat:DocumentHeaderDetails pat:id="ID-00001">
+<pat:ApplicationHeaderDetails><pat:ApplicationNumber>10429230</pat:ApplicationNumber></pat:ApplicationHeaderDetails>
+<pat:PageTotalQuantity>1</pat:PageTotalQuantity>
+<pat:ParagraphTotalQuantity>5</pat:ParagraphTotalQuantity>
+</pat:DocumentHeaderDetails>
+<pat:MailRoomDate>2015-12-22</pat:MailRoomDate>
+<pat:Specification pat:id="Specification">
+<?PageStart number="1"?>
+<pat:BoundaryData><pat:HeaderText>AMENDMENT <pat:OCRConfidenceData pat:levelNumber="5">I</pat:OCRConfidenceData>N RESPONSE TO THE OFFICE ACTION MAILED SEPTEMBER 24, 2015</pat:HeaderText></pat:BoundaryData>
+<pat:BoundaryData><pat:HeaderText>APPLICATION N<pat:OCRConfidenceData pat:levelNumber="4">O</pat:OCRConfidenceData>. 10/429,230</pat:HeaderText></pat:BoundaryData>
+<pat:P pat:id="p-1" pat:pNumber="1"><pat:U>Amendments to the Specification</pat:U>:</pat:P>
+<pat:P pat:id="p-2" pat:pNumber="2">Please replace Paragraph 0001 with the following amended paragraph:</pat:P>
+<pat:P pat:id="p-3" pat:pNumber="3">[0001] This application is <pat:U>generally related to the subject matter of </pat:U><pat:DeletedText>a continuation in part of and claims the benefit of a </pat:DeletedText>commonly assigned U.S. Patent Application No. 10/144,537, filed May 10, 2002, <pat:U>issued as Patent No. 7,240,019 on July 3, 2007, </pat:U>entitled "Interface for Merchandise Price Optimization," by inventors Michael Neal and Phil Delurgio, herein incorporated by reference, which is a continuation application and claims priority of a commonly assigned U.S. Patent Application No. 09/849,616, filed May 4, 2001, issued as Patent No. 6,553,352 on April 22, 2003, entitled "Interface for Merchandise Price Optimization," by inventors Michael Neal and Phil Delurgio. Accordingly, this application <pat:U>is </pat:U>also <pat:U>generally related to the subject matter of</pat:U> <pat:DeletedText>claims the benefit of a </pat:DeletedText>commonly assigned U.S. Patent Application No. 09/849,616, filed May 4, 2001, issued as Patent No. 6,553,352 on April 22, 2003, entitled "Interface for Merchandise Price Optimization," by inventors Michael Neal and Phil Delurgio.</pat:P>
+<pat:P pat:id="p-4" pat:pNumber="4">Please replace Paragraph 0002 with the following amended paragraph:</pat:P>
+<pat:P pat:id="p-5" pat:pNumber="5">[0002] This application is also <pat:U>generally related to the subject matter of </pat:U><pat:DeletedText>a continuation in part of and claims benefit of a </pat:DeletedText>commonly assigned U.S. Patent Application No. 09/849,448, filed May 4, 2001, <pat:U>issued as Patent No. 7,092,896 on August 15, 2006, </pat:U>entitled "Interface for Merchandise Promotion Optimization," by inventors Michael Neal and Phil Delurgio, herein incorporated by reference.</pat:P>
+<pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber="8">2</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData>
+</pat:Specification></pat:SpecificationDocument>

applicant/10717065.xml

@@ -0,0 +1,588 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>10717065</doc-number>
+        <date>2003-11-19</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">
+      <confidence value="1">1</confidence>
+ Express Mail Label EV338228127US Rai-Silva 4-2                 <confidence value="6">1</confidence>
+     </p>
+    <heading id="h-1">METHOD AND APPARATUS FOR SCHEDULING FORWARD DATA</heading>
+    <heading id="h-2">BURSTS IN WIRELESS NETWORK</heading>
+    <p id="p-2" num="2">Technical Field <boundary-data type="line-number">5       </boundary-data>
+This invention relates to wireless communications and, more particularly, to the efficient management of radio link resources on a wireless network.    </p>
+    <p id="p-3" num="3">Background of the <confidence value="5">I</confidence>
+nvention <boundary-data type="line-number">10       </boundary-data>
+      <confidence value="5">C</confidence>
+DMA-based wireless communications networks were introduced as a second generation (2G) system based on digital technologies as compared to first generation systems that used analog transmission technology. 2G systems also introduced support for low-speed data transmission on top of their support for voice calls. The push to third generation (3G) systems has <boundary-data type="line-number">15 </boundary-data>
+high-speed data transmission as one of its driving forces. A 3G CDMA2000 system will support transmission of data at rates of 19.2 kbps, 38.4 kbps, 76,8 kbps and 153.6 kbps (and even higher), referred to as 2X, 4X, 8X and 16X, respectively, to allow transmission of images, digital files, video, etc. These high-speed data channels, which are established between the base station <boundary-data type="line-number">20 </boundary-data>
+and the mobile terminal, can transmit data in both directions. Data sent from the base station (BS) to the mobile terminal is referred to as being sent in the "forward" direction, while data from the mobile to the base station is referred <confidence value="2222">toas</confidence>
+ being sent in the "reverse" direction. The wireless links or channels used to transmit the higher speed data between the base station and the <page-break num="2"/>
+      <boundary-data type="header">Rai-Silva 4-2                2</boundary-data>
+mobile terminals are not permanent, but need to be established when the data is to be sent. High-speed data transmission between the base station and the mobile terminal is bursty in nature. Typically, data is not sent in a constant data stream, but instead is sent in a series of data bursts until <boundary-data type="line-number">5 </boundary-data>
+transmission of the file, image, web page, etc. is complete. One reason that this mode of operation is used is that radio resources are limited and cannot simultaneously sustain servicing a plurality of mobile terminals that each have ongoing data sessions. In other words, using permanent dedicated channels utilizing these high-speed rates would only allow a base station to service a <boundary-data type="line-number">10 </boundary-data>
+few mobiles due to radio resource limitations. Therefore, in order to service a plurality of mobile terminals, some form of resource sharing needs to be employed.    </p>
+    <p id="p-4" num="4">On a CDMA2000 wireless network, the high-speed data channels are called Supplemental Channels (SCHs). These supplemental channels exist <boundary-data type="line-number">15 </boundary-data>
+for both forward and reverse directions, the F-SCH and R-SCH, respectively.    </p>
+    <p id="p-5" num="5">When a burst is ready to be sent to a mobile terminal, the base station allocates some time on an F-SCH and informs the mobile terminal when the burst will start. This synchronization with the mobile terminal is performed through an ESCAM (Extended Supplemental Channel Assignment Message) <boundary-data type="line-number">20 </boundary-data>
+that is transmitted by the base station on a control channel. The format of the ESCAM is defined in the IS-2000 standard, which is followed by designers of both stations and mobile terminals.    </p>
+    <p id="p-6" num="6">Scheduling data burst activity in a CDMA2000 wireless system is complex given that a plurality of mobile terminals may be simultaneously <page-break num="3"/>
+      <boundary-data type="header">Rai-Silva 4-2                 3</boundary-data>
+requesting bursts from a single base station. The complexity is present due to the fact that the high-speed wireless channels have to be shared and cannot be dedicated to each mobile terminal session, as noted above.    </p>
+    <p id="p-7" num="7">Furthermore, a high-speed data channel is not a physical entity, but rather is <boundary-data type="line-number">5 </boundary-data>
+a collection of independent resources each with a set of constraints that can vary over time and can also vary amongst base station configurations. The basic building blocks necessary to transmit data at high speeds are: <part-num-ref name="basic building blocks necessary to transmit data at high speeds are:">(1)</part-num-ref>
+ a contiguous set of Walsh codes; <part-num-ref name="contiguous set of Walsh codes;">(2)</part-num-ref>
+ contiguous channel fragments to drive the supplemental channel (i.e., some contiguous real estate on a CDMA2000 <boundary-data type="line-number">10 </boundary-data>
+ASIC [Application Specific Integrated Circuit]); <part-num-ref name="CDMA2000 ASIC [Application Specific Integrated Circuit]);">(3)</part-num-ref>
+ some form of backhaul between the base station and the MSC (to deliver the high-speed data packets between the Mobile Switching Center (MSC) and the base station, or vice versa); and <part-num-ref name="base station, or vice versa); and">(4)</part-num-ref>
+ some amount of R<confidence value="5">F</confidence>
+ power necessary to drive the supplemental channel and which can vary in strength depending on the <boundary-data type="line-number">15 </boundary-data>
+location of the mobile terminal. All of these elements need to be available precisely when the BS transmits the burst to a given mobile terminal.    </p>
+    <p id="p-8" num="8">On top of this complexity is the scheduling complexity necessary to achieve fairness in simultaneously servicing the plurality of mobile terminals with a finite set of resources. Current methodology divides the resources into <boundary-data type="line-number">20 </boundary-data>
+smaller and smaller pools and then distributes these small pools amongst the plurality of mobile terminals that are requesting service. The end result is that a mobile terminal will receive a lower speed burst (as low as 19.2 kbps), but many mobile terminals will get bursts simultaneously. Currently, this requires large amount of processing power g<confidence value="8">i</confidence>
+ven that this schema produces many <page-break num="4"/>
+      <boundary-data type="header">Rai-Silva 4-2                 4</boundary-data>
+smaller lower-rate channels. A new burst request arriving in an already loaded system requires the base station software to inspect many multiples of existing low-rate bursts to determine what resources are available for the new burst. Typically, in a loaded system, a new burst request will be given a low- <boundary-data type="line-number">5  </boundary-data>
+rate of burst (19.2 kbps), and a large amount of processing power is required just to find the resources for this low-rate burst. Also, these resources move with each new burst request or burst continuation. Thus, when any new burst request is received, a new set of Walsh codes, ASIC channel fragments, etc., must be reserved.    </p>
+    <p id="p-9" num="9">
+      <boundary-data type="line-number">10       </boundary-data>
+As noted above, the prior art methodology of assigning resources addresses the resource sharing constraint by splitting the available resources into smaller and smaller pieces. As the number of requesting mobile terminals increases, the resources are partitioned into the smallest possible channels, which can only supply the 2X rate of 19.2 kbps. Many of these 2X <boundary-data type="line-number">15 </boundary-data>
+channels are then handled in parallel. When a new burst request is received by an already heavily loaded system, it will either be denied or will get assigned a 2X channel at some later time. Furthermore, heavy processing is required to find the 2X resources that will be available at some time quanta in the future (the burst setup time) since there are so many small partitions of <boundary-data type="line-number">20 </boundary-data>
+resources to check for availability. Even further, these resources are being checked for availability in the future since the burst will only be scheduled to start after the burst setup time has expired.    </p>
+    <p id="p-10" num="10">The prior art is also disadvantageously susceptible to leaving holes in the available resources. This results from the nature of the resource <page-break num="5"/>
+      <boundary-data type="header">
+        <confidence value="885">Rai</confidence>
+-Silva 4-2                 <confidence value="8">5</confidence>
+      </boundary-data>
+partitioning and the fact that there are constraints on certain resources being contiguous to each other (e.g., the Walsh codes). This is known as radio channel fragmentation. As the sharing scheme breaks the resources up, it cannot always put the resources back together at all times. Coalescing non- <boundary-data type="line-number">5  </boundary-data>
+contiguous resources (e.g., Walsh codes, channel fragments) into single homogeneous contiguous resources is very complex and processor intensive.    </p>
+    <p id="p-11" num="11">For example, there are times when two 2X channels are separately available that could be used to create a 4X burst if they were contiguous.</p>
+    <p id="p-12" num="12">
+      <boundary-data type="line-number">10 </boundary-data>
+Summary of the <confidence value="5">I</confidence>
+nvention <confidence value="5">I</confidence>
+n accordance with an embodiment of the present invention, at system initialization, one or more permanent virtual<confidence value="5">.</confidence>
+ pipes are provisioned at a base station in a CDMA2000 network on the Forward Supplemental Channel (F-SCH). A set of resources (i.e., contiguous Walsh codes, contiguous ASIC <boundary-data type="line-number">15 </boundary-data>
+real estate, etc.) are allocated and grouped together to handle high-speed data transmissions in the forward direction from the base station on the F-SCH. Depending on the base station configuration, these virtual pipes that are provided are "wide" enough to handle data rates that vary, for example, from the maximum presently used 16X (153.5 kbps) data rate to the 2X (19.2 <boundary-data type="line-number">20 </boundary-data>
+kbps) data rate. Virtual pipes that are 8X and 4X wide are also generally provisioned.    </p>
+    <p id="p-13" num="13">Once the virtual pipes have been provisioned, data bursts arriving from the network and destined to a mo<confidence value="8">b</confidence>
+ile terminal in the base station's service area are scheduled into <confidence value="222222222">timesiots</confidence>
+ on at <confidence value="8">l</confidence>
+east one of the virtual pipes in a <page-break num="6"/>
+      <boundary-data type="header">
+        <confidence value="885">Rai</confidence>
+-Silva 4-2                 6      </boundary-data>
+round-robin fashion. In particular, depending on the length of a burst, a burst is divided into burst segments of a timeslot duration and interleaved in a time- multiplex manner with segments of other bursts that are destined to other mobile terminals in the base station's service area. The amount of data <boundary-data type="line-number">5  </boundary-data>
+transmitted in a given <confidence value="22222222222222">timeslot/burst</confidence>
+ segment is dependent on the particular virtual pipe on which that particular burst segment is scheduled for transmission. If there are less active bursts than there are number of virtual pipes, then the burst segments are scheduled onto only the widest pipes.    </p>
+    <p id="p-14" num="14">Once, however, the number of active bursts exceeds the number of provided <boundary-data type="line-number">10  </boundary-data>
+pipes, then the bursts segments are scheduled amongst the different width pipes in a round-robin manner with at least one burst segment of each active burst being scheduled into a timeslot on the widest pipe. The other burst segments of a burst are then scheduled onto all the pipes so they migrate through the various width pipes in order to give all bursts opportunities on the <boundary-data type="line-number">15  </boundary-data>
+wider-width pipes.    </p>
+    <p id="p-15" num="15">A software-embodied burst segment control structure is associated with each provisioned virtual pipe. This control structure includes a frame head pointer list and a plurality of burst segment information blocks. Each information block is populated with information relating to an identified burst <boundary-data type="line-number">20  </boundary-data>
+segment that is scheduled to be transmitted during a specific future timeslot on the associated virtual pipe, and is linked to a specific frame on the frame head pointer lists. As a current frame pointer moves at a fixed frame rate from frame head pointer-to-frame head pointer on the frame head pointer list, a determination is made whether the current frame head pointer is pointing to <page-break num="7"/>
+      <boundary-data type="header">Rai-Silva 4-2                 7</boundary-data>
+a burst segment information block of a burst segment that is then scheduled for transmission on the virtual pipe. If it is, the burst segment identified in the pointed-to burst segment information block is transmitted. After a burst segment has been transmitted, its associated burst segment information <boundary-data type="line-number">5 </boundary-data>
+block is erased. As the current frame pointer moves frame-by-frame to each next frame head pointer, a future frame pointer moves frame-by-frame to a frame head pointer that the current frame pointer will not reach for a predetermined number of frames. When the future frame pointer points to a frame head pointer that in turn points to a burst segment information block for <boundary-data type="line-number">10 </boundary-data>
+a burst segment that will be transmitted when the current frame pointer later reaches that frame, an ESCAM is transmitted on a control channel to prepare the receiving mobile terminal for the burst that it will be shortly receiving via the virtual pipe when the current frame pointer shortly reaches that same frame head pointer.    </p>
+    <p id="p-16" num="16">
+      <boundary-data type="line-number">15       </boundary-data>
+When the base station receives a burst request from the network, the first burst segment is scheduled on the widest virtual pipe at a determined time in the future after at least one of each currently scheduled burst segment has been transmitted. A burst segment information block is then populated and associated with the frame head pointer for that determined future time, <boundary-data type="line-number">20 </boundary-data>
+while any other burst segments that have already been scheduled are shifted to accommodate the new burst segment. Other burst segments are similarly scheduled on the other provisioned virtual pipes at determined times in the future.    </p>
+    <boundary-data type="header">Rai-Silva 4-2                 8</boundary-data>
+    <p id="p-17" num="17">
+      <page-break num="8"/>
+Advantageously, the high speed data channel resources are efficiently managed with the high speed data bursts being scheduled in such a fashion so as to achieve usage fairness of the wider, higher-speed pipes to all of the mobile terminals requesting bursts. Furthermore, at any given time there are <boundary-data type="line-number">5 </boundary-data>
+only as many bursts segments being transmitted to mobile terminals as there are virtual pipes, which is in contrast to the prior art where resources are partitioned down into smaller and smaller pieces, thereby producing a very large number of low-rate bursts being simultaneously transmitted. The embodiment of the present invention, on the other hand, results in a system <boundary-data type="line-number">10 </boundary-data>
+that uses a smaller number of wider bursts and achieves fairness using time- division techniques on the wider, higher-rate pipes rather than simultaneously driving a greater number of narrower, low-rate pipes.    </p>
+    <p id="p-18" num="18">Brief Descri<confidence value="5">p</confidence>
+tion of the Drawin<confidence value="5">g</confidence>
+ <boundary-data type="line-number">15       </boundary-data>
+FIG. 1 is a block diagram showing a wireless network in which an embodiment of the present invention is employed;    </p>
+    <p id="p-19" num="19">FIG. 2 shows illustrative permanent virtual pipe provisioned by the base station in the network of FIG. 1;</p>
+    <p id="p-20" num="20">FIG. 3 illustrates the transmission of a single burst on a virtual pipe;</p>
+    <p id="p-21" num="21">
+      <boundary-data type="line-number">20       </boundary-data>
+FIG. 4 illustrates the transmission of two bursts on a single virtual pipe;    </p>
+    <p id="p-22" num="22">FIG. 5 illustrates a burst segment control structure that schedules and manages timeslots on a virtual pipe;</p>
+    <p id="p-23" num="23">FIG. 6 is a flowchart detailing the operation of a data burst driver for each virtual pipe that is provisioned by the base station;</p>
+    <boundary-data type="header">
+      <confidence value="885">Rai</confidence>
+-Silva 4-2                 9    </boundary-data>
+    <p id="p-24" num="24">
+      <page-break num="9"/>
+FIG. 7 shows three virtual pipes at different rates servicing multiple simultaneous bursts;    </p>
+    <p id="p-25" num="25">FIG. 8 shows how new bursts are scheduled on a virtual pipe;<confidence value="5">.</confidence>
+    </p>
+    <p id="p-26" num="26">FIG. 9 is a flowchart showing how a burst scheduler schedules bursts <boundary-data type="line-number">5  </boundary-data>
+segments on a virtual pipe; and FIG. 10 is a high-level block diagram of a base station in accordance with an embodiment of the present invention.    </p>
+    <p id="p-27" num="27">Detailed Descri<confidence value="5">p</confidence>
+tion <boundary-data type="line-number">10       </boundary-data>
+An embodiment of the present invention is software that executes on each base station operating in a CDMA2000 wireless network. With reference to FIG. 1, base stations <part-num-ref name="CDMA2000 wireless network. With reference to FIG. 1, base stations">101</part-num-ref>
+ and <part-num-ref name="and">102</part-num-ref>
+ are shown connected to MSC <part-num-ref name="are shown connected to MSC">103</part-num-ref>
+ within wireless network <part-num-ref name="within wireless network">100.</part-num-ref>
+ A mobile terminal <part-num-ref name="mobile terminal">104</part-num-ref>
+ is shown communicating in the fo<confidence value="8">r</confidence>
+ward direction with both base stations <part-num-ref name="forward direction with both base stations">101</part-num-ref>
+ and <part-num-ref name="and">102</part-num-ref>
+ <boundary-data type="line-number">15  </boundary-data>
+on primary and secondary forward fundamental channels <part-num-ref name="on primary and secondary forward fundamental channels">105</part-num-ref>
+ and <part-num-ref name="and">106,</part-num-ref>
+ respectively. Whereas there can be multiple fundamental channels, there is only one forward supplemental channel <part-num-ref name="and 106, respectively. Whereas there can be multiple fundamental channels, there is only one forward supplemental channel">107,</part-num-ref>
+ which is reserved for the mobile terminal <part-num-ref name="mobile terminal">104</part-num-ref>
+ and the other mobile terminals <part-num-ref name="other mobile terminals">109,</part-num-ref>
+ <part-num-ref name="other mobile terminals 109,">110,</part-num-ref>
+ <part-num-ref name="other mobile terminals 109, 110,">111</part-num-ref>
+ that are communicating with base station <part-num-ref name="that are communicating with base station">101,</part-num-ref>
+ to receive high-speed data from that <boundary-data type="line-number">20  </boundary-data>
+single base station <part-num-ref name="that are communicating with base station 101, to receive high-speed data from that single base station">101.</part-num-ref>
+ The fundamental channel is reserved for signaling traffic and can also transport data packets, but at lower rates than the supplemental channel. The described embodiment operates only on the forward supplemental channel. Whereas each base station in the network performs the scheduling functions to be described, high-speed data is <page-break num="10"/>
+      <boundary-data type="header">Rai-Silva 4-2                  10</boundary-data>
+transmitted over the forward supplemental channel <part-num-ref name="forward supplemental channel">107</part-num-ref>
+ to mobile terminals <part-num-ref name="to mobile terminals">104,</part-num-ref>
+ <part-num-ref name="to mobile terminals 104,">109,</part-num-ref>
+ <part-num-ref name="to mobile terminals 104, 109,">110</part-num-ref>
+ and <part-num-ref name="and">111</part-num-ref>
+ by a single base station <part-num-ref name="single base station">101</part-num-ref>
+ on a single leg.    </p>
+    <p id="p-28" num="28">In accordance with an embodiment of the present invention, virtual pipes are provisioned at a base station for the transport of bursts or segments <boundary-data type="line-number">5 </boundary-data>
+of burst of data to the mobile terminals <part-num-ref name="mobile terminals">104,</part-num-ref>
+ <part-num-ref name="mobile terminals 104,">109,</part-num-ref>
+ <part-num-ref name="mobile terminals 104, 109,">110</part-num-ref>
+ and <part-num-ref name="and">111</part-num-ref>
+ within that base station's service area. FIG. 2 illustrates the concept of a 16X virtual pipe <part-num-ref name="16X virtual pipe">201</part-num-ref>
+ and an 8X virtual pipe <part-num-ref name="8X virtual pipe">202.</part-num-ref>
+ A virtual pipe consists of a set of resources that once they are allocated, remain in place. For the 16X virtual pipe <part-num-ref name="16X virtual pipe">201,</part-num-ref>
+ the resources that are allocated include: <part-num-ref name="resources that are allocated include:">(1)</part-num-ref>
+ 16X worth of <boundary-data type="line-number">10  </boundary-data>
+contiguous Walsh codes; <part-num-ref name="16X worth of contiguous Walsh codes;">(2)</part-num-ref>
+ 16X worth of contiguous channel fragments on a CDMA2000 ASIC; <part-num-ref name="CDMA2000 ASIC;">(3)</part-num-ref>
+ 16X worth of capacity on some type of backhaul between the base station and the mobile switching center, which is typically some portion of a T<confidence value="5">1</confidence>
+ line; and <part-num-ref name="T1 line; and">(4)</part-num-ref>
+ some portion of available RF power, which is variable. The 8X virtual pipe <part-num-ref name="8X virtual pipe">202</part-num-ref>
+ has <confidence value="42">'%</confidence>
+ of these resources allocated to it <boundary-data type="line-number">15 </boundary-data>
+by the base station (except for the RF power, which can vary) as compared to the 16X pipe <part-num-ref name="16X pipe">201,</part-num-ref>
+ and can handle exactly half the data rate. As noted in FIG.    </p>
+    <p id="p-29" num="29">2, the virtual pipes <part-num-ref name="virtual pipes">201</part-num-ref>
+ and <part-num-ref name="and">202</part-num-ref>
+ are time-divisioned into timeslots, which are used for carrying burst segments of high-speed data bursts to the mobile terminals <part-num-ref name="mobile terminals">104,</part-num-ref>
+ <part-num-ref name="mobile terminals 104,">109,</part-num-ref>
+ <part-num-ref name="mobile terminals 104, 109,">110</part-num-ref>
+ and <part-num-ref name="and">111</part-num-ref>
+ that are scheduled to receive such bursts.    </p>
+    <p id="p-30" num="30">
+      <boundary-data type="line-number">20 </boundary-data>
+As noted above, the resources that form these virtual pipes <part-num-ref name="resources that form these virtual pipes">201</part-num-ref>
+ and <part-num-ref name="and">202,</part-num-ref>
+ for example, are permanently assigned to their respective pipe and are never reassigned until taken down. The pipe or pipes that are provisioned at base station <part-num-ref name="pipe or pipes that are provisioned at base station">101,</part-num-ref>
+ for example, are always available, therefore, and the burst <page-break num="11"/>
+      <boundary-data type="header">Rai-Silva 4-2                 11</boundary-data>
+segments for the mobile terminals <part-num-ref name="mobile terminals">104,</part-num-ref>
+ <part-num-ref name="mobile terminals 104,">109,</part-num-ref>
+ <part-num-ref name="mobile terminals 104, 109,">110</part-num-ref>
+ and <part-num-ref name="and">111</part-num-ref>
+ are assigned timeslots on one or more of these pipes.    </p>
+    <p id="p-31" num="31">Once the virtual pipes have been provisioned, a data burst request is time-sliced into burst segments and assigned to potentially multiple pipes.</p>
+    <p id="p-32" num="32">
+      <boundary-data type="line-number">5  </boundary-data>
+FIG. 3 illustrates a simplest embodiment of the present invention in which a single burst is transmitted on a single virtual pipe <part-num-ref name="single virtual pipe">301.</part-num-ref>
+ Chronologically, the base station <part-num-ref name="base station">101</part-num-ref>
+ receives a forward burst request from the MSC <part-num-ref name="MSC">103,</part-num-ref>
+ usually in response to an earlier request for some data made by the mobile terminal <part-num-ref name="mobile terminal">104,</part-num-ref>
+ for example. There is some delay associated with control signaling for <boundary-data type="line-number">10  </boundary-data>
+burst setup, which is called <confidence value="22222">tbsut</confidence>
+ (the burst setup time for a new burst). There is another delay, noted in FIG. 3, which represents the time it takes to send an ESCAM to the mobile terminal. As earlier noted, the ESCAM is a signaling message sent on a control channel, which provides the mobile terminal with the information it needs to be able to listen in on the high-speed data burst <boundary-data type="line-number">15  </boundary-data>
+being received on a specific F-SCH. Any mobile terminal operating in accordance with the <confidence value="66">IS</confidence>
+-2000 standards is capable of decoding and responding to the ESCAM received from the base station. The ESCAM tells the mobile terminal when to start listening, which in FIG. 3 is at t1<confidence value="5">6</confidence>
+,1. At this time the base station <part-num-ref name="base station">101</part-num-ref>
+ sends the first burst segment A<confidence value="5">1</confidence>
+ to the mobile <boundary-data type="line-number">20  </boundary-data>
+terminal <part-num-ref name="mobile terminal">104,</part-num-ref>
+ for example, on the F-SCH <part-num-ref name="F-SCH">107</part-num-ref>
+ on the 16X virtual pipe <part-num-ref name="16X virtual pipe">202.</part-num-ref>
+ At some later point in time, the base station detects that another burst segment is approaching gets a trigger to send another ESCAM to mobile <part-num-ref name="trigger to send another ESCAM to mobile">104,</part-num-ref>
+ but this time it will be for a "burst continuation". This is at a time AtE before <confidence value="5685">t16,</confidence>
+2. The detai<confidence value="7">l</confidence>
+s of how this triggered will be described below. The ESCAM tells mobi<confidence value="78">le</confidence>
+ <page-break num="12"/>
+      <boundary-data type="header">Rai-Silva 4-2                   12</boundary-data>
+terminal <part-num-ref name="ESCAM tells mobile terminal">101</part-num-ref>
+ that a continuation to the current burst is approaching, the time it at which it will start, and which radio resources to which it should listen. At time t<confidence value="686">16.</confidence>
+2 base station <part-num-ref name="time it at which it will start, and which radio resources to which it should listen. At time t16.2 base station">101</part-num-ref>
+ starts transmitting burst segment A2. This sequence repeats until the entire high rate burst has been transmitted. For <boundary-data type="line-number">5 </boundary-data>
+this simple embodiment, the entire burst is transmitted utilizing a single 16X virtual pipe, which also implies that it is transmitted utilizing the same set of resources. The base station <part-num-ref name="base station">101</part-num-ref>
+ software does not have to exhaust any processing power in reallocating these resources, but simply has to determine how to partition the burst into segments and when to issue the burst segment <boundary-data type="line-number">10 </boundary-data>
+continuations via ESCAMs.    </p>
+    <p id="p-33" num="33">FIG. 4 illustrates an embodiment of the invention when a single virtual pipe services multiple bursts directed to multiple mobile terminals. FIG. 4 illustrates the case of two simultaneous burst requests being serviced by a single virtual pipe <part-num-ref name="single virtual pipe">401.</part-num-ref>
+ In practice, base station configurations will allow for <boundary-data type="line-number">15 </boundary-data>
+multiple virtual pipes of varying capacity. In the scenario of FIG. 4, two different mobile terminals <part-num-ref name="scenario of FIG. 4, two different mobile terminals">104</part-num-ref>
+ and <part-num-ref name="and">109</part-num-ref>
+ each simultaneously requests a burst, for example. Burst A arrives at base station <part-num-ref name="arrives at base station">101</part-num-ref>
+ before burst B. There is a finite burst setup time, t<confidence value="68686">bsutA</confidence>
+, which delays the start of transfer of burst A.    </p>
+    <p id="p-34" num="34">Burst A is scheduled first, the ESCAM is sent, and a start time of t<confidence value="5885">16,1</confidence>
+ <confidence value="88">is</confidence>
+ <boundary-data type="line-number">20 </boundary-data>
+chosen by base station <part-num-ref name="start time of t16,1 is chosen by base station">101.</part-num-ref>
+ Base station <part-num-ref name="start time of t16,1 is chosen by base station 101. Base station">101</part-num-ref>
+ starts to transfer the burst segment A<confidence value="5">1</confidence>
+ to mobile terminal <part-num-ref name="burst segment A1 to mobile terminal">104</part-num-ref>
+ at t1<confidence value="5">6</confidence>
+,1 on the 16X virtual pipe <part-num-ref name="16X virtual pipe">401.</part-num-ref>
+ At this point the burst setup time for burst B has also completed but the first burst segment of burst B cannot be transmitted since the virtual pipe <part-num-ref name="virtual pipe">401</part-num-ref>
+ is currently servicing burst segment A1. Base station <part-num-ref name="is currently servicing burst segment A1. Base station">101</part-num-ref>
+ triggers at the proper <page-break num="13"/>
+      <boundary-data type="header">Rai-Silva 4-2                 13</boundary-data>
+time and sends the ESCAM to mobile terminal <part-num-ref name="ESCAM to mobile terminal">109</part-num-ref>
+ to which burst B is directed to synchronize the burst start time and radio resources with it. At t1<confidence value="588">6,2</confidence>
+ base station <part-num-ref name="burst start time and radio resources with it. At t16,2 base station">101</part-num-ref>
+ transmits burst segment B1 to mobile terminal <part-num-ref name="transmits burst segment B1 to mobile terminal">109.</part-num-ref>
+ At some time before t1<confidence value="55">6,</confidence>
+3, base station <part-num-ref name="transmits burst segment B1 to mobile terminal 109. At some time before t16,3, base station">101</part-num-ref>
+ tells mobile terminal <part-num-ref name="tells mobile terminal">101</part-num-ref>
+ to get ready to <boundary-data type="line-number">5  </boundary-data>
+receive another burst segment from burst A. This form of time-division multiplexing of the 16X virtual pipe <part-num-ref name="16X virtual pipe">401</part-num-ref>
+ allows this resource to be shared amongst both of the mobile terminals <part-num-ref name="mobile terminals">104</part-num-ref>
+ and <part-num-ref name="and">109</part-num-ref>
+ that have a burst directed to them. Since base station <part-num-ref name="burst directed to them. Since base station">101</part-num-ref>
+ does not have to divide the resources in half, it does not have to do any further processing to reallocate these resources.    </p>
+    <p id="p-35" num="35">
+      <boundary-data type="line-number">10  </boundary-data>
+Whereas such processing and reallocation may not appear to involve much processing power with only two simultaneous bursts, the processing power that would otherwise be required would be significant when ten or more simultaneous bursts are present.    </p>
+    <p id="p-36" num="36">With reference to FIG. 5, a Burst Segment Control Structure <part-num-ref name="Burst Segment Control Structure">500</part-num-ref>
+ <boundary-data type="line-number">15  </boundary-data>
+functions to schedule and manage timeslots on each virtual pipe, where each virtual pipe in the system has its own structure <part-num-ref name="system has its own structure">500</part-num-ref>
+ allocated to it. Such a structure <part-num-ref name="structure">500</part-num-ref>
+ is completely embodied in software. The structure consists of two type of elements: a frame head pointer list <part-num-ref name="frame head pointer list">501,</part-num-ref>
+ and a collection of burst segment information blocks, for example, blocks <part-num-ref name="collection of burst segment information blocks, for example, blocks">502,</part-num-ref>
+ <part-num-ref name="collection of burst segment information blocks, for example, blocks 502,">503,</part-num-ref>
+ <part-num-ref name="collection of burst segment information blocks, for example, blocks 502, 503,">504,</part-num-ref>
+ <part-num-ref name="collection of burst segment information blocks, for example, blocks 502, 503, 504,">505,</part-num-ref>
+ <part-num-ref name="collection of burst segment information blocks, for example, blocks 502, 503, 504, 505,">506,</part-num-ref>
+ and <boundary-data type="line-number">20  </boundary-data>
+      <part-num-ref name="collection of burst segment information blocks, for example, blocks 502, 503, 504, 505, 506, and">507.</part-num-ref>
+ Each burst segment information block contains all the information necessary to properly place a particular burst segment on the virtual pipe with which the burst segment control structure <part-num-ref name="burst segment control structure">500</part-num-ref>
+ is associated in a scheduled timeslot. This information includes, for example, a burst ID, a burst segment start time, a burst segment duration. a burst information pointer to another <page-break num="14"/>
+      <boundary-data type="header">Rai-Silva 4-2                 14</boundary-data>
+block of data, and a next block point, where necessary, to another sibling block.    </p>
+    <p id="p-37" num="37">The frame head pointer list 501 consists of a plurality of frame pointers <part-num-ref name="plurality of frame pointers">508</part-num-ref>
+ that point either to a particular burst segment information block or are <boundary-data type="line-number">5 </boundary-data>
+NULL pointers if there is no information block assigned to that frame. The frame head pointer list <part-num-ref name="frame head pointer list">501</part-num-ref>
+ contains one frame header pointer per frame, which is a defined time period of, for example, <part-num-ref name="defined time period of, for example,">20</part-num-ref>
+ <confidence value="5">m</confidence>
+s. These frame head pointers are used to distribute the information held in the structure in the burst segment information blocks so that each burst segment is placed on the <boundary-data type="line-number">10 </boundary-data>
+virtual pipe that is associated with this particular burst segment control structure at a precise time, in frame increments of 20 <confidence value="5">m</confidence>
+s, for the example. It also contains information that is used to properly send an ESCAM to the target mobile terminal at a time that is sufficiently in advance of the time that it will be sending a burst segment to that mobile terminal. Depending upon the <boundary-data type="line-number">15 </boundary-data>
+length of the burst to be transmitted to a target mobile terminal, a burst request from the network can result in a plurality of burst segments, thereby producing a plurality of burst segment information blocks. As will be described, these burst segments are scheduled on one or more of the provisioned virtual pipes and in a manner such that different burst segments <boundary-data type="line-number">20 </boundary-data>
+of a particular burst are likely to be transmitted on different virtual pipes.    </p>
+    <p id="p-38" num="38">Depending upon the scheduling of the burst segments onto each virtual pipe, the burst segment control structure <part-num-ref name="burst segment control structure">500</part-num-ref>
+ for each such virtual pipe contains in a burst segment information block the information necessary for transmitting a burst segment at the scheduled time.    </p>
+    <boundary-data type="header">Rai-Silva 4-2                 15</boundary-data>
+    <p id="p-39" num="39">
+      <page-break num="15"/>
+The frame head pointers 508 are used to distribute the information held in the burst segment information blocks so that the information is properly ordered in time. The software then only scans particular portions of the information contained in the entire structure, specifically only the portions <boundary-data type="line-number">5  </boundary-data>
+which are in its frame of interest for the given time. The number of frame head pointers contained within the list is variable and is dependent upon both the frame size that has been selected to be used in the system and a window size, where the window size is the time it takes to cycle through each frame pointer in the frame head pointer list. A window size of one second and a <boundary-data type="line-number">10  </boundary-data>
+frame size of 20 ms results in a frame rate of <part-num-ref name="frame rate of">50</part-num-ref>
+ frames per second, or a system that has <part-num-ref name="system that has">50</part-num-ref>
+ frame head pointers <part-num-ref name="frame head pointers">508</part-num-ref>
+ per virtual pipe. Since the frame head pointer list represents a finite-sized window in time, such as the just noted exemplary one second, the burst segment information blocks that are scheduled in the future beyond that one second window, "wrap around<confidence value="22">''</confidence>
+ within <boundary-data type="line-number">15  </boundary-data>
+the burst segment control structure. For example, for the one second window and 20 ms frames, if a burst segment is scheduled to start exactly 2.02 seconds in the future, the burst segment information block is populated in the very next frame relative to the current frame, but is not scheduled until two wrap-arounds ahead in the future.    </p>
+    <p id="p-40" num="40">
+      <boundary-data type="line-number">20       </boundary-data>
+As a result of the wrap-around nature of the design, multiple burst segment information blocks can be associated with the same frame, but are not scheduled for transmission until times that are one-second ahead of a previous associated information block that is linked to the same frame head pointer. For example<confidence value="2">;</confidence>
+ burst segment information blocks <part-num-ref name="same frame head pointer. For example; burst segment information blocks">503,</part-num-ref>
+ <part-num-ref name="same frame head pointer. For example; burst segment information blocks 503,">504</part-num-ref>
+ and <part-num-ref name="and">505</part-num-ref>
+ <page-break num="16"/>
+      <boundary-data type="header">Rai-Silva 4-2                 16</boundary-data>
+illustratively containing burst segment information for burst segments A<confidence value="5">1</confidence>
+, D<confidence value="4">S</confidence>
+ and A3, respectively, from burst A and D, are all linked to the same frame head pointer <part-num-ref name="same frame head pointer">509.</part-num-ref>
+ As noted in their burst segment information blocks <part-num-ref name="same frame head pointer 509. As noted in their burst segment information blocks">503,</part-num-ref>
+ <part-num-ref name="same frame head pointer 509. As noted in their burst segment information blocks 503,">504</part-num-ref>
+ and <part-num-ref name="and">505,</part-num-ref>
+ the start times of burst segments A<confidence value="5">1</confidence>
+, D<confidence value="5">5</confidence>
+ and A3 are exactly one <boundary-data type="line-number">5  </boundary-data>
+second apart from each other at exemplary start times of 180 <confidence value="5">m</confidence>
+s, 1180 <confidence value="588">ms,</confidence>
+ and 2180 <confidence value="5">m</confidence>
+s, respectively. As shown, burst segment information block <part-num-ref name="ms, respectively. As shown, burst segment information block">505</part-num-ref>
+ is linked to its predecessor sibling block <part-num-ref name="is linked to its predecessor sibling block">504,</part-num-ref>
+ which in turn is linked to its predecessor sibling block <part-num-ref name="is linked to its predecessor sibling block 504, which in turn is linked to its predecessor sibling block">503,</part-num-ref>
+ since they all reside in the same frame head pointer <part-num-ref name="same frame head pointer">509.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">
+      <boundary-data type="line-number">10       </boundary-data>
+As each next timing event is generated by a timing control <part-num-ref name="timing control">515,</part-num-ref>
+ a current frame pointer <part-num-ref name="current frame pointer">510,</part-num-ref>
+ which points to the frame currently being processed, is moved to the next frame head pointer on list <part-num-ref name="next frame head pointer on list">501.</part-num-ref>
+ These timing events occur at the frame rate of <part-num-ref name="frame rate of">50</part-num-ref>
+ frames per second, or at 20 ms intervals.    </p>
+    <p id="p-42" num="42">When the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ reaches the last frame head pointer on <boundary-data type="line-number">15  </boundary-data>
+the frame head pointer list, it then wraps around back to the beginning of the list. As the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ moves from frame-to-frame in the list of frame header pointers, the software inspects all the burst segment information blocks that are associated with the pointed-to current frame and uses the start time information of each such block to decide whether to act on <boundary-data type="line-number">20  </boundary-data>
+that block if it is currently scheduled, or not to act on the block if the block's start time indicates that it is a future block that is aligned to the current frame.    </p>
+    <p id="p-43" num="43">If it is a future block, its start time is greater than the window size and the burst segment will not be processed during the current pass-through of frame head pointers. Rather, if it is a fut<confidence value="8">u</confidence>
+re <confidence value="22222">b!ock</confidence>
+, it will be processed when current <page-break num="17"/>
+      <boundary-data type="header">Rai-Silva 4-2                 17</boundary-data>
+frame pointer wraps around the window, for example one second or two seconds later. If it is a future block, the window size is then subtracted from its scheduled start time so that it can be processed at a subsequent pass through the frame head pointer list. For example, when the current frame <boundary-data type="line-number">5 </boundary-data>
+pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ points to frame header <part-num-ref name="points to frame header">509,</part-num-ref>
+ which points to the <part-num-ref name="">503,</part-num-ref>
+ <part-num-ref name="503,">504</part-num-ref>
+ and <part-num-ref name="and">505</part-num-ref>
+ information blocks, information block <part-num-ref name="information blocks, information block">503</part-num-ref>
+ is serviced since its start time is <part-num-ref name="is serviced since its start time is">180</part-num-ref>
+ <confidence value="5">m</confidence>
+s. One second is then subtracted from the start time of 1180 ms in information block <part-num-ref name="ms in information block">504</part-num-ref>
+ and from the start time of 2180 ms in information block <part-num-ref name="ms in information block">505.</part-num-ref>
+ Thus, the start time of information block <part-num-ref name="start time of information block">504</part-num-ref>
+ is changed to 180 ms and <boundary-data type="line-number">10  </boundary-data>
+the start time of block <part-num-ref name="start time of block">505</part-num-ref>
+ is changed to <part-num-ref name="is changed to">1180</part-num-ref>
+ <confidence value="5">m</confidence>
+s. At the next pass of the window one second later, information block <part-num-ref name="window one second later, information block">504</part-num-ref>
+ is serviced since its start time is now 180 <confidence value="5">m</confidence>
+s, and the start time of information block <part-num-ref name="start time of information block">505</part-num-ref>
+ is changed from 1180 ms to 180 ms so that it will be processed during the next wrap-around cycle.    </p>
+    <p id="p-44" num="44">
+      <boundary-data type="line-number">15       </boundary-data>
+As a burst segment is placed onto a virtual pipe for transmission to the mobile terminal to which it is directed, its respective burst segment information block is deleted from the control structure. Thus, as the information blocks are inspected for a given frame, an expired burst segment information block is erased and the frame head pointer is re-linked to the <boundary-data type="line-number">20 </boundary-data>
+deleted block's next-in-line sibling.    </p>
+    <p id="p-45" num="45">Even under heavy burst loads, there are likely to be many NULL pointers in frame head pointer list 501. As noted, a NULL pointer indicates that there is no change in the burst activity at that frame offset and thus no change in the operation of the virtual pipe has to be performed at that frame <page-break num="18"/>
+      <boundary-data type="header">
+        <confidence value="885">Rai</confidence>
+-Silva 4-2                 18      </boundary-data>
+time. For the exemplary system that utilizes <part-num-ref name="exemplary system that utilizes">50</part-num-ref>
+ frames per window, even if <part-num-ref name="frames per window, even if">20</part-num-ref>
+ burst segments are scheduled for the associated virtual pipe, at least <part-num-ref name="associated virtual pipe, at least">30</part-num-ref>
+ frame headers are NULL since many burst segments can be wrapped into the same frame.    </p>
+    <p id="p-46" num="46">
+      <boundary-data type="line-number">5        </boundary-data>
+While the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ points to a current frame that may or may not link to a burst segment information block that will cause a change of burst activity on the virtual pipe, a future frame pointer <part-num-ref name="future frame pointer">511</part-num-ref>
+ simultaneously points to another frame in the frame head point list that the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ will not reach until some time in the future. That future time is <boundary-data type="line-number">10 </boundary-data>
+equal to the frame offset between the current and future frame pointers. As timing control <part-num-ref name="current and future frame pointers. As timing control">515</part-num-ref>
+ generates a timing event that moves current frame pointer <part-num-ref name="timing event that moves current frame pointer">510</part-num-ref>
+ to the next frame head pointer, the future frame pointer <part-num-ref name="future frame pointer">511</part-num-ref>
+ is moved in parallel to its next sequential frame head pointer. This future frame pointer <part-num-ref name="is moved in parallel to its next sequential frame head pointer. This future frame pointer">511</part-num-ref>
+ is used to properly schedule transmission of an ESCAM, which needs to <boundary-data type="line-number">15 </boundary-data>
+be received by the mobile terminal a finite time before the mobile terminal is prepared to receive the actual burst segment from the base station. That finite time, described above, is illustrated in FIG. 3 as <confidence value="5885">AtE.</confidence>
+ For an exemplary system in which <confidence value="4">A</confidence>
+tE i<confidence value="5">s</confidence>
+ 120 <confidence value="66">ms</confidence>
+ and with a frame size <confidence value="5">o</confidence>
+f 20 <confidence value="5">m</confidence>
+s, the frame offset of the future frame pointer <part-num-ref name="future frame pointer">511</part-num-ref>
+ from the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ is six <boundary-data type="line-number">20 </boundary-data>
+frames. Thus, as the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ sequences from frame-to- frame in the frame head pointer list, the future frame pointer <part-num-ref name="future frame pointer">511</part-num-ref>
+ sequences in parallel from frame-to-frame six frames ahead. When the future frame pointer <part-num-ref name="future frame pointer">511</part-num-ref>
+ points to a pointer associated with a burst segment information block whose start time is less than the window size, an ESCAM for that burst <page-break num="19"/>
+      <boundary-data type="header">Rai-Silva 4-2                 19</boundary-data>
+segment is generated. That ESCAM is thus transmitted to the mobile terminal six frames, or 120 <confidence value="5">m</confidence>
+s, ahead of the time at which the current frame pointer <part-num-ref name="current frame pointer">510</part-num-ref>
+ will eventually reach that same frame head pointer and when that same burst segment will be transmitted on the virtual pipe.    </p>
+    <p id="p-47" num="47">
+      <boundary-data type="line-number">5       </boundary-data>
+FIG. 6 is a flowchart detailing the operation of the data burst driver for each virtual pipe that is established by the base station. The data burst driver associated with each virtual pipe is time-synchronized and wakes up on every frame (i.e., every <part-num-ref name="every">20</part-num-ref>
+ <confidence value="5">m</confidence>
+s). The data burst driver is responsible for acting with precise timing constraints on the information present in the virtual pipe's burst <boundary-data type="line-number">10  </boundary-data>
+segment control structure that was described above, and for removing the burst segment information blocks when a burst segment has completed. At step <part-num-ref name="burst segment has completed. At step">601,</part-num-ref>
+ in response to a timing event generated by the timing control, the current frame pointer and future frame pointer are incremented to their respective next sequential frames in the frame head pointer list. For the <boundary-data type="line-number">15  </boundary-data>
+described embodiment, such a timing event occurs every <part-num-ref name="timing event occurs every">20</part-num-ref>
+ <confidence value="5">m</confidence>
+s. At step <part-num-ref name="ms. At step">602,</part-num-ref>
+ the new current frame head pointer is scanned. At step <part-num-ref name="new current frame head pointer is scanned. At step">603,</part-num-ref>
+ a determination is made whether that current frame head pointer is NULL. If it is NULL, then no burst processing is required at this current frame (step <part-num-ref name="determination is made whether that current frame head pointer is NULL. If it is NULL, then no burst processing is required at this current frame (step">604)</part-num-ref>
+ and processing on the future frame pointer proceeds, as will be described. If the <boundary-data type="line-number">20  </boundary-data>
+current frame pointer is not NULL, then, at step <part-num-ref name="current frame pointer is not NULL, then, at step">605,</part-num-ref>
+ the list of burst segment information blocks associated with that current frame are navigated. At step <part-num-ref name="list of burst segment information blocks associated with that current frame are navigated. At step">606,</part-num-ref>
+ a burst segment is sent on the virtual pipe if a burst segment information block that is associated with that frame has a start time that is less than the framing window size (e.g., one sec). At step <part-num-ref name="one sec). At step">607,</part-num-ref>
+ the old burst se<confidence value="8">g</confidence>
+ment <page-break num="20"/>
+      <boundary-data type="header">Rai-Silva 4-2                 20</boundary-data>
+information block linked to the current frame is erased and, at step <part-num-ref name="current frame is erased and, at step">608,</part-num-ref>
+ the window size is subtracted from the start time for each sibling of the burst segment block that was just processed. Once the burst segment associated with the current frame has been processed, a burst segment information <boundary-data type="line-number">5 </boundary-data>
+block that is associated with the frame to which the future frame pointer points is processed. Thus, at step <part-num-ref name="future frame pointer points is processed. Thus, at step">609,</part-num-ref>
+ the future frame head pointer is scanned. At step <part-num-ref name="future frame head pointer is scanned. At step">610,</part-num-ref>
+ a determination is made whether that future frame head pointer is NULL. If it is NULL, then processing is complete for the frame (step 611). If it is not NULL, then, at step <part-num-ref name="frame (step 611). If it is not NULL, then, at step">612,</part-num-ref>
+ the list of burst segment <boundary-data type="line-number">10 </boundary-data>
+information blocks associated with that frame head pointer are navigated. At step <part-num-ref name="list of burst segment information blocks associated with that frame head pointer are navigated. At step">613,</part-num-ref>
+ an ESCAM is sent if the start time of any such burst segment information block is less than the framing window size. At that point, at step <part-num-ref name="framing window size. At that point, at step">611,</part-num-ref>
+ processing has been completed for this frame.    </p>
+    <p id="p-48" num="48">In fully loaded system, typically more bursts than there are virtual pipes <boundary-data type="line-number">15 </boundary-data>
+need to be simultaneously serviced. These bursts are scheduled onto the multiple virtual pipes in a manner that places the first burst segment of a burst on the widest virtual pipe. Accordingly, in a heavily loaded system, each burst is fairly allocated some resources on the widest, fastest rate pipe. FIG. 7 shows a <confidence value="5">1</confidence>
+6X virtual pipe <part-num-ref name="16X virtual pipe">701,</part-num-ref>
+ a 8X virtual pipe <part-num-ref name="8X virtual pipe">702</part-num-ref>
+ and a 4X virtual pipe <part-num-ref name="4X virtual pipe">703</part-num-ref>
+ <boundary-data type="line-number">20 </boundary-data>
+together servicing five simultaneous bursts labeled A, B, C, D and E. Each of these bursts is divided into burst segments, each separately notated in the Figure with a subscript. Burst A<confidence value="5">1</confidence>
+ is illustrated as starting in the 16X virtual pipe <part-num-ref name="16X virtual pipe">701,</part-num-ref>
+ followed by burst segments B1, C1, D<confidence value="5">1</confidence>
+ and E<confidence value="5">1</confidence>
+. After these burst segments are scheduled onto virtual pipe <part-num-ref name="16X virtual pipe 701, followed by burst segments B1, C1, D1 and E1. After these burst segments are scheduled onto virtual pipe">701</part-num-ref>
+ by means of that pipe's burst <page-break num="21"/>
+      <boundary-data type="header">Rai-Silva 4-2                 <confidence value="88">21</confidence>
+      </boundary-data>
+segment control structure, other burst segments are scheduled onto virtual pipes <part-num-ref name="by means of that pipe's burst segment control structure, other burst segments are scheduled onto virtual pipes">702</part-num-ref>
+ and <part-num-ref name="and">703</part-num-ref>
+ by means of each of those pipe's respective burst segment control structure. Thus, as can be noted, burst segment A2 is scheduled for transmission on the 8X virtual pipe <part-num-ref name="8X virtual pipe">702</part-num-ref>
+ at a time after burst <boundary-data type="line-number">5 </boundary-data>
+segment A<confidence value="5">1</confidence>
+ has completed transmission since the mobile terminal to which that burst A is directed is capable of receiving only one burst segment at a time. Before burst A<confidence value="5">1</confidence>
+ terminates on 16X pipe <part-num-ref name="time. Before burst A1 terminates on 16X pipe">701,</part-num-ref>
+ the burst segment control structure for 8X virtual pipe <part-num-ref name="burst segment control structure for 8X virtual pipe">702</part-num-ref>
+ processes a burst segment information block that tells the system to send an ESCAM to the mobile terminal that is <boundary-data type="line-number">10 </boundary-data>
+currently receiving burst segment A<confidence value="5">1</confidence>
+. This ESCAM informs that mobile terminal that burst segment A2 will start at some later time with a different rate and with a new set of radio resources than were being used to receive burst segment A<confidence value="68">1.</confidence>
+    </p>
+    <p id="p-49" num="49">By allocating resources on the widest, highest rate pipe to <boundary-data type="line-number">15 </boundary-data>
+accommodate at least the first burst segment of each burst, the plurality of currently active bursts are able to share the wider higher rate resources fairly.    </p>
+    <p id="p-50" num="50">As can be noted in FIG. 7, burst delivery is then cycled through the other lower-rate available virtual pipes in a round-robin manner, transmitting the different burst segments of a burst at different rates when the system is <boundary-data type="line-number">20 </boundary-data>
+heavily loaded, but still being capable of transmitting the burst segments at the higher rates when the system is lightly loaded.    </p>
+    <p id="p-51" num="51">Advantageously, the system has enough information to fill timeslot holes or double up burst segments for a given burst. For example, it can be noted that burst C, which only consists of burst segments C<confidence value="5">,</confidence>
+ and C2, <page-break num="22"/>
+      <boundary-data type="header">Rai-Silva 4-2                 22</boundary-data>
+completes with the sending of burst <confidence value="5">C</confidence>
+2 on the 8X virtual pipe <part-num-ref name="8X virtual pipe">702</part-num-ref>
+ at the same time that burst segment B3 is being sent on 4X virtual pipe <part-num-ref name="same time that burst segment B3 is being sent on 4X virtual pipe">703.</part-num-ref>
+ With the completion of burst C, there is no burst segment <confidence value="5">C</confidence>
+3 to follow burst segment <confidence value="5">B</confidence>
+3 in the next timeslot on virtual pipe <part-num-ref name="next timeslot on virtual pipe">703,</part-num-ref>
+ which would otherwise produce a <boundary-data type="line-number">5  </boundary-data>
+hole in this next timeslot. The scheduler, however, is able to calculate this in advance and schedule a double segment from burst B (i.e., burst segment B4 to follow burst segment <confidence value="5">B</confidence>
+3) on the 4X virtual pipe <part-num-ref name="4X virtual pipe">703</part-num-ref>
+ to fully utilize this pipe.    </p>
+    <p id="p-52" num="52">These scheduling decisions can be performed a priori because the scheduler has access to all the burst segment information by navigating the burst <boundary-data type="line-number">10  </boundary-data>
+segment control structures.    </p>
+    <p id="p-53" num="53">With reference to FIG. 8, bursts are scheduled on the widest virtual pipe in a round-robin fashion, which is depicted in the Figure with a "pizza" arbiter <part-num-ref name="&quot;pizza&quot; arbiter">801.</part-num-ref>
+ Pizza arbiter <part-num-ref name="&quot;pizza&quot; arbiter 801. Pizza arbiter">801</part-num-ref>
+ contains four active bursts A, B, C and D, which are scheduled burst segment-by-burst segment onto 16X virtual pipe <part-num-ref name="B, C and D, which are scheduled burst segment-by-burst segment onto 16X virtual pipe">802.</part-num-ref>
+    </p>
+    <p id="p-54" num="54">
+      <boundary-data type="line-number">15  </boundary-data>
+For illustration purposes, the current burst segment on virtual pipe <part-num-ref name="current burst segment on virtual pipe">802</part-num-ref>
+ is burst C<confidence value="2">1</confidence>
+. Transmission of burst segments A<confidence value="5">1</confidence>
+ and B<confidence value="5">1</confidence>
+ are shown to have preceded transmission of burst segment C<confidence value="5">1</confidence>
+. Also burst segments D1, A4, B4, <confidence value="5">C</confidence>
+4, D4<confidence value="5">,</confidence>
+ <confidence value="84">A7</confidence>
+ and B<confidence value="5">7</confidence>
+ are scheduled in future slots. Intervening burst segments are transmitted on other virtual pipes, not shown. While the current burst <boundary-data type="line-number">20  </boundary-data>
+segment <confidence value="55">C1</confidence>
+ is being transmitted, the base station receives a new burst request for burst E. The scheduling software schedules the first burst segment, E<confidence value="5">1</confidence>
+, of this new burst onto the widest pipe, the <confidence value="5">1</confidence>
+6X pipe. The pizza arbiter <part-num-ref name="pizza arbiter">801</part-num-ref>
+ is utilized to select a timeslot into which burst segment E<confidence value="5">1</confidence>
+ is scheduled. Specifically, a "slice" for burst E is inserted in the arbiter as far <page-break num="23"/>
+      <boundary-data type="header">Rai-Silva 4-2                 23</boundary-data>
+away from the current burst segment without wrapping around. Since a burst segment from burst C is currently being transmitted, with bursts segments from bursts D, A and B scheduled to follow, the furthest slot is after a burst segment from burst B just before another burst segment from burst C. The <boundary-data type="line-number">5 </boundary-data>
+arbiter <part-num-ref name="arbiter">803</part-num-ref>
+ shows a burst segment from burst E inserted in this position. The scheduler then scans the burst segment control structure for this 16X virtual pipe and determines a start time for burst segment E<confidence value="5">1</confidence>
+. It is assgined the slot previously reserved for burst segment <confidence value="5">C</confidence>
+4 and therefore is given its start time, as noted on the modified 16X virtual pipe <part-num-ref name="modified 16X virtual pipe">804.</part-num-ref>
+ The start times of all burst <boundary-data type="line-number">10 </boundary-data>
+segments that are scheduled starting after burst segment <confidence value="5">C</confidence>
+4 are thus shifted by a time equal to the duration of the inserted burst segment E<confidence value="5">1</confidence>
+. Also, the burst segments that have already been scheduled on other lower-rate pipes with a start time after the start time of burst segment E<confidence value="5">1</confidence>
+ are also shifted. For example, if burst segment <confidence value="55">C5</confidence>
+ had been assigned on a lower-rate pipe at a <boundary-data type="line-number">15 </boundary-data>
+time that followed burst segment <confidence value="5">C</confidence>
+4, its start time needs to be shifted on that pipe to re-align with the end of the time-shifted burst segment <confidence value="5">C</confidence>
+4 on the <confidence value="588">16X</confidence>
+ virtual pipe <part-num-ref name="16X virtual pipe">804.</part-num-ref>
+ This is necessary since, as afore noted, burst segments to the same mobile terminal cannot overlap in timeslots on any of the pipes and have to be separated in time since the mobile terminal can receive only from <boundary-data type="line-number">20 </boundary-data>
+one virtual pipe at any time.    </p>
+    <p id="p-55" num="55">Only a single round-robin pizza arbiter is required regardless of the number of virtual pipes. The arbiter is needed only for the widest, highest rate pipe where the first burst segment of each new burst is scheduled. The next burst seg<confidence value="8">m</confidence>
+ent of the new burst is then placed on the next highest rate <page-break num="24"/>
+      <boundary-data type="header">Rai-Silva 4-2                 24</boundary-data>
+pipe and is scheduled into a timeslot following completion of first highest-rate timeslot. This cascades onto the available pipes until a next burst segment wraps back into the highest-rate pipe, if necessary.    </p>
+    <p id="p-56" num="56">FIG. 9 is a high-level flowchart of the burst scheduler, which processes <boundary-data type="line-number">5  </boundary-data>
+forward burst requests from the network. At step <part-num-ref name="network. At step">901,</part-num-ref>
+ the base station receives a forward burst request from the network. The burst is directed to a particular mobile terminal in the base station's service area. At step <part-num-ref name="base station's service area. At step">902,</part-num-ref>
+ the current active burst load at the base station is compared against a threshold.    </p>
+    <p id="p-57" num="57">If, at step 903, the current active burst load is greater than a threshold, the <boundary-data type="line-number">10  </boundary-data>
+burst is denied and a back-off time is sent to network indicating when the burst request should be reattempted. If the active burst load is less than a threshold, then, at step <part-num-ref name="threshold, then, at step">904</part-num-ref>
+ power requirements are computed based on FCH power information. At step <part-num-ref name="power requirements are computed based on FCH power information. At step">905,</part-num-ref>
+ based on the power requirements, pipe usage requirements can be imposed on a power-hungry burst that is destined <boundary-data type="line-number">15  </boundary-data>
+to a mobile terminal that is far from the base station in order to restrict such a burst to the lower rate virtual pipes. At step <part-num-ref name="lower rate virtual pipes. At step">906,</part-num-ref>
+ the burst is partitioned into segments. At step <part-num-ref name="burst is partitioned into segments. At step">907,</part-num-ref>
+ the soonest possible burst segment start time on the widest, highest rate virtual pipe in the system for the first burst segment is calculated based on round robin scheduling. At step <part-num-ref name="first burst segment is calculated based on round robin scheduling. At step">908,</part-num-ref>
+ the first burst <boundary-data type="line-number">20  </boundary-data>
+segment is scheduled on the widest virtual pipe by allocating and populating a burst segment information block. The remaining burst segments are then scheduled amongst all the virtual pipes, as needed, in a round robin fashion.    </p>
+    <p id="p-58" num="58">At step 909, existing burst segments information blocks are shifted, as needed. Thus, as described above, if the scheduler needs to shift some of <page-break num="25"/>
+      <boundary-data type="header">Rai-Silva 4-2                 25</boundary-data>
+the burst segments that have already been given a start time on the widest pipe, it does so and modifies, as it needs to, any burst segment information block as long as an ESCAM has not already been sent for such burst segment. The shifting of burst segments is likely to result in burst segment <boundary-data type="line-number">5 </boundary-data>
+information blocks being moved to new frames in the control structure since shifting will impact all the burst segments that are scheduled after the insertion point of the new burst segment. Accordingly, the software navigates the control blocks and updates all affected burst segment information blocks.    </p>
+    <p id="p-59" num="59">As described above, this cascades into the other virtual pipe control <boundary-data type="line-number">10 </boundary-data>
+structures, which have burst segments scheduled thereon for the same affected bursts. At this point, at step <part-num-ref name="same affected bursts. At this point, at step">910,</part-num-ref>
+ once all shifting has been performed, the burst scheduler has updated the burst information control blocks for the existing burst segments, as required, and thus has completed processing for the new burst request. The information in the burst segment <boundary-data type="line-number">15 </boundary-data>
+control structures for each virtual pipe is thus now up-to-date and contains the latest burst request along with the updated information for the previously existing burst segments. The scheduler then waits for the next new burst request.    </p>
+    <p id="p-60" num="60">With reference to the block diagram of a base station <part-num-ref name="base station">1001</part-num-ref>
+ in FIG. 10, <boundary-data type="line-number">20 </boundary-data>
+the interaction between the various previously described software and hardware components is illustrated. The burst scheduler <part-num-ref name="burst scheduler">1002,</part-num-ref>
+ in response to burst requests received over a control channel <part-num-ref name="control channel">1003</part-num-ref>
+ from the MSC (not shown), divides each received burst into burst segments according to the burst length indicated in the burst request. The burst scheduler <part-num-ref name="burst scheduler">1002</part-num-ref>
+ then <page-break num="26"/>
+      <boundary-data type="header">Rai-Silva 4-2                 26</boundary-data>
+schedules each burst segment on one of the virtual pipes that have previously been provisioned at the base station. For illustrative purposes only, a 16X virtual pipe, an 8X virtual pipe, a 4X virtual pipe, and a 2X virtual pipe are shown provisioned at base station <part-num-ref name="2X virtual pipe are shown provisioned at base station">1001,</part-num-ref>
+ which is represented as resources <boundary-data type="line-number">5  </boundary-data>
+      <part-num-ref name="2X virtual pipe are shown provisioned at base station 1001, which is represented as resources">1004,</part-num-ref>
+ <part-num-ref name="2X virtual pipe are shown provisioned at base station 1001, which is represented as resources 1004,">1005,</part-num-ref>
+ <part-num-ref name="2X virtual pipe are shown provisioned at base station 1001, which is represented as resources 1004, 1005,">1006,</part-num-ref>
+ and <part-num-ref name="2X virtual pipe are shown provisioned at base station 1001, which is represented as resources 1004, 1005, 1006, and">1007,</part-num-ref>
+ on the base station's CDMA2000 ASIC <part-num-ref name="base station's CDMA2000 ASIC">1008.</part-num-ref>
+    </p>
+    <p id="p-61" num="61">For each burst segment, the burst scheduler <part-num-ref name="burst scheduler">1002</part-num-ref>
+ populates a burst segment information block within the particular burst segment control structure <part-num-ref name="particular burst segment control structure">1009</part-num-ref>
+ that is associated with the virtual pipe on which that burst segment has been scheduled. For this example, therefore, there are four burst segment control <boundary-data type="line-number">10  </boundary-data>
+structures <part-num-ref name="virtual pipe on which that burst segment has been scheduled. For this example, therefore, there are four burst segment control structures">1009,</part-num-ref>
+ one each associated with each of the provisioned virtual pipes (only two of such structures are shown in the figure). As previously described, each burst segment information block is populated with information relating to the associated burst segment and is linked to a specific frame on the frame head pointer list within the burst segment control structure <boundary-data type="line-number">15  </boundary-data>
+according to that burst segment's scheduled transmission time. The burst data driver <part-num-ref name="burst data driver">1010,</part-num-ref>
+ in response to timing events driven by a clock <part-num-ref name="clock">1011</part-num-ref>
+ at the exemplary 20 ms rate, reads the burst segment information blocks within each burst segment control structure <part-num-ref name="burst segment information blocks within each burst segment control structure">1009.</part-num-ref>
+ When it encounters a "live<confidence value="5">"</confidence>
+ burst segment information block, it transmits the associated burst segment that has <boundary-data type="line-number">20  </boundary-data>
+arrived at ASIC <part-num-ref name="associated burst segment that has arrived at ASIC">1008</part-num-ref>
+ over high-speed traffic channel <part-num-ref name="over high-speed traffic channel">1012.</part-num-ref>
+ That burst segment is transmitted at its scheduled time to its destined mobile terminal over the F-SCH <part-num-ref name="F-SCH">1013</part-num-ref>
+ via the particular virtual pipe 1004-1007 on which it has been scheduled. After burst data driver <part-num-ref name="particular virtual pipe 1004-1007 on which it has been scheduled. After burst data driver">1010</part-num-ref>
+ processes a live burst segment information block within a burst se<confidence value="8">g</confidence>
+ment control structure <part-num-ref name="burst segment control structure">1009,</part-num-ref>
+ it deletes that <page-break num="27"/>
+      <boundary-data type="header">Rai-Silva 4-2                 27</boundary-data>
+now dead block and adjusts the scheduled burst segment start times of any sibling burst segment information blocks. As previously described, that enables a sibling burst segment information block to be processed on a subsequent pass through that burst segment control structure's frame head <boundary-data type="line-number">5 </boundary-data>
+pointer list. Further, when the burst data driver <part-num-ref name="burst data driver">1010</part-num-ref>
+ encounters a burst segment that is scheduled to be transmitted at a predetermined time in the future, it sends an ESCAM to the mobile terminal to which that future burst segment is directed to prepare that mobile terminal to receive that burst segment.    </p>
+    <p id="p-62" num="62">
+      <boundary-data type="line-number">10       </boundary-data>
+Although described in conjunction with a CDMA2000 system, the present invention could be used in any other type of code division multiplexed wireless communications system in which data is transmitted in bursts to mobile terminals.    </p>
+    <p id="p-63" num="63">While the particular invention has been described with reference to <boundary-data type="line-number">15 </boundary-data>
+illustrative embodiments, this description is not meant to be construed in a limiting sense. It is understood that although the present invention has been described, various modifications of the illustrative embodiments, as well as additional embodiments of the invention, will be apparent to one of ordinary skill in the art upon reference to this description without departing from the <boundary-data type="line-number">20 </boundary-data>
+spirit of the invention, as recited in the claims appended hereto.    </p>
+    <p id="p-64" num="64">Consequently, the method, system and portions thereof and of the described method and system may be implemented in different locations, such as the wireless unit, the base station, a base station controller and/or mobile switching center. Moreover, processing circuitry required to implement and <page-break num="28"/>
+      <boundary-data type="header">Rai-Silva 4-2                <confidence value="88">28</confidence>
+      </boundary-data>
+use the described system may be implemented in application specific integrated circuits, software-driven processing circuitry, firmware, programmable logic devices, hardware, discrete components or arrangements of the above components as would be understood by one of <boundary-data type="line-number">5 </boundary-data>
+ordinary skill in the art with the benefit of this disclosure. Those skilled in the art will readily recognize that these and various other modifications, arrangements and methods can be made to the present invention without strictly following the exemplary applications illustrated and described herein and without departing from the spirit and scope of the present invention It is <part-num-ref name="present invention It is">10</part-num-ref>
+ therefore contemplated that the appended claims will cover any such modifications or embodiments as fall within the true scope of the invention.    </p>
+  </description>
+</us-patent-application>
+

applicant/10966258.xml

@@ -0,0 +1,31 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>10966258</doc-number>
+        <date>2008-07-03</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">App<confidence value="7">l</confidence>
+e. No. 10/966,258 <confidence value="2222">Amdt</confidence>
+. dated July 3, 2008 Reply to Office action of April <part-num-ref name="Reply to Office action of April">8,</part-num-ref>
+ <part-num-ref name="Reply to Office action of April 8,">2008</part-num-ref>
+ Amendments to the Specification:    </p>
+    <p id="p-2" num="2">At page 1 of the specification, please replace the paragraph beginning at page <part-num-ref name="paragraph beginning at page">7</part-num-ref>
+ with the following amended paragraph:    </p>
+    <p id="p-3" num="3">This application claims the benefit of U.S. provisional patent application Serial Nos. 60/568,433 filed May <part-num-ref name="benefit of U.S. provisional patent application Serial Nos. 60/568,433 filed May">4,</part-num-ref>
+ <part-num-ref name="benefit of U.S. provisional patent application Serial Nos. 60/568,433 filed May 4,">2004</part-num-ref>
+ Ap<confidence value="251882652">ri1-5,-29</confidence>
+4, 60/570177 filed May <part-num-ref name="Apri1-5,-294, 60/570177 filed May">11,</part-num-ref>
+ <part-num-ref name="Apri1-5,-294, 60/570177 filed May 11,">2004,</part-num-ref>
+ and 60/589,266 filed July <part-num-ref name="Apri1-5,-294, 60/570177 filed May 11, 2004, and 60/589,266 filed July">19,</part-num-ref>
+ <part-num-ref name="Apri1-5,-294, 60/570177 filed May 11, 2004, and 60/589,266 filed July 19,">2004</part-num-ref>
+ Page <part-num-ref name="Page">2</part-num-ref>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/10982304.xml

@@ -0,0 +1,253 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>10982304</doc-number>
+        <date>2004-11-05</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">
+      <confidence value="8">1</confidence>
+    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">G</confidence>
+P-3051<confidence value="88">16</confidence>
+    </boundary-data>
+    <heading id="h-1">CONTROL APPARATUS <confidence value="88">TO</confidence>
+ IMPROVE    </heading>
+    <heading id="h-2">START-UP TIME IN A PEM FUEL CELL POWER MODULE</heading>
+    <heading id="h-3">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">1.   Field of the Invention [0001]    This invention relates generally to a fuel cell system and, more particularly, to a fuel cell system that uses compressed and heated cathode input air to heat a fuel cell stack in the system at system start-up.</p>
+    <p id="p-2" num="2">2.   Discussion of the Related Art [0002]    Hydrogen is a very attractive fuel because it is clean and can be used to efficiently produce electricity in a fuel cell. The automotive industry expends significant resources in the development of hydrogen fuel cells as a source of power for vehicles. Such vehicles would be more efficient and generate fewer emissions than today's vehicles employing internal combustion engines.</p>
+    <p id="p-3" num="3">[0003]    A hydrogen fuel cell is an electro-chemical device that includes an anode and a cathode with an electrolyte therebetween. The anode receives hydrogen gas and the cathode receives oxygen or air. The hydrogen gas is disassociated in the anode to generate free hydrogen protons and electrons. The hydrogen protons pass through the electrolyte to the cathode.</p>
+    <p id="p-4" num="4">The hydrogen protons react with the oxygen and the electrons in the cathode to generate water. The electrons from the anode cannot pass through the electrolyte, and thus are directed through a load to perform work before being sent to the cathode. The work acts to operate the vehicle.</p>
+    <p id="p-5" num="5">[0004]    Proton exchange membrane fuel cells (PEMFC) are a popular fuel cell for vehicles. The PEMFC generally includes a solid polymer electrolyte proton conducting membrane, such as a perfluorosulfonic acid membrane. The anode and cathode typically include finely divided catalytic particles, usually platinum (Pt), supported on carbon particles and mixed with an ionomer. Th<confidence value="5">e</confidence>
+ catalytic mixture is deposited on opposing sides of the membrane.    </p>
+    <p id="p-6" num="6">The combination of the anode catalytic mixture, the cathode catalytic mixture and <page-break num="2"/>
+      <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">G</confidence>
+P-3051<confidence value="88">16</confidence>
+      </boundary-data>
+the membrane define a membrane electrode assembly (MEA). MEAs are relatively expensive to manufacture and require certain conditions for effective operation.  These conditions include proper water management and humidification, and control of catalyst poisoning constituents, such as carbon monoxide (<confidence value="6688">CO).</confidence>
+    </p>
+    <p id="p-7" num="7">[0005]    Several fuel cells are typically combined in a fuel cell stack to generate the desired power. For example, a typical fuel cell stack for a vehicle may have two hundred stacked fuel cells. The fuel cell stack receives a cathode input gas, typically a flow of air forced through the stack by a compressor. Not all of the oxygen is consumed by the stack and some of the air is output as a cathode exhaust gas that may include water as a stack by-product. The fuel cell stack also receives an anode hydrogen input gas that flows into the anode side of the stack.</p>
+    <p id="p-8" num="8">[0006]    The fuel cell stack includes a series of bipolar plates positioned between the several MEAs in the stack. The bipolar plates include an anode side and a cathode side for adjacent fuel cells in the stack. Anode gas flow channels are provided on the anode side of the bipolar plates that allow the anode gas to flow to the respective MEA. Cathode gas flow channels are provided on the cathode side of the bipolar plates that allow the cathode gas to flow to the respective MEA. The bipolar plates are made of a conductive material, such as stainless steel, so that they conduct the electricity generated by the fuel cells out of the stack. The bipolar plates also include flow channels through which a cooling fluid flows.</p>
+    <p id="p-9" num="9">[0007]   It is desirable during certain fuel cell operating conditions, such as fuel cell start-up, low power operation, low ambient temperature operation, etc., to provide supplemental heat to the fuel cells to maintain the desired operating temperature within the fuel cell stack for proper water management and reaction kinetics purposes. Particularly, the MEAs must have a proper relative humidity (RH) and the fuel cells must be within a certain temperature range to operate efficiently.</p>
+    <p id="p-10" num="10">[0008]   At cold system start-up before the fuel cell stack has reached its desired operating temperature, the stack is unable to produce enough power <page-break num="3"/>
+      <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">G</confidence>
+P-3051<confidence value="88">16</confidence>
+      </boundary-data>
+to operate the vehicle. Therefore, the vehicle operator must wait a certain period of time until the fuel cell stack reaches its operating temperature before operating the vehicle. Typical fuel cell stacks take about <part-num-ref name="vehicle. Typical fuel cell stacks take about">160</part-num-ref>
+ seconds to reach their operating temperature as a result of stack inefficiencies at which time they are able to provide power to operate the vehicle. It would be desirable to provide supplemental heat to quickly increase the temperature of the fuel cell stack at vehicle start-up so that the vehicle operator can immediately operate the vehicle <confidence value="8">.</confidence>
+    </p>
+    <heading id="h-4">SUMMARY OF THE INVENTION</heading>
+    <p id="p-11" num="11">[0009]    In accordance with the teachings of the present invention, a fuel cell system is disclosed that uses compressed and heated cathode input air to heat the fuel cell stack at system start-up. The system includes a heat exchanger that uses the system cooling fluid to cool the compressed and heated cathode input air before it is sent to the fuel cell stack. At system start-up, a proportional by-pass valve directs a controlled portion of the cooling fluid around the heat exchanger so that the heated cathode input air can be used to heat the fuel cell stack. Once the stack reaches its operating temperature, the by-pass valve will be used to maintain cathode inlet temperature. The fuel cell system also includes an inlet air valve that is used to choke the compressor at system start-up to cause the compressor to more rapidly heat the compressed air, especially when the ambient air temperature is low.</p>
+    <p id="p-12" num="12">[0010]    Additional advantages and features of the present invention will become apparent from the following description and appended claims, taken in conjunction with the accompanying drawings.</p>
+    <heading id="h-5">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-13" num="13">[0011]    Figure 1 is a schematic plan view of a fuel cell system that employs a proportional valve for directing a cooling fluid around a heat exchanger that cools the compressed cathode input air to allow the heated input air to heat the fuel cell stack at system start-up; and [0012]    Figure 2 is a flow chart diagram showing the operation of controlling the proportional valve in the system shown in figure 1.</p>
+    <boundary-data type="header">
+      <confidence value="8">4</confidence>
+    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">G</confidence>
+P-3051<confidence value="88">16</confidence>
+    </boundary-data>
+    <heading id="h-6">DETAILED DESCRIPTION OF THE EMBODIMENTS</heading>
+    <p id="p-14" num="14">
+      <page-break num="4"/>
+[0013]   The following discussion of the embodiments of the invention directed to a technique for using compressed cathode input air to heat a fuel cell stack at system start-up is merely exemplary in nature, and is in no way intended to limit the invention or its applications or uses.    </p>
+    <p id="p-15" num="15">[0014]    Figure 1 is a schematic plan view of a fuel cell system <part-num-ref name="fuel cell system">10</part-num-ref>
+ including a fuel cell stack <part-num-ref name="fuel cell stack">12.</part-num-ref>
+ A cooling fluid flows through a coolant loop <part-num-ref name="coolant loop">14</part-num-ref>
+ and flow channels in the stack <part-num-ref name="stack">12</part-num-ref>
+ to maintain the stack <part-num-ref name="stack">12</part-num-ref>
+ at a desired operating temperature, such as between 60<confidence value="5882">-80*</confidence>
+C, to provide efficient stack operation. A pump <part-num-ref name="pump">16</part-num-ref>
+ pumps the cooling fluid through the coolant loop <part-num-ref name="coolant loop">14,</part-num-ref>
+ and a radiator <part-num-ref name="radiator">18</part-num-ref>
+ cools the cooling fluid in the coolant loop <part-num-ref name="coolant loop">14</part-num-ref>
+ to prevent the cooling fluid from becoming too hot, consistent with the discussion below. A compressor <part-num-ref name="compressor">24</part-num-ref>
+ receives air on an air input line <part-num-ref name="air input line">26</part-num-ref>
+ and provides compressed air on line <part-num-ref name="and provides compressed air on line">28</part-num-ref>
+ to be applied to the cathode input manifold of the stack <part-num-ref name="stack">12</part-num-ref>
+ on input line <part-num-ref name="on input line">30.</part-num-ref>
+ A motor <part-num-ref name="motor">32</part-num-ref>
+ drives the compressor <part-num-ref name="compressor">24.</part-num-ref>
+ An air inlet valve <part-num-ref name="air inlet valve">22</part-num-ref>
+ is used to selectively allow air to flow to the compressor <part-num-ref name="compressor">24</part-num-ref>
+ to choke the compressor <part-num-ref name="compressor">24</part-num-ref>
+ during system start-up for reasons that will become apparent from the discussion below. A humidification unit <part-num-ref name="humidification unit">36</part-num-ref>
+ provides moisture in the compressed input air to help maintain the desired relative humidity of the fuel cell membranes within the stack <part-num-ref name="stack">12.</part-num-ref>
+ The stack relative humidity is also controlled by the stack pressure through, for example, a backpressure valve (not shown) in the cathode exhaust gas line.    </p>
+    <p id="p-16" num="16">[0015]    The system <part-num-ref name="system">10</part-num-ref>
+ further includes a proportional by-pass valve <part-num-ref name="proportional by-pass valve">42</part-num-ref>
+ that selectively allows a portion of the cooling fluid to by-pass the radiator <part-num-ref name="radiator">18</part-num-ref>
+ when the temperature of the cooling fluid in the coolant loop <part-num-ref name="coolant loop">14</part-num-ref>
+ is below the desired operating temperature of the fuel cell stack <part-num-ref name="fuel cell stack">12.</part-num-ref>
+ The system <part-num-ref name="system">10</part-num-ref>
+ also includes a temperature sensor <part-num-ref name="temperature sensor">44</part-num-ref>
+ that measures the temperature of the cooling fluid in the loop <part-num-ref name="loop">14</part-num-ref>
+ coming out of the stack <part-num-ref name="stack">12</part-num-ref>
+ and a temperature sensor <part-num-ref name="temperature sensor">46</part-num-ref>
+ that measures the temperature of the air going into the humidification unit <part-num-ref name="humidification unit">36</part-num-ref>
+ on the line <part-num-ref name="line">30.</part-num-ref>
+    </p>
+    <p id="p-17" num="17">[0016]    Because compressing the air on the line <part-num-ref name="line">26</part-num-ref>
+ also significantly heats the air, the system <part-num-ref name="system">10</part-num-ref>
+ includes a heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ to cool the heated air <page-break num="5"/>
+      <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">G</confidence>
+P-3051<confidence value="88">16</confidence>
+      </boundary-data>
+before being applied to the line <part-num-ref name="line">30.</part-num-ref>
+ Particularly, in a typical fuel cell system, the cathode input air is compressed to a pressure of about 2-3 bar, which also heats the air to about 140<confidence value="2688825">*-160*C</confidence>
+ at maximum output. This temperature is too hot for the stack <part-num-ref name="stack">12</part-num-ref>
+ and will damage the fuel cells in the stack <part-num-ref name="stack">12.</part-num-ref>
+ In order to address this concern, the system <part-num-ref name="system">10</part-num-ref>
+ directs a portion of the cooling fluid in the loop <part-num-ref name="loop">14</part-num-ref>
+ to the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ to cool the compressed air for efficient stack operation.    </p>
+    <p id="p-18" num="18">Therefore, the cathode input air would be at the temperature of the cooling fluid, which could be quite low at system start-up. The heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ can be any liquid/gas heat exchanger suitable for the purposes discussed herein.    </p>
+    <p id="p-19" num="19">[0017]    According to the invention, the fuel cell system <part-num-ref name="fuel cell system">10</part-num-ref>
+ includes a proportional by-pass valve <part-num-ref name="proportional by-pass valve">50</part-num-ref>
+ that selectively directs the portion of the cooling fluid in the coolant loop <part-num-ref name="coolant loop">14</part-num-ref>
+ sent to the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ through the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ on a line <part-num-ref name="line">38</part-num-ref>
+ or to a line <part-num-ref name="line">52</part-num-ref>
+ that by-passes the heat exchanger <part-num-ref name="heat exchanger">34.</part-num-ref>
+    </p>
+    <p id="p-20" num="20">The cooling fluid sent through the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ on the line <part-num-ref name="line">38</part-num-ref>
+ and the cooling fluid sent around the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ on the line <part-num-ref name="line">52</part-num-ref>
+ are combined in a mixer <part-num-ref name="mixer">54.</part-num-ref>
+ In this design, the cooling fluid in the loop <part-num-ref name="loop">14</part-num-ref>
+ that is not sent to the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ by a flow controller <part-num-ref name="flow controller">48</part-num-ref>
+ is directed through the stack <part-num-ref name="stack">12.</part-num-ref>
+ The cooling fluid that is directed through the flow controller <part-num-ref name="flow controller">48</part-num-ref>
+ to the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ by-passes the stack <part-num-ref name="stack">12</part-num-ref>
+ on line <part-num-ref name="on line">56.</part-num-ref>
+ The cooling fluid exiting the stack <part-num-ref name="stack">12</part-num-ref>
+ is combined with the cooling fluid on the line <part-num-ref name="line">56</part-num-ref>
+ by a mixer <part-num-ref name="mixer">58.</part-num-ref>
+    </p>
+    <p id="p-21" num="21">[0018]    At system start-up when the stack <part-num-ref name="stack">12</part-num-ref>
+ is usually cold, the compressor <part-num-ref name="compressor">24</part-num-ref>
+ is started to compress the cathode input air, which provides heated air to the stack <part-num-ref name="stack">12.</part-num-ref>
+ Normally, a portion of the cooling fluid in the coolant loop <part-num-ref name="coolant loop">14,</part-num-ref>
+ which is at the same temperature as the stack <part-num-ref name="stack">12</part-num-ref>
+ at start-up, would be directed through the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ to cool the cathode air before being applied to the stack <part-num-ref name="stack">12.</part-num-ref>
+ However, the proportional valve <part-num-ref name="proportional valve">50</part-num-ref>
+ can be used to selectively direct some of the cooling fluid <part-num-ref name="cooling fluid">14</part-num-ref>
+ around the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ <confidence value="66">so</confidence>
+ that the cathode input air on the line <part-num-ref name="line">30</part-num-ref>
+ is not cooled down all the way to the temperature of the cooling fluid. Therefore, the cathode input air will be heated some amount less than the temperature that would damage the fuel cells in the stack <part-num-ref name="stack">12,</part-num-ref>
+ but would more quickly heat the stack <part-num-ref name="stack">12</part-num-ref>
+ at start-up than is currently available in the art. A controller <part-num-ref name="controller">60</part-num-ref>
+ receives temperature signals from the <page-break num="6"/>
+      <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">G</confidence>
+P-305116      </boundary-data>
+temperature sensors <part-num-ref name="temperature sensors">44</part-num-ref>
+ and <part-num-ref name="and">46,</part-num-ref>
+ and controls the motor <part-num-ref name="motor">32,</part-num-ref>
+ the pump <part-num-ref name="pump">16,</part-num-ref>
+ the by- pass valve <part-num-ref name="by- pass valve">42</part-num-ref>
+ and the by-pass valve <part-num-ref name="by-pass valve">50</part-num-ref>
+ consistent with the discussion herein. It may be desirable to operate the speed of the pump <part-num-ref name="pump">16</part-num-ref>
+ slowly at system start-up.    </p>
+    <p id="p-22" num="22">[0019]    Figure 2 is a flow chart diagram <part-num-ref name="flow chart diagram">70</part-num-ref>
+ showing the operation of the fuel cell system <part-num-ref name="fuel cell system">10</part-num-ref>
+ for providing heated cathode input air at system start-up, according to one embodiment of the present invention. After the control algorithm is initialized, the algorithm measures the temperature of the cooling fluid exiting the stack <part-num-ref name="stack">12</part-num-ref>
+ by the sensor <part-num-ref name="sensor">44</part-num-ref>
+ at box <part-num-ref name="at box">72.</part-num-ref>
+ The algorithm then determines whether the measured temperature of the cooling fluid out of the stack <part-num-ref name="stack">12</part-num-ref>
+ minus a desired operating temperature of the cooling fluid out of the stack <part-num-ref name="stack">12</part-num-ref>
+ is less than a predetermined value X defined by a minimum temperature difference to provide a fast enough start-up at decision diamond <part-num-ref name="fast enough start-up at decision diamond">74.</part-num-ref>
+ Particularly, if the vehicle has not been off for a long enough time where the temperature of the stack <part-num-ref name="stack">12</part-num-ref>
+ would be significantly reduced, then it is not necessary to heat the cathode input air to bring the stack <part-num-ref name="stack">12</part-num-ref>
+ up to temperature quicker. If this temperature difference is less than the predetermined value X, then the algorithm would activate the normal operating sequence for a hot stack at box <part-num-ref name="hot stack at box">76.</part-num-ref>
+    </p>
+    <p id="p-23" num="23">[0020]    If the cooling fluid is too cool at start-up, then the algorithm puts the proportional valves <part-num-ref name="proportional valves">42</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ into their full by-pass mode at box <part-num-ref name="into their full by-pass mode at box">78.</part-num-ref>
+ In the full by-pass mode, the proportional valve <part-num-ref name="proportional valve">50</part-num-ref>
+ is set so that a predetermined maximum amount of the cooling fluid will flow around the heat exchanger <part-num-ref name="heat exchanger">34</part-num-ref>
+ on the line <part-num-ref name="line">52,</part-num-ref>
+ and the proportional valve <part-num-ref name="proportional valve">42</part-num-ref>
+ is set so that a predetermined maximum amount of the cooling fluid in the cooling loop <part-num-ref name="cooling loop">14</part-num-ref>
+ will by-pass the radiator <part-num-ref name="radiator">18.</part-num-ref>
+ Next, the algorithm sets the inlet air valve <part-num-ref name="inlet air valve">22</part-num-ref>
+ to a predetermined choke position at box <part-num-ref name="predetermined choke position at box">80</part-num-ref>
+ that causes the compressor <part-num-ref name="compressor">24</part-num-ref>
+ to work harder to draw air through the valve <part-num-ref name="valve">22,</part-num-ref>
+ so that the compressed air is heated even more than it otherwise would be from the normal compression of the air, especially when the ambient air temperature is low. The algorithm then starts the pump <part-num-ref name="pump">16</part-num-ref>
+ to pump the cooling fluid through the coolant loop <part-num-ref name="coolant loop">14</part-num-ref>
+ at box <part-num-ref name="at box">82,</part-num-ref>
+ starts the compressor <part-num-ref name="compressor">24</part-num-ref>
+ at box <part-num-ref name="at box">84</part-num-ref>
+ and starts the hydrogen flow to the stack <part-num-ref name="stack">12</part-num-ref>
+ at box <part-num-ref name="at box">86.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">[0021]    The algorithm then measures the temperature of the cathode inlet air by the temperature sensor <part-num-ref name="temperature sensor">46</part-num-ref>
+ at box <part-num-ref name="at box">88.</part-num-ref>
+ The algorithm determines <page-break num="7"/>
+      <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">G</confidence>
+P-305116      </boundary-data>
+whether the temperature of the cathode inlet air is less than the maximum safe temperature for the stack <part-num-ref name="stack">12</part-num-ref>
+ at decision diamond <part-num-ref name="at decision diamond">90.</part-num-ref>
+ If the temperature of the cathode inlet air is not at the maximum safe stack temperature, then the algorithm adjusts the proportional valve <part-num-ref name="proportional valve">50</part-num-ref>
+ at box <part-num-ref name="at box">92,</part-num-ref>
+ and returns to measuring the cathode inlet air temperature at the box <part-num-ref name="box">88.</part-num-ref>
+ Particularly, as the temperature of the cathode inlet air increases at system start-up, the controller <part-num-ref name="controller">60</part-num-ref>
+ controls the position of the proportional valve <part-num-ref name="proportional valve">50</part-num-ref>
+ so that less of the cooling fluid by-passes the heat exchanger <part-num-ref name="heat exchanger">34,</part-num-ref>
+ so that the maximum temperature of the input air is not exceeded.    </p>
+    <p id="p-25" num="25">[0022]   When the temperature of the cathode inlet air reaches the maximum safe temperature of the stack <part-num-ref name="stack">12</part-num-ref>
+ at the decision diamond <part-num-ref name="decision diamond">90,</part-num-ref>
+ then the algorithm measures the output temperature of the cooling fluid from the stack <part-num-ref name="stack">12</part-num-ref>
+ by the temperature sensor <part-num-ref name="temperature sensor">44</part-num-ref>
+ at box <part-num-ref name="at box">94.</part-num-ref>
+ The algorithm then determines whether the cooling fluid temperature is equal to the stack operating temperature at decision diamond <part-num-ref name="stack operating temperature at decision diamond">96.</part-num-ref>
+ If the temperature of the cooling fluid out of the stack <part-num-ref name="stack">12</part-num-ref>
+ is at the stack operating temperature, then the algorithm positions the by-pass valve <part-num-ref name="by-pass valve">50</part-num-ref>
+ so that all of the cooling fluid from the flow controller <part-num-ref name="flow controller">48</part-num-ref>
+ is sent through the heat exchanger <part-num-ref name="heat exchanger">34,</part-num-ref>
+ and continues with the regular operating sequence at the box <part-num-ref name="box">76.</part-num-ref>
+ The position of the by-pass valve <part-num-ref name="by-pass valve">42</part-num-ref>
+ is also set accordingly so that the temperature of the cooling fluid does not exceed the operating temperature of the stack <part-num-ref name="stack">12.</part-num-ref>
+ If the temperature of the cooling fluid out of the stack <part-num-ref name="stack">12</part-num-ref>
+ is not at the stack operating temperature, then the algorithm returns to the box <part-num-ref name="box">88</part-num-ref>
+ to measure the temperature of the cathode inlet air.    </p>
+    <p id="p-26" num="26">[0023]    The foregoing discussion discloses and describes merely exemplary embodiments of the present invention. One skilled in the art will readily recognize from such discussion and from the accompanying drawings and claims that various changes, modifications and variations can be made therein without departing from the spirit and scope of the invention as defined in the following claims.</p>
+  </description>
+</us-patent-application>
+

applicant/11026904.xml

@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11026904</doc-number>
+        <date>2005-10-03</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Application No. 11/026,904 Docket No. 29250-002084/U<confidence value="5">S</confidence>
+     </p>
+    <heading id="h-1">IN THE SPECIFICATION</heading>
+    <p id="p-2" num="2">Please replace the following paragraphs of the specification. Applicant includes herewith an Attachment for Spec<confidence value="5">i</confidence>
+fication Amendments showing a marked up version of each replacement paragraph.    </p>
+    <p id="p-3" num="3">Page 1, paragraph [00021:</p>
+    <p id="p-4" num="4">
+      <confidence value="5">[</confidence>
+0002<confidence value="5">]</confidence>
+    Sometimes, however, it may be necessary for a mobile device to associate itself with an AP based on other factors in addition to SNR. For example, it may be necessary to associate a mobile device with an AP that does not provide transmissions having high signal-to-noise ratios (SNR) in order to achieve overall load balancing goals for all APs within a WLAN. In such a case, a mobile device may be associated with an AP based on other factors in addition to SNR, such as the congestion levels at APs to meet overall load balancing goals of a WLAN.    </p>
+    <p id="p-5" num="5">Page 3, paragraph <confidence value="5">[</confidence>
+00111:    </p>
+    <p id="p-6" num="6">
+      <confidence value="5">[</confidence>
+0011<confidence value="5">]</confidence>
+    At some point in time, a mobile device x is associated with access point AP<confidence value="2">u</confidence>
+ and it has been pre-determined that access points AP<confidence value="2">"</confidence>
+ and AP<confidence value="1">~</confidence>
+ are adjacent. That is, using the techniques disclosed in co-pending Patent Application  No. 11/026,905 mentioned above it has previously been determined that access points AP<confidence value="2">,</confidence>
+ and AP<confidence value="1">~</confidence>
+ are connected by an "edge" in an access point adjacency graph (APAG).    </p>
+    <p id="p-7" num="7">Page 3, paragraph <confidence value="5">[</confidence>
+00121 <confidence value="5">[</confidence>
+0012<confidence value="5">]</confidence>
+    Sometime thereafter, it becomes desirable to associate the mobile device x with another access point to achieve the load balancing goals of <confidence value="86">WL</confidence>
+AN <part-num-ref name="load balancing goals of WLAN">1.</part-num-ref>
+ In the explanation which follows, it will be assumed that it is desirable to change the access point association of mobile device x from AP<confidence value="2">,</confidence>
+ to <confidence value="881">AP~</confidence>
+ even though access point AP<confidence value="1">~</confidence>
+ may not be able to provide transmissions to mobile device x at a highest (or even high) SNR level.    </p>
+    <p id="p-8" num="8">Page 2 </p>
+  </description>
+</us-patent-application>
+

applicant/11033590.xml

@@ -0,0 +1,83 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11033590</doc-number>
+        <date>2009-06-23</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Atty. Dkt. No. 045814-0104</boundary-data>
+    <p id="p-1" num="1">Amendments to the S<confidence value="5">p</confidence>
+ecification:    </p>
+    <p id="p-2" num="2">Please replace paragraphs [0025]-[0026] with the following, rewritten paragraphs:</p>
+    <p id="p-3" num="3">[0025] FIGs. <confidence value="4456">l0ab</confidence>
+ [[is a]] are flow diagrams illustrating an example of logic used to calculate the real-time start time and the real-time end time for a single encounter using the present invention;    </p>
+    <p id="p-4" num="4">[0026] FIGs. 1<confidence value="4">1</confidence>
+ <confidence value="85">a-</confidence>
+c [[is a<confidence value="66">]]</confidence>
+ <confidence value="666">are</confidence>
+ flow diagrams illustrating an example of logic used to calculate the real-time start time and the real-time end time for all encounters in a single operating room using the present invention; and Please replace paragraph [0052] with the following, rewritten paragraph:    </p>
+    <p id="p-5" num="5">[0052] FIGs. <confidence value="4456">l0ab</confidence>
+ [[is a]] <confidence value="66">ar</confidence>
+e flow diagrams illustrating an example of logic used to calculate the real-time start time and the real-time end time for a single encounter using the real-time status system of the present invention. To calculate and update the real-time information, the system of the present invention stores real-time information for each encounter including a real-time start time and a real-time end time. Depending on the status of the encounter, the real-time start time and the real-time end time for the encounter are either actual times as recorded in the encounter tracking log, or estimated times calculated as described below. For instance, if an encounter has started but not yet ended, the real-time start time for the encounter will correspond to the actual start time recorded in the tracking log for the encounter, but the real-time end time will be an estimated end time for the encounter calculated as described below. The real-time start time and the real-time end time for each encounter are displayed on the graphical user interface as the real-time status of the encounter.    </p>
+    <p id="p-6" num="6">Please replace paragraph [0055] with the following, rewritten paragraph:</p>
+    <p id="p-7" num="7">[0055] FIGs. 1<confidence value="5">1</confidence>
+ <confidence value="888">a-c</confidence>
+ [[is a]] <confidence value="666">are</confidence>
+ flow diagrams illustrating an example of logic used to calculate the real-time start and end times for all encounters in a single operating room using the present invention. In updating the display for an entire room <part-num-ref name="entire room">230,</part-num-ref>
+ the system stores a maximum end time, which the system initially sets to the current time <part-num-ref name="current time">231.</part-num-ref>
+ The system then <boundary-data type="header">-2-</boundary-data>
+      <boundary-data type="header">MADI_1903657.2</boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">Atty. Dkt. No. 045814-0104</boundary-data>
+determines whether a refresh is needed <part-num-ref name="refresh is needed">232.</part-num-ref>
+ Preferably, the system refreshes when a refresh is requested, but only refreshes the data that is old enough, that is, data that has not been updated in for example the last minute. The system could, however, refresh all the data whenever a request is made, or could refresh all the data automatically at certain time intervals, for example, the system could refresh automatically once every minute. In addition, the system could use logic that includes a modification factor to prevent all of the data for coming up for refresh at the same time, as it is inefficient for the system to refresh all the data at one time. If a refresh is not needed 232b, the update is completed <part-num-ref name="update is completed">259.</part-num-ref>
+ If a refresh is needed 232a, the system then loops through the earlier encounters <part-num-ref name="earlier encounters">233,</part-num-ref>
+ i.e., the encounters that have real-time start times, calculated as described above and shown in FIG<confidence value="45">s.</confidence>
+ <confidence value="6486">10a-</confidence>
+b, earlier than the current time. The system downloads the encounter tracking information from the tracking log for each encounter in the room being updated <part-num-ref name="room being updated">234,</part-num-ref>
+ and checks to see if any encounters have started <part-num-ref name="room being updated 234, and checks to see if any encounters have started">235.</part-num-ref>
+ Encounters that have not yet started 235b are stored in an undone encounter structure for later use <part-num-ref name="undone encounter structure for later use">236.</part-num-ref>
+ For encounters that have started 235a, the system then determines whether the encounter has ended <part-num-ref name="encounter has ended">237.</part-num-ref>
+ If so 237a, the system determines whether the real-time end time for the encounter is later than the maximum end time <part-num-ref name="maximum end time">239.</part-num-ref>
+ If not 239b, the system completes the loop for that encounter. If so 239a, the system updates the maximum end time to match the real-time end time for that encounter <part-num-ref name="real-time end time for that encounter">240,</part-num-ref>
+ and completes the loop for that encounter. If an encounter has started but not yet ended 237b, the system determines whether the current time is later than the real-time end time for the encounter <part-num-ref name="encounter">238.</part-num-ref>
+ If so 238a, the system updates the real-time end time for the encounter to match the current time <part-num-ref name="current time">241,</part-num-ref>
+ and then checks to see if the real-time end time is later than the maximum end time <part-num-ref name="maximum end time">239.</part-num-ref>
+ If the real-time end time is later than the maximum end time 239a, the system updates the maximum end time <part-num-ref name="maximum end time">240.</part-num-ref>
+ If the current time is not later than the real-time end time for the encounter 238b, the system determines whether the real-time end time is later than the maximum end time <part-num-ref name="maximum end time">239</part-num-ref>
+ and if so 239a, updates the maximum end time accordingly <part-num-ref name="maximum end time accordingly">240.</part-num-ref>
+ The system repeats the loop through the earlier encounters <part-num-ref name="earlier encounters">233</part-num-ref>
+ until all of the earlier encounters have been updated.    </p>
+    <p id="p-8" num="8">Please replace paragraph [0059] with the following, rewritten paragraph:</p>
+    <boundary-data type="header">-3-</boundary-data>
+    <boundary-data type="header">MADI<confidence value="5">_</confidence>
+1903657.2    </boundary-data>
+    <boundary-data type="header">Atty. Dkt. No. 045814-0104</boundary-data>
+    <p id="p-9" num="9">
+      <page-break num="3"/>
+[0059] Although example logic for updating the status of rooms and encounters is shown in FIGS. <confidence value="4486">l0a-</confidence>
+b and <part-num-ref name="status of rooms and encounters is shown in FIGS. l0a-b and">1<confidence value="5">1</confidence>
+      </part-num-ref>
+ a-c<confidence value="5">,</confidence>
+ the logic shown is not particular to the present invention.    </p>
+    <p id="p-10" num="10">Other logic could be used, steps could be added or deleted from the logic shown, or the system could use other variables to calculate the real-time status. For example, the real-time status system of the present invention could also calculate the real-time status of a specific room based not only on the status of encounters occurring in that specific room, but also based on the availability of resources or problems that occur in other rooms that may affect the real-time status of the specific room. Thus, if a doctor is scheduled to perform a procedure in Operating Room number <part-num-ref name="procedure in Operating Room number">1</part-num-ref>
+ at <part-num-ref name="at">4</part-num-ref>
+ pm, but that doctor is still performing a procedure in a different location that is scheduled to last past <part-num-ref name="different location that is scheduled to last past">4</part-num-ref>
+ pm, the real-time status system could update the real-time status of Operating Room number <part-num-ref name="real-time status of Operating Room number">1</part-num-ref>
+ accordingly. As another example, the system could also include automatic features, such as automatically entering a default actual end time for a previous encounter if the next encounter in that room has been started before an actual end time was entered for the previous encounter. Further, although FIGS. <confidence value="4486">l0a-</confidence>
+b and <part-num-ref name="previous encounter. Further, although FIGS. l0a-b and">
+        <confidence value="88">11</confidence>
+      </part-num-ref>
+ <confidence value="86">a-</confidence>
+c and the foregoing description refer to encounters tracked by rooms, analogous logic could apply to encounters that are tracked by physician or other tracking criteria. For example, analogous logic would be used to generate the real-time status for each physician in a clinical setting, such as the real-time status shown in FIGS. <confidence value="2">1</confidence>
+A, 2A, and 3A.    </p>
+    <boundary-data type="header">-4-</boundary-data>
+    <boundary-data type="header">MADI_1903657.2</boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11049861.xml

@@ -0,0 +1,258 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11049861</doc-number>
+        <date>2005-02-04</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">UNITED STATES PATENT APPLICATION</heading>
+    <heading id="h-2">
+      <confidence value="88">OF</confidence>
+    </heading>
+    <p id="p-1" num="1">William R. Sweeney Citizen of the United States <part-num-ref name="United States">8242</part-num-ref>
+ Marwood Drive Richmond, VA <part-num-ref name="Marwood Drive Richmond, VA">23235</part-num-ref>
+     </p>
+    <heading id="h-3">FOR</heading>
+    <heading id="h-4">CONTROLLABLE RFID CARD</heading>
+    <p id="p-2" num="2">Attorney Docket No. 021238-694 Philip Morris Ref. No. PM 2170 </p>
+    <heading id="h-5">BURNS, DOANE, SWECKER &amp; MATHIS, L.L.P.</heading>
+    <p id="p-3" num="3">P.O. Box 1404 Alexandria, Virginia 22313-1404 <boundary-data type="header">(703) 836-6620</boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    </p>
+    <heading id="h-6">CONTROLLABLE RFID CARD</heading>
+    <heading id="h-7">BACKGROUND</heading>
+    <p id="p-4" num="4">[0001] The present invention relates to a controllable R<confidence value="5">F</confidence>
+ID (radio frequency identification) card.    </p>
+    <heading id="h-8">SUMMARY</heading>
+    <p id="p-5" num="5">[0002] In accordance with exemplary embodiments, a system and method to present personalized information based on an identification of a customer is provided. Preferably, the system operates by acquiring identification information of a customer, using this acquired identification information to determine personalized information and providing the personalized information to a customer.</p>
+    <p id="p-6" num="6">[0003] Additionally, the system preferably provides an identification card that can be read wirelessly for the identification information of a customer, but can also be manually controlled by a customer.</p>
+    <p id="p-7" num="7">[0004] In another embodiment, a customer controllable identification card, comprises a card with first and second planar surfaces; at least one radio frequency identification tag within the card; and one or more controls located on the card, wherein the one or more controls extend beyond the first surface when positioned in an up direction and extend beyond the second surface in a down direction.</p>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <heading id="h-9">BRIEF DESCRIPTION OF THE DRAWING FIGURES</heading>
+    <p id="p-8" num="8">
+      <page-break num="3"/>
+[0005] Figure 1 illustrates a side perspective view portion of an exemplary system to present personalized information based on an identification of a customer.    </p>
+    <p id="p-9" num="9">[0006] Figure 2 illustrates a front view of an embodiment of a customer controlled card.</p>
+    <p id="p-10" num="10">[0007] Figure 3 illustrates a side view of an embodiment of a customer controlled card.</p>
+    <p id="p-11" num="11">[0008] Figures 4A-4E illustrate exemplary embodiments of a customer controlled card.</p>
+    <p id="p-12" num="12">[0009] Figure 5 illustrates an exemplary embodiment of multiple controls on a card.</p>
+    <p id="p-13" num="13">[0010] Figures 6A-6F illustrate exemplary control circuits and exemplary tactile/visual feedback domes.</p>
+    <heading id="h-10">DETAILED DESCRIPTION</heading>
+    <p id="p-14" num="14">[0011] A system and method to present personalized information based on an identification of a customer and/or a product is provided, wherein the system operates by: (A) acquiring identification information of a customer;</p>
+    <p id="p-15" num="15">(B) using this acquired identification information to determine personalized information; (C) providing the personalized information to a display screen;</p>
+    <p id="p-16" num="16">and (D) displaying the personalized information on the display screen of the system for viewing by the customer, wherein each of these operating steps is discussed below.</p>
+    <boundary-data type="header">-2-</boundary-data>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <p id="p-17" num="17">
+      <page-break num="4"/>
+[0012] Additionally, display screens and card controllers are provided herein, wherein the display screens can display personalized information wirelessly and the card controllers can be controlled by a customer.    </p>
+    <p id="p-18" num="18">
+      <confidence value="5">I</confidence>
+.   System Operation A.   Identification of a Customer and/or a Product [0013] Identification of a customer and/or product is preferably provided by capturing an individual identification without customer interaction.    </p>
+    <p id="p-19" num="19">Specifically, each customer can be provided with a card, wherein the card contains a mechanism which can be read wirelessly. The mechanism can be a radio frequency identification (RFID) tag.</p>
+    <p id="p-20" num="20">[0014] In a preferred embodiment, RFID technology uses radio waves to automatically identify people. The RFID system includes a RFID tag which can include a memory chip attached to an antenna, and a R<confidence value="5">F</confidence>
+ID reader separate from the RFID tag which is used to read information from the RFID tag.    </p>
+    <p id="p-21" num="21">[0015] In general, the memory chip in the RFID tag is used to store a serial number, such as an EPC (electronic product code) or other information. An EPC is a product identification similar to the UPC (Universal Product Code) or barcode. Like the bar code, the EPC can be divided into numbers that identify a customer using a specific number for different manufacturers, products, versions or serial numbers. This EPC is embedded in a memory chip (smart tag) on individual products or cards, wherein each smart tag can be scanned by a wireless "reader," which transmits the product's embedded <boundary-data type="header">-3-</boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+identity code to the Internet, <confidence value="7">i</confidence>
+ntranet or other connections to where the "real" information on the product is transmitted from one location to another. That information can then be communicated to provide whatever information is needed about that product.    </p>
+    <p id="p-22" num="22">[0016] In the preferred embodiment, the "readers" or EPC readers use radio waves to "communicate" with RFID tags and gather EP<confidence value="5">C</confidence>
+s. Through communication between the RFID tags and the EPC readers, a customer can be identified, wherein the EPC reader transmits one or more radio frequencies which can be modulated by the RFID tags, then the EPC reader receives the one or more modulated radio frequencies, wherein the received one or more modulated radio frequencies can be used to "read" an RFID tag and identify the customer.    </p>
+    <p id="p-23" num="23">[0017] RFID tags and EPC readers can be tuned to the same radio frequency in order to communicate with one another; however, multiple frequencies are available for RFID systems. Generally there are high frequencies ("HF," around 13.56 MHz), ultra-high frequencies ("UHF," around 850-950 MHz) and microwave frequencies (around 2.45 and 5.8 GHz) used with RFID systems. Additionally, there are near-field inductive communication frequencies (around <part-num-ref name="same radio frequency in order to communicate with one another; however, multiple frequencies are available for RFID systems. Generally there are high frequencies (&quot;HF,&quot; around 13.56 MHz), ultra-high frequencies (&quot;UHF,&quot; around 850-950 MHz) and microwave frequencies (around 2.45 and 5.8 GHz) used with RFID systems. Additionally, there are near-field inductive communication frequencies (around">125</part-num-ref>
+ KHz) for use with wireless credit cards and the like. Thus, there are many options (near-field inductive or E- field capacitive and EM far-field coupling at several frequencies) for providing wireless power other than the power used for a main communications channel to a tag.    </p>
+    <boundary-data type="header">-4-</boundary-data>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <p id="p-24" num="24">
+      <page-break num="6"/>
+[0018] HF tags, UHF tags, combinations of HF and UHF tags and transceivers are used in a preferred system, where multiple RF power sources can be used simultaneously as desired, as discussed below, and multiple transceivers can be used for different ranges as discussed in U.S.    </p>
+    <p id="p-25" num="25">Patent No. 6,726,099, which is herein incorporated by reference in its entirety.</p>
+    <p id="p-26" num="26">[0019] The wireless read fields, such as RF fields, can be either magnetic fields or electrical fields depending upon the type of RFID tags to be read.</p>
+    <p id="p-27" num="27">For inductively coupled RFID tags, the wireless read fields are magnetic fields, wherein the RFID tag receives the magnetic energy of the magnetic field and modulates the magnetic field. Next, the wireless information reader, such as an EPC reader, reads the modulated magnetic field to identify the RFID tag and the system correlates the identification of the RFID tag with a customer and/or product based upon previously stored information. Capacitively coupled RFID tags operate in a manner similar to the inductive coupled RFID tags except that the RFID tag modulates an electric field, and the modulated electric field is used to identify the RFID tag.</p>
+    <p id="p-28" num="28">
+      <confidence value="5">[</confidence>
+0020] With respect to a wireless read field, situations may occur where there are more than one RFID tag is present in this field.    </p>
+    <p id="p-29" num="29">However, it is desirable that the RFID and personalized information are based on at most one RFID tag corresponding to one customer, where each is most proximate to the system. To address these situations, exemplary embodiments employ logic which can detect the proximity of the read RFID tags. Specifically, based upon the strength of the signal <boundary-data type="header">-5-</boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+read from the RFID tags, the system can determine that the strongest signal corresponds to the RFID tag(s) most proximate to the system.    </p>
+    <p id="p-30" num="30">[0021] Additionally, the system can employ a signal strength threshold to control how close an RFID tag must be before it is read and personalized information is displayed. For example, based upon routine testing it can be determined that a predetermined signal strength corresponds to a predetermined distance from a wireless information reader and a display. This predetermined distance is selected to ensure that the personalized information displayed is provided only to the intended recipient of the information.</p>
+    <p id="p-31" num="31">B.   Using Acquired Identification Information to Determine Personalized Information [0022] Using the acquired identification information, or EPC, from the EPC reader and RFID tag, allows for other information to be gathered in reference to the EP<confidence value="5">C</confidence>
+. Preferably, the EPC works together with a Physical Markup Language (PML) and an Object Naming Service (ONS). PML is a new standard "language" for describing physical objects to the Internet in the same way that HyperText Markup Language (HTML) is the common language on which most Internet web sites are based. The ONS tells computer systems where to find information about any object that carries an EPC code, or smart tag. ONS is based in part on the Internet's existing Domain Name System (DNS), which routes information to appropriate web sites. The ONS will likely be many times larger than the DNS, serving as a <boundary-data type="header">-6-</boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+lightening fast "post office" that locates data for every single one of trillions of objects carrying an EPC code.    </p>
+    <p id="p-32" num="32">[0023] The Physical Markup Language enables linking physical objects to each other, people and information through the Internet using Electronic tags, EPC, PML and ONS. Electronic tags refer to a family of technologies that transfer data wirelessly between tagged objects and electronic readers.</p>
+    <p id="p-33" num="33">Radio Frequency Identification (RFID) tags often have small radio antennas, which transmit data over a short distance.</p>
+    <p id="p-34" num="34">[0024] The EPC was conceived as a means to identify physical objects.</p>
+    <p id="p-35" num="35">The EPC code was created to enumerate all objects and to accommodate current and future naming methods. The EP<confidence value="5">C</confidence>
+ code was intended to be universally and globally accepted as a means to link physical objects to the computer network, and to serve as an efficient information reference. The Object Naming Service (ONS) links the Electronic Product Code (EPC) with its associated data file. More specifically, the ONS is an automated networking service, which, when given an EP<confidence value="5">C</confidence>
+ number, returns a host address on which the corresponding data file is located. The ONS is based on the standard Domain Naming Service (DNS).    </p>
+    <p id="p-36" num="36">[0025] Finally, the Physical Markup Language (PML) can be used for describing and classifying objects in a PML file, where the information is thus kept away from the object label.</p>
+    <p id="p-37" num="37">[0026] Therefore, a processor can connect to the <confidence value="5">I</confidence>
+nternet to communicate with the ONS, wherein the ONS can find a link corresponding to the EPC and transmit this link back to the processor, wherein the processor can <boundary-data type="header">-7-</boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+follow the link and gather information in PML, which in turn can be sent back to the EPC reader.    </p>
+    <p id="p-38" num="38">[0027] Also, in accordance with exemplary embodiments, a web service can also be associated with the system, where a Bamboo/SQL (Structured Query Language) service (such as produced by ThingMagic), an Apache web server or other lightweight web service engine can be used to provide data to the system. Access to information from the Internet can be provided by a TCP/IP (Transmission Control Protocol/Internet Protocol) protocol stack with an authentication cryptographic component in a conventional manner.</p>
+    <p id="p-39" num="39">C.   Providing the Personalized Information to a Display Screen of the System for Viewing by the Customer [0028] The EPC reader can provide personalized information to a display screen through transmitting data of the personalized information through the electromagnetic radiation field, as mentioned above. The data for display can be transmitted using various formats, such as ASC<confidence value="66">II</confidence>
+ text, HTML, XML, mobile code, such as Java, bitmaps or compressed bitmap structures such as simple run length encoding or JPEG encoding. Data for the system can be transferred using conventional XML constructs such as those in the EPC PML standard, as mentioned above, and others. The data can also be encrypted and the components can be verified for communication via passwords or other authentication methods.    </p>
+    <boundary-data type="header">-8-</boundary-data>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <p id="p-40" num="40">
+      <page-break num="10"/>
+II.  Card controller [0029] Also, as mentioned above, the system preferably provides a card that can be read wirelessly for identification or other information, but can also be controlled by a customer. Thus, a customer can customize a card to provide information and personal preferences to a card reader system.    </p>
+    <p id="p-41" num="41">[0030] A preferred embodiment of a card that can be read contains a R<confidence value="588">FID</confidence>
+ tag, as well as controls on the card for a customer to modify. As illustrated in Figure 1, a system <part-num-ref name="system">100</part-num-ref>
+ is provided for acquiring identification information of a customer, and then personalizing information based on the identification information for display on a display screen <part-num-ref name="display screen">110.</part-num-ref>
+ This is accomplished by providing a system <part-num-ref name="system">100</part-num-ref>
+ in communication with a wireless information reader, such as an EPC (electronic product code) reader <part-num-ref name="EPC (electronic product code) reader">130,</part-num-ref>
+ and a display screen <part-num-ref name="display screen">110,</part-num-ref>
+ wherein if a card is brought within the RF (radio frequency) field <part-num-ref name="RF (radio frequency) field">150,</part-num-ref>
+ information from the card can be read. A wireless information reader, such as the EP<confidence value="5">C</confidence>
+ reader <part-num-ref name="EPC reader">130,</part-num-ref>
+ can be provided, wherein radio waves can be transmitted by an antenna, such as an EPC antenna <part-num-ref name="EPC antenna">140</part-num-ref>
+ as illustrated in Figure 1. The radio waves can be in the form of an electromagnetic field, such as a R<confidence value="5">F</confidence>
+ field <part-num-ref name="RF field">150,</part-num-ref>
+ which as illustrated in Figure 1, can be provided in front of a display screen <part-num-ref name="display screen">110,</part-num-ref>
+ to communicate with RFID tags to acquire EPCs.    </p>
+    <p id="p-42" num="42">[0031] In one embodiment, as illustrated in Figures 2 and <part-num-ref name="and">3,</part-num-ref>
+ one or more controls <part-num-ref name="and 3, one or more controls">310</part-num-ref>
+ can be provided along an exterior surface of an RFID containing card <part-num-ref name="RFID containing card">300.</part-num-ref>
+ By providing controls on a card, a customer can use the card itself to provide preferences to the card reader. Therefore, the <boundary-data type="header">-9-</boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+cards can be customized at the point of use and, if desired, functions of the card can be enabled or disabled depending on the customer at the point of use.    </p>
+    <p id="p-43" num="43">[0032] Preferably, the cards can be customized through the use of controls <part-num-ref name="use of controls">310.</part-num-ref>
+ Preferably, the controls <part-num-ref name="controls">310</part-num-ref>
+ are provided in the form of switches, slides, buttons and/or domes. Controls <part-num-ref name="form of switches, slides, buttons and/or domes. Controls">310</part-num-ref>
+ are preferably provided in these forms to provide tactile and visual feedback and confirmation of customer's selections. For example, as illustrated in Figures <part-num-ref name="are preferably provided in these forms to provide tactile and visual feedback and confirmation of customer's selections. For example, as illustrated in Figures">2</part-num-ref>
+ and <part-num-ref name="and">3,</part-num-ref>
+ exemplary controls <part-num-ref name="and 3, exemplary controls">310</part-num-ref>
+ can be provided in the form of bistable inverting dome switches (hereinafter "bistable domes"), which are illustrated in a front perspective view in Figure 2 and a side perspective view in Figure 3.    </p>
+    <p id="p-44" num="44">[0033] It is noted that switches, slides and/or buttons may also be preferable as they can be used to provide similar advantages to the bistable domes with different tactile and/or visual feedback and different physical mechanisms that may be more preferable depending upon the application.</p>
+    <p id="p-45" num="45">Additionally, it is noted that while the controls <part-num-ref name="controls">310</part-num-ref>
+ can be stable, binary controls or switches, such as the exemplary bistable domes illustrated, the controls <part-num-ref name="controls">310</part-num-ref>
+ can also be momentary contact switches, wherein the state of the control can be stored electronically with or without visual or tactile feedback.    </p>
+    <p id="p-46" num="46">[0034] As illustrated in Figure 2, bistable dome controls 310 can be used to provide tactile and/or visual feedback to a user and can be up or down, wherein for example, up can enable a feature of the card, while down can disable a feature of the card.</p>
+    <boundary-data type="header">-10-</boundary-data>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <p id="p-47" num="47">
+      <page-break num="12"/>
+[0035] The exemplary bistable domes, as well as other switches, slides and/or buttons, can be used as bimodal switches to activate or deactivate a circuit. As illustrated in Figures 4A-4B, examples of these types of switches are provided, wherein a switch can be opened, or deactivated, in an <confidence value="5885">"up"</confidence>
+ position so that the conductive dome <part-num-ref name="conductive dome">430</part-num-ref>
+ is away from a conductor <part-num-ref name="conductor">420.</part-num-ref>
+    </p>
+    <p id="p-48" num="48">Alternatively, the switch can be closed in a "down" position, where a conductive dome <part-num-ref name="conductive dome">430</part-num-ref>
+ can be placed in contact with a conductor <part-num-ref name="conductor">420</part-num-ref>
+ thus activating the circuit.    </p>
+    <p id="p-49" num="49">[0036] In order to provide tactile and/or visual feedback to a user, a card <part-num-ref name="card">440</part-num-ref>
+ with an open area <part-num-ref name="open area">450</part-num-ref>
+ can be provided, as illustrated in Figure 4C, wherein the open area <part-num-ref name="open area">450</part-num-ref>
+ can allow a user to touch or feel the bistable dome control whether it is concave or convex therein.    </p>
+    <p id="p-50" num="50">[0037] In an embodiment, as illustrated in Figure 4D, a RFID tag <part-num-ref name="RFID tag">460</part-num-ref>
+ can be placed within a switch circuit <part-num-ref name="switch circuit">470,</part-num-ref>
+ wherein the RFID tag <part-num-ref name="RFID tag">460</part-num-ref>
+ can be activated or deactivated by a switch, as illustrated in Figures 4A and 4B, such as by an inverting dome shunt <part-num-ref name="inverting dome shunt">480.</part-num-ref>
+ Thus, a RFID tag <part-num-ref name="RFID tag">460</part-num-ref>
+ can be made available or unavailable simply by opening or closing a switch by pushing on one side or the other side of the opening area <part-num-ref name="opening area">450</part-num-ref>
+ in which the inverting dome shunt <part-num-ref name="inverting dome shunt">480</part-num-ref>
+ is located.    </p>
+    <p id="p-51" num="51">[0038] The controls <part-num-ref name="controls">310</part-num-ref>
+ can provide independent operations of different aspects of the card as desired. For example, as illustrated in Figure 2, a first control <part-num-ref name="first control">310</part-num-ref>
+ can be to enable/disable the card, while a second control <part-num-ref name="second control">320</part-num-ref>
+ can be to selectively determine the perimeter range for the card, e.g., long range or short range. Alternatively, as illustrated in Figure 5, for example, <boundary-data type="header">-11-</boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+multiple controls can be used to set promotion preferences for reading in a grocery store, or to play a game of chance, similar to bingo, wherein a user can push down several bistable dome controls, while pushing up other bistable dome controls to create a pattern. It is noted that while bistable dome controls are illustrated in Figure 5, other switches, slides and/or buttons may also be used to create a pattern on the card. Thus, by providing controls to a customer, attributes of the card can be modified, wherein the provision of the controls along an external surface makes such modifications easily accessible to the customer.    </p>
+    <p id="p-52" num="52">[0039] The controls <part-num-ref name="controls">310</part-num-ref>
+ can operate as mentioned above by activating or deactivating a switch, which can encompass several alternative means for operating the controls <part-num-ref name="controls">310.</part-num-ref>
+ For example, as illustrated in Figure 6A, the circuit can be provided with a simple shorting mechanism, where the circuit is controlled through contact or lack of contact between the contact bridge <part-num-ref name="contact bridge">610</part-num-ref>
+ and the circuit <part-num-ref name="circuit">620.</part-num-ref>
+ Alternatively, a switched resistor can be used, for example as illustrated in Figure 6B, in a range adjustment circuit, wherein the contact bridge <part-num-ref name="contact bridge">610</part-num-ref>
+ is either in contact or not in contact with a resistor containing circuit <part-num-ref name="resistor containing circuit">630.</part-num-ref>
+ As another alternative, a resistive dome <part-num-ref name="resistive dome">640,</part-num-ref>
+ as illustrated in Figure 6<confidence value="5">C</confidence>
+, can be used in addition to the contact bridge <part-num-ref name="contact bridge">610</part-num-ref>
+ and the circuit <part-num-ref name="circuit">620</part-num-ref>
+ of Figure 6A, wherein the resistive dome <part-num-ref name="resistive dome">640</part-num-ref>
+ can provide a range adjustment circuit similar to Figure 6B.    </p>
+    <p id="p-53" num="53">[0040] The controls <part-num-ref name="controls">310</part-num-ref>
+ can also include a visual display indicator <part-num-ref name="visual display indicator">640,</part-num-ref>
+ as illustrated in Figures 6D and 6E, on one or both sides of the controls <part-num-ref name="controls">310.</part-num-ref>
+    </p>
+    <p id="p-54" num="54">By providing a visual display indicator <part-num-ref name="visual display indicator">640,</part-num-ref>
+ a customer could be able to <boundary-data type="header">-12-</boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+visually affirm the status of the controls <part-num-ref name="controls">310.</part-num-ref>
+ Preferably, the visual display indicator <part-num-ref name="visual display indicator">640</part-num-ref>
+ is a translucent indicating membrane <part-num-ref name="translucent indicating membrane">640</part-num-ref>
+ capable of altering appearance when in contact with a portion of the control <part-num-ref name="control">310.</part-num-ref>
+ For example, as illustrated in Figures 6D and 6E, a translucent indicating membrane <part-num-ref name="translucent indicating membrane">640</part-num-ref>
+ in contact with a top portion of a contact bridge <part-num-ref name="contact bridge">610</part-num-ref>
+ would appear in top view <part-num-ref name="would appear in top view">650</part-num-ref>
+ as a lighter colored membrane, while a top view <part-num-ref name="top view">660</part-num-ref>
+ of the contact bridge <part-num-ref name="contact bridge">610</part-num-ref>
+ while not in contact with the translucent indicating membrane <part-num-ref name="translucent indicating membrane">640</part-num-ref>
+ would appear in top view <part-num-ref name="would appear in top view">660</part-num-ref>
+ as a darker colored membrane.    </p>
+    <p id="p-55" num="55">[0041] The controls <part-num-ref name="controls">310</part-num-ref>
+ can also be provided with tactile feedback in addition to visual feedback. The tactic feedback can be provided in numerous shapes, for example, as illustrated in Figure 6F, wherein the surface of the controls <part-num-ref name="controls">310</part-num-ref>
+ can have a solid surface <part-num-ref name="solid surface">671,</part-num-ref>
+ a dome with different shaped recess, therein <part-num-ref name="dome with different shaped recess, therein">672,</part-num-ref>
+ <part-num-ref name="dome with different shaped recess, therein 672,">673,</part-num-ref>
+ different shaped cones <part-num-ref name="dome with different shaped recess, therein 672, 673, different shaped cones">674,</part-num-ref>
+ <part-num-ref name="dome with different shaped recess, therein 672, 673, different shaped cones 674,">675,</part-num-ref>
+ <part-num-ref name="dome with different shaped recess, therein 672, 673, different shaped cones 674, 675,">676</part-num-ref>
+ or other tactile feedback providing shapes.    </p>
+    <p id="p-56" num="56">[0042] Controls for devices have also been discussed in U.S. Patent No.</p>
+    <p id="p-57" num="57">5,982,304 and U.S. Patent Application Nos. 2002/0140546 A<confidence value="68">1,</confidence>
+ 2003/0132301 A<confidence value="5">l</confidence>
+ and 2001/0043141 A<confidence value="5">1</confidence>
+, which are herein incorporated by reference in their entireties.    </p>
+    <p id="p-58" num="58">
+      <confidence value="866">Ill</confidence>
+.  Examples [0043] In an exemplary embodiment, a cigarette kiosk can be supplied with an exemplary display system, wherein a display screen can be added to a kiosk and can be used to display personalized information to a customer. For example, a customer can customize a card containing a <boundary-data type="header">-13-</boundary-data>
+      <page-break num="15"/>
+      <boundary-data type="header">Patent</boundary-data>
+      <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+      <confidence value="86">RF</confidence>
+ID tag by selectively changing controls on the card to represent the customer's desires for information. The card can then be read by an EPC reader of the system when the card enters a RF field produced by the EPC reader. Next, the EPC reader can gather personalized information based on an EPC read from the RFID tag by the EPC reader.    </p>
+    <p id="p-59" num="59">[0044] After the personalized information is gathered by the EP<confidence value="5">C</confidence>
+ reader, the EPC reader can then transmit data through the RF field to the display screen. Thus, with the display screen located in the RF field, the display screen can display the personalized information data using the data and power from the EPC reader. Therefore, by using the customer controlled <confidence value="86">RF</confidence>
+ID tag containing card in conjunction with the wireless display system,' personalized information along with power can be transmitted through a RF field to the wireless display, wherein the wireless display screen can wirelessly display the personalized information.    </p>
+    <p id="p-60" num="60">[0045] In another exemplary embodiment, a wireless display system and a customer controlled RFID tag card can be provided for use in pattern recognition applications, wherein a customer can control the individual's card to create a pattern that the system can recognize and answer. For example, the card can be provided with multiple bistable dome controls, as mentioned above, wherein a user can depress some of the bistable dome controls while leaving other bistable dome controls not depressed to create an individual pattern. Then, the individual pattern in conjunction with the <confidence value="86">RF</confidence>
+ID tag in the card can be brought within a R<confidence value="5">F</confidence>
+ field of an EPC reader, wherein the pattern of the bistable domes and the R<confidence value="5">F</confidence>
+ID tag can be read.    </p>
+    <boundary-data type="header">-14-</boundary-data>
+    <boundary-data type="header">Patent</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 021238-694</boundary-data>
+    <p id="p-61" num="61">
+      <page-break num="16"/>
+Next, the pattern of the bistable domes and the RFID tag can be compared to predetermined information, and an answer can be given. For example, the system can be used as a game of chance, wherein if matches between the pattern and the predetermined information are found, then notification of winning can be given to the customer.    </p>
+    <p id="p-62" num="62">[0046] The preferred embodiments are merely illustrative and should not be considered restrictive in any way. The scope of the invention is given by the appended claims, rather than the preceding description, and all variations and equivalents which fall within the range of the claims are intended to be embraced therein.</p>
+    <boundary-data type="header">-15-</boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11093480.xml

@@ -0,0 +1,29 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11093480</doc-number>
+        <date>2011-09-09</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Ser. No. 11/093,480 Response to OA Dated March 9, 2011 </p>
+    <heading id="h-1">II. SPECIFICATION AMENDMENTS</heading>
+    <p id="p-2" num="2">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">12,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 12, line">24</part-num-ref>
+ through page <part-num-ref name="through page">13,</part-num-ref>
+ line <part-num-ref name="through page 13, line">5</part-num-ref>
+ as follows:    </p>
+    <p id="p-3" num="3">The workstation systems may be simple assemblies of process chambers, load lock and fr<confidence value="8">o</confidence>
+nt end loader wherein the front end loader  is a passive device which     relies on   the  transport mechanism of the load lock or other element of the assembly. In an  alternate  embodiment,  it   is  possible  to  construct  an appropriate robot mechanism within the bridging chamber to enter the front end loader or other access port constructed in a workstation system and extract a substrate into the bridging chamber for transport into the adjacent workstation system.   As may be realized, in this embodiment the robot of the bridging chamber may be used whe<confidence value="568286">re-by_</confidence>
+a controller of the bridging chamber <confidence value="22222222">regietcr</confidence>
+ on information that no other transport mechanism is available  or  where   available  transport  mechanisms  of  the workstation systems need not be utilized.    </p>
+    <p id="p-4" num="4">
+      <confidence value="8">2</confidence>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11096851.xml

@@ -0,0 +1,458 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11096851</doc-number>
+        <date>2005-03-31</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">PATENT</heading>
+    <p id="p-1" num="1">ATTORNEY DOCKET: P-20639.00 </p>
+    <heading id="h-2">APPLICATION FOR UNITED STATES LETTERS PATENT</heading>
+    <p id="p-2" num="2">for </p>
+    <heading id="h-3">IMPLANTABLE MEDICAL DEVICE WITH REAL TIME T-WAVE</heading>
+    <heading id="h-4">OVERSENSING DETECTION</heading>
+    <p id="p-3" num="3">
+      <confidence value="88">by</confidence>
+ Bruce D. Gunderson Amisha S. Patel Chad A. Bounds     </p>
+    <heading id="h-5">ATTORNEY/AGENT OF RECORD:</heading>
+    <p id="p-4" num="4">Michael C. <confidence value="2222222">Soldner</confidence>
+, Reg. No. 41,455 Telephone: (763) 514-4842 Customer No. <part-num-ref name="514-4842 Customer No.">27581</part-num-ref>
+     </p>
+    <heading id="h-6">CERTIFICATE OF "EXPRESS MAIL"</heading>
+    <p id="p-5" num="5">Mailing Label No. EV 611 <part-num-ref name="">
+        <confidence value="8">0</confidence>
+74      </part-num-ref>
+ 297 US Date of Deposit:<confidence value="2222222222222222">________________</confidence>
+ I hereby certify that this paper or fee is being deposited with the United States Postal Service as "EXPRESS MAIL" POST OFFICE TO ADDRESSEE" service under <part-num-ref name="United States Postal Service as &quot;EXPRESS MAIL&quot; POST OFFICE TO ADDRESSEE&quot; service under">37</part-num-ref>
+ CFR 1.10 on the date indicated above and is addressed to Commissioner for Patents, P.O. Box <part-num-ref name="date indicated above and is addressed to Commissioner for Patents, P.O. Box">1450,</part-num-ref>
+ Alexandria, VA, 22313-1450.    </p>
+    <p id="p-6" num="6">Sue McCoy Printed N<confidence value="5">a</confidence>
+ <confidence value="8">e</confidence>
+ Signatur <page-break num="2"/>
+      <boundary-data type="header">Atty Docket: P20639.00                               PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">1</confidence>
+      </boundary-data>
+    </p>
+    <heading id="h-7">IMPLANTABLE MEDICAL DEVICE WITH REAL</heading>
+    <heading id="h-8">TIME T-WAVE OVERSENSING DETECTION</heading>
+    <heading id="h-9">FIELD OF THE INVENTION</heading>
+    <p id="p-7" num="7">[0001]         The present invention relates to an implantable medical device (IMD), and more particularly, to an implantable medical device that automatically identifies T- wave oversensing on a real-time basis.</p>
+    <heading id="h-10">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-8" num="8">[0002]         An implantable cardioverter defibrillator (<confidence value="5">I</confidence>
+CD) is an IMD that is capable of detecting a tachyarrhythmia (i.e. a fibrillation or abnormal high rate tachycardia) in a heart chamber and providing a high energy electrical shock into or across cardiac tissue to terminate the detected tachyarrhythmia. The <confidence value="5">I</confidence>
+CD typically uses leads inserted into or positioned adjacent the heart chamber to sense electrical activity in the chamber. Cardiac depolarizations are sensed by sense amplifiers having inputs coupled to electrodes carried by the leads. The intervals between sensed depolarizations are measured and compared to threshold intervals to determine whether the chamber is in normal sinus rhythm, tachycardia, or fibrillation.    </p>
+    <p id="p-9" num="9">[0003]         When detection criteria are met indicating tachycardia, the <confidence value="4">I</confidence>
+CD may first attempt to terminate the tachycardia through anti-tachycardia pacing (ATP), which uses low energy pacing pulses. If ATP therapy is unsuccessful, then a high energy cardioversion shock, synchronized to sensed depolarization, is attempted. If fibrillation is detected, a high energy shock may be delivered without synchronization, and is referred to as a defibrillation shock.    </p>
+    <p id="p-10" num="10">[0004]         To monitor ventricular tachyarrhythmia, the <confidence value="5">I</confidence>
+CD senses ventricular depolarizations or -R-waves-. For accurate tachyarrhythmia detection, only one event (the R-wave) should be sensed during each normal sinus cardiac cycle.    </p>
+    <p id="p-11" num="11">Oversensing of events other than the R-wave can result from sensing cardiac events such as ventricular repolarizations (T-waves) and far field R-waves, from double counting R-waves, and from sensing non-cardiac signals such as myopotentials from surrounding muscle tissue, noise from electromagnetic <page-break num="3"/>
+      <boundary-data type="header">Atty Docket: P20639.00                               PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+interference (EMI) external to the patient, or noise produced by a lead failure due to failed insulation, broken conductors or a poor connection to the <confidence value="5">I</confidence>
+CD.    </p>
+    <p id="p-12" num="12">[0005]         T-wave oversensing results when two ventricular sensed events occur during a cardiac cycle, one coinciding with the R-wave (depolarization) and the other coinciding with the T-wave (repolarization). T-wave oversensing can occur when there is a reduction in the R-wave amplitude (for example, due to a microdislodgement of the lead) or as a result of an increased T-wave amplitude (for example, due to a chemical/drug imbalance).</p>
+    <p id="p-13" num="13">[0006]         Oversensing <confidence value="6">.</confidence>
+ T-waves by the <confidence value="5">I</confidence>
+CD sense amplifiers can result in inappropriate shock therapies, which are painful to the patient and which waste energy and shorten the operating life of the <confidence value="5">I</confidence>
+CD. In addition, timing either ATP or cardioversion to a T-wave that is incorrectly identified as an R-wave may induce an arrhythmia when one did not in fact exist.    </p>
+    <heading id="h-11">BRIEF SUMMARY OF THE INVENTION</heading>
+    <p id="p-14" num="14">[0007]         The present invention addresses the problem of T-wave oversensing in an <confidence value="5">I</confidence>
+CD by incorporating into the determination of tachyarrhythmia an evaluation of characteristics that indicate T-wave oversensing. The evaluation of the T-wave oversensing characteristics is done on a event-by-event basis, so that corrections for T-wave oversensing are made on a<confidence value="1">'</confidence>
+real-time continuous basis.    </p>
+    <heading id="h-12">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-15" num="15">[0008]         These and other advantages and features of the present invention will be appreciated as the same becomes better understood by reference to the following detailed description of the preferred embodiment of the invention when considered in connection with the accompanying drawings, in which like numbered reference numbers designate like parts throughout the figures thereof, and wherein:</p>
+    <p id="p-16" num="16">[0009]         FIG. 1 is a block diagram of an implantable cardioverter defibrillator configured to employ the real-time T-wave oversensing feature of the present invention.</p>
+    <p id="p-17" num="17">[0010]         FIG. 2 is a diagram illustrating EGM waveforms representing normal sinus rhythm, ventricular tachycardia (VT) and ventricular fibrillation (VF).</p>
+    <boundary-data type="header">Atty Docket: P20639.00                                PATENT</boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <p id="p-18" num="18">
+      <page-break num="4"/>
+[0011]          FIG. 3 is a graph showing an example of an EGM waveform in normal sinus rhythm, with sensed events including T-wave oversensing, together with RR interval values, calculations, and running counts used in the real-time T-wave oversensing of the present invention.    </p>
+    <p id="p-19" num="19">[0012]          FIG. 4 is a flow diagram showing the use of RR interval patterns and wavelength morphology match scores to detect T-wave oversensing.</p>
+    <heading id="h-13">DETAILED DESCRIPTION OF THE INVENTION</heading>
+    <p id="p-20" num="20">[0013]          FIG. 1 is a block diagram of implantable cardioverter defibrillator (<confidence value="4">I</confidence>
+CD) <part-num-ref name="block diagram of implantable cardioverter defibrillator (ICD)">10</part-num-ref>
+ that is configured to provide pacing and cardioversion/defibrillation therapy to the atria and ventricles of a patient's heart. <confidence value="5">I</confidence>
+CD <part-num-ref name="patient's heart. ICD">10</part-num-ref>
+ senses electrical activity of the heart, and determines whether the atria and the ventricles are in normal sinus rhythm, or whether tachycardia or fibrillation of either the atria or the ventricles is occurring. Based upon the sensed electrical activity and stored programmed instructions, <confidence value="5">I</confidence>
+CD <part-num-ref name="sensed electrical activity and stored programmed instructions, ICD">10</part-num-ref>
+ may provide anti-tachycardia pacing (ATP) therapy, cardioversion shocks, or defibrillation shocks.    </p>
+    <p id="p-21" num="21">[0014]          <confidence value="5">I</confidence>
+CD 10 includes microprocessor <part-num-ref name="includes microprocessor">12,</part-num-ref>
+ read only memory (ROM) <part-num-ref name="includes microprocessor 12, read only memory (ROM)">14,</part-num-ref>
+ random access memory (RAM) <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM)">16,</part-num-ref>
+ data/address bus <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus">18,</part-num-ref>
+ timing/control circuitry <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry">20,</part-num-ref>
+ atrial pacing output circuit <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit">22,</part-num-ref>
+ ventricular pacing output circuit <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit 22, ventricular pacing output circuit">24,</part-num-ref>
+ atrial sense amplifier <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit 22, ventricular pacing output circuit 24, atrial sense amplifier">26,</part-num-ref>
+ ventricular sense amplifier <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit 22, ventricular pacing output circuit 24, atrial sense amplifier 26, ventricular sense amplifier">28,</part-num-ref>
+ switch matrix <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit 22, ventricular pacing output circuit 24, atrial sense amplifier 26, ventricular sense amplifier 28, switch matrix">30,</part-num-ref>
+ atrial pace/sense electrodes <part-num-ref name="includes microprocessor 12, read only memory (ROM) 14, random access memory (RAM) 16, data/address bus 18, timing/control circuitry 20, atrial pacing output circuit 22, ventricular pacing output circuit 24, atrial sense amplifier 26, ventricular sense amplifier 28, switch matrix 30, atrial pace/sense electrodes">32</part-num-ref>
+ and <part-num-ref name="and">34,</part-num-ref>
+ ventricular pace/sense electrodes <part-num-ref name="and 34, ventricular pace/sense electrodes">36</part-num-ref>
+ and <part-num-ref name="and">38,</part-num-ref>
+ defibrillation circuit <part-num-ref name="and 38, defibrillation circuit">40,</part-num-ref>
+ atrial defibrillation electrode <part-num-ref name="and 38, defibrillation circuit 40, atrial defibrillation electrode">42,</part-num-ref>
+ ventricular defibrillation electrode <part-num-ref name="and 38, defibrillation circuit 40, atrial defibrillation electrode 42, ventricular defibrillation electrode">44,</part-num-ref>
+ telemetry circuit <part-num-ref name="and 38, defibrillation circuit 40, atrial defibrillation electrode 42, ventricular defibrillation electrode 44, telemetry circuit">46,</part-num-ref>
+ and antenna <part-num-ref name="and 38, defibrillation circuit 40, atrial defibrillation electrode 42, ventricular defibrillation electrode 44, telemetry circuit 46, and antenna">48.</part-num-ref>
+    </p>
+    <p id="p-22" num="22">[0015]          Microprocessor 12 controls <confidence value="5">I</confidence>
+CD <part-num-ref name="controls ICD">10</part-num-ref>
+ based upon programmed instructions read from ROM <part-num-ref name="based upon programmed instructions read from ROM">14</part-num-ref>
+ or RAM <part-num-ref name="or RAM">16.</part-num-ref>
+ Programmed instructions include parameters for various modes of therapy that can be provided, algorithms for analyzing sensed cardiac events and electrogram (EGM) waveforms in order to detect whether the heart is in a normal sinus rhythm or is in an episode of tachycardia or fibrillation, and algorithms for selecting the appropriate therapy. With the present invention, microprocessor <part-num-ref name="present invention, microprocessor">12,</part-num-ref>
+ based on instructions stored in ROM <part-num-ref name="present invention, microprocessor 12, based on instructions stored in ROM">14,</part-num-ref>
+ performs a real-time monitoring of three characteristics indicative of T-wave oversensing, and <page-break num="5"/>
+      <boundary-data type="header">Atty Docket: P20639.00                                PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+withholds a detection of ventricular tachycardia (<confidence value="588">VT)</confidence>
+ <confidence value="88">or</confidence>
+ ventricularfibrillation (VF) when those characteristics indicate T-wave oversensing has occurred.    </p>
+    <p id="p-23" num="23">[0016]         RAM 16 is used to store physiological signal data including, for example, EGM waveform data. The data stored in RAM <part-num-ref name="data stored in RAM">16</part-num-ref>
+ <confidence value="5">'</confidence>
+may be used by microprocessor <part-num-ref name="'may be used by microprocessor">12</part-num-ref>
+ for therapy delivery and diagnostic purposes, and may also be transferred to an external device using telemetry circuit <part-num-ref name="external device using telemetry circuit">46</part-num-ref>
+ and antenna <part-num-ref name="and antenna">48.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">[0017]         Microprocessor 12 is coupled to timing/control circuitry <part-num-ref name="is coupled to timing/control circuitry">20</part-num-ref>
+ through bus <part-num-ref name="through bus">18.</part-num-ref>
+    </p>
+    <p id="p-25" num="25">Microprocessor 12 controls timing/control circuitry <part-num-ref name="controls timing/control circuitry">20</part-num-ref>
+ to deliver pacing pulses at appropriate times, according to a particular mode or therapy selected by microprocessor <part-num-ref name="particular mode or therapy selected by microprocessor">12.</part-num-ref>
+ Based upon control signals from microprocessor <part-num-ref name="particular mode or therapy selected by microprocessor 12. Based upon control signals from microprocessor">12,</part-num-ref>
+ timing/control circuitry <part-num-ref name="particular mode or therapy selected by microprocessor 12. Based upon control signals from microprocessor 12, timing/control circuitry">20</part-num-ref>
+ provides output pulses to output circuits <part-num-ref name="provides output pulses to output circuits">22</part-num-ref>
+ and <part-num-ref name="and">24</part-num-ref>
+ to provide pacing pulses, and to defibrillation circuit <part-num-ref name="to provide pacing pulses, and to defibrillation circuit">40</part-num-ref>
+ to provide cardioversion or defibrillation shocks. Timing/control circuitry <part-num-ref name="to provide cardioversion or defibrillation shocks. Timing/control circuitry">20</part-num-ref>
+ receives inputs from sense amplifiers <part-num-ref name="receives inputs from sense amplifiers">26</part-num-ref>
+ and <part-num-ref name="and">28.</part-num-ref>
+    </p>
+    <p id="p-26" num="26">[0018]         Atrial sense amplifier 26 receives an atrial EGM signal sensed by atrial pace/sense electrodes <part-num-ref name="atrial EGM signal sensed by atrial pace/sense electrodes">32</part-num-ref>
+ and <part-num-ref name="and">34.</part-num-ref>
+ It provides an atrial sense signal to timing/control circuitry <part-num-ref name="atrial sense signal to timing/control circuitry">20</part-num-ref>
+ each time a P-wave, representing an atrial depolarization, is sensed. Sense amplifier circuit <part-num-ref name="atrial depolarization, is sensed. Sense amplifier circuit">26</part-num-ref>
+ can also provide an atrial EGM signal to timing/control circuitry <part-num-ref name="atrial EGM signal to timing/control circuitry">20</part-num-ref>
+ for digitizing and storage in RAM <part-num-ref name="for digitizing and storage in RAM">16.</part-num-ref>
+    </p>
+    <p id="p-27" num="27">[0019]         Ventricular sense amplifier 28 receives a ventricular EGM signal from ventricular pace/sense electrodes <part-num-ref name="ventricular EGM signal from ventricular pace/sense electrodes">36</part-num-ref>
+ and <part-num-ref name="and">38.</part-num-ref>
+ The output of ventricular sense amplifier <part-num-ref name="output of ventricular sense amplifier">28</part-num-ref>
+ is a ventricular sense signal indicating detection of an R-wave representing a ventricular depolarization. Ventricular sense amplifier <part-num-ref name="ventricular depolarization. Ventricular sense amplifier">28</part-num-ref>
+ can also provide a ventricular EGM signal to timing/control circuitry <part-num-ref name="ventricular EGM signal to timing/control circuitry">20</part-num-ref>
+ for digitizing and storage in RAM <part-num-ref name="for digitizing and storage in RAM">16.</part-num-ref>
+    </p>
+    <p id="p-28" num="28">[0020]         Switch matrix 30 selectively connects atrial pacing output circuit <part-num-ref name="selectively connects atrial pacing output circuit">22</part-num-ref>
+ and atrial sense amplifier <part-num-ref name="and atrial sense amplifier">26</part-num-ref>
+ to atrial pace/sense electrodes <part-num-ref name="to atrial pace/sense electrodes">32</part-num-ref>
+ and <part-num-ref name="and">34.</part-num-ref>
+ Similarly, switch matrix <part-num-ref name="and 34. Similarly, switch matrix">30</part-num-ref>
+ selectively connects ventricular pacing output circuit <part-num-ref name="selectively connects ventricular pacing output circuit">24</part-num-ref>
+ and ventricular sense amplifier <part-num-ref name="and ventricular sense amplifier">28</part-num-ref>
+ to ventricular pace/sense electrodes <part-num-ref name="to ventricular pace/sense electrodes">36</part-num-ref>
+ and <part-num-ref name="and">38.</part-num-ref>
+    </p>
+    <boundary-data type="header">Atty Docket: P20639.00                               PATENT</boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">5</confidence>
+    </boundary-data>
+    <p id="p-29" num="29">
+      <page-break num="6"/>
+[0021]         Defibrillation circuit 40 includes high voltage capacitors and charging circuits necessary to produce the high voltage defibrillation or cardioversion shock through atrial defibrillation electrode <part-num-ref name="high voltage defibrillation or cardioversion shock through atrial defibrillation electrode">42</part-num-ref>
+ or ventricular defibrillation electrode <part-num-ref name="or ventricular defibrillation electrode">44.</part-num-ref>
+ In this example, defibrillation circuit <part-num-ref name="or ventricular defibrillation electrode 44. In this example, defibrillation circuit">40</part-num-ref>
+ delivers the high voltage shock between one of the electrodes <part-num-ref name="electrodes">42</part-num-ref>
+ or <part-num-ref name="or">44</part-num-ref>
+ and the housing or can of <confidence value="5">I</confidence>
+CD <part-num-ref name="housing or can of ICD">10.</part-num-ref>
+    </p>
+    <p id="p-30" num="30">[0022]         Telemetry circuit 46 and antenna <part-num-ref name="and antenna">48</part-num-ref>
+ permit two-way communication between <confidence value="5">I</confidence>
+CD <part-num-ref name="permit two-way communication between ICD">10</part-num-ref>
+ and an external device. Data stored in RAM <part-num-ref name="external device. Data stored in RAM">16</part-num-ref>
+ can be transferred out of <confidence value="5">I</confidence>
+CD <part-num-ref name="can be transferred out of ICD">10</part-num-ref>
+ through telemetry circuit <part-num-ref name="through telemetry circuit">46</part-num-ref>
+ and antenna <part-num-ref name="and antenna">48</part-num-ref>
+ for use by a clinician, storage in a patient record, or other diagnostic and therapy related purposes. In addition, operating parameters and instructions can be downloaded to <confidence value="5">I</confidence>
+CD <part-num-ref name="patient record, or other diagnostic and therapy related purposes. In addition, operating parameters and instructions can be downloaded to ICD">10</part-num-ref>
+ through antenna <part-num-ref name="through antenna">48</part-num-ref>
+ and telemetry circuit <part-num-ref name="and telemetry circuit">46.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">[0023]         Microprocessor 12 determines the existence of arrhythmia based upon time intervals between sensed cardiac events. In the case of the atria, measurement of the time intervals between P-waves sensed can be analyzed to determine when atrial tachycardia or fibrillation is occurring. In the case of the ventricles, the time intervals between R-waves sensed by sense amplifier <part-num-ref name="time intervals between R-waves sensed by sense amplifier">28</part-num-ref>
+ are used by microprocessor <part-num-ref name="are used by microprocessor">12</part-num-ref>
+ to determine when a ventricular tachycardia or fibrillation is taking place. Once having detected tachycardia or fibrillation, microprocessor <part-num-ref name="ventricular tachycardia or fibrillation is taking place. Once having detected tachycardia or fibrillation, microprocessor">12</part-num-ref>
+ selects a therapy and provides control signals to timing/control circuit <part-num-ref name="therapy and provides control signals to timing/control circuit">20</part-num-ref>
+ to initiate that therapy.    </p>
+    <p id="p-32" num="32">[0024]         F<confidence value="5">I</confidence>
+G. 2 illustrates how ventricular tachycardia and ventricular fibrillation can be detected based upon information derived from EGM waveforms. Waveform <part-num-ref name="illustrates how ventricular tachycardia and ventricular fibrillation can be detected based upon information derived from EGM waveforms. Waveform">100</part-num-ref>
+ illustrates a normal sinus rhythm, waveform <part-num-ref name="normal sinus rhythm, waveform">110</part-num-ref>
+ illustrates ventricular tachycardia, and waveform <part-num-ref name="illustrates ventricular tachycardia, and waveform">120</part-num-ref>
+ illustrates ventricular fibrillation. Also shown in FIG. 2 is detection zone <part-num-ref name="is detection zone">130,</part-num-ref>
+ which shows the time intervals between sensed events that fall within normal sinus rhythm zone 130A, ventricular tachycardia zone 130<confidence value="5">B</confidence>
+, ventricular fibrillation zone 130<confidence value="5">C</confidence>
+, and non-physiological (noise) zone 130D.    </p>
+    <p id="p-33" num="33">[0025]         Normal sinus rhythm waveform 100 shows two successive heartbeats.</p>
+    <p id="p-34" num="34">Each beat begins with an atrial depolarization, (P-wave) followed by ventricular <page-break num="7"/>
+      <boundary-data type="header">Atty Docket: P20639.00                               PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+depolarization (R-wave) and then ventricular repolarization(T-wave). Both the P- wave and the T-wave are typically broader and of lower amplitude than the R- wave.    </p>
+    <p id="p-35" num="35">[0026]         The wavelength of normal sinus rhythm waveform <part-num-ref name="wavelength of normal sinus rhythm waveform">100</part-num-ref>
+ is measured from the onset of the R-wave to the onset of the next successive R-wave. Ventricular sense amplifier <part-num-ref name="next successive R-wave. Ventricular sense amplifier">28</part-num-ref>
+ must sense the R-wave, without sensing either the P-wave or the T-wave, and yet be sensitive enough to sense low amplitude ventricular fibrillation. Sense amplifier <part-num-ref name="T-wave, and yet be sensitive enough to sense low amplitude ventricular fibrillation. Sense amplifier">28</part-num-ref>
+ filters and rectifies the EGM signal and compares the signal to a threshold value. The threshold is set at a percentage of the peak value of the R-wave, and it is then allowed to decay over the interval reading to the next R-wave so that the threshold will be low enough to detect ventricular fibrillation. As long as there is a significant difference in amplitude between the R-wave and the T-wave, the threshold will still be higher than the T-wave at the time that the T-wave occurs. However, if the amplitude of the R-wave is diminished (for example by a partial dislocation of ventricular electrodes <part-num-ref name="partial dislocation of ventricular electrodes">36</part-num-ref>
+ or <part-num-ref name="or">38)</part-num-ref>
+ or if the amplitude of the T-wave is increased (such as by a chemical or drug imbalance), sense amplifier <part-num-ref name="chemical or drug imbalance), sense amplifier">28</part-num-ref>
+ may erroneously sense a T-wave as an R-wave.    </p>
+    <p id="p-36" num="36">T-wave oversensing events may occur with every beat, or only with some beats.</p>
+    <p id="p-37" num="37">[0027]         In the example shown in FIG. 2, waveform <part-num-ref name="example shown in FIG. 2, waveform">100</part-num-ref>
+ has an RR interval of <part-num-ref name="RR interval of">700</part-num-ref>
+ milliseconds, which falls within normal sinus rhythm zone 130A. If, however, the T-wave is erroneously sensed as an R-wave, the RT interval may be short enough to be identified as either falling within VT zone 130B or within V<confidence value="5">F</confidence>
+ zone 130<confidence value="5">C</confidence>
+. Depending upon the heart rate, the TR interval may also be identified as falling within the VT zone 130B or V<confidence value="5">F</confidence>
+ zone 130<confidence value="68">C.</confidence>
+    </p>
+    <p id="p-38" num="38">[0028]         FIG. 2 illustrates three characteristics that can be used to identify T-wave oversensing. First, the RT interval is often different in length from the TR interval.</p>
+    <p id="p-39" num="39">Second, the sum of the RT interval and the TR interval equals the RR interval.</p>
+    <p id="p-40" num="40">Third, the R-wave is generally larger in amplitude and narrower in width than the T-wave. A comparison of morphology of alternating R-waves and T-waves reveals an alternating morphology.</p>
+    <boundary-data type="header">Atty Docket: P20639.00                                PATENT</boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">7</confidence>
+    </boundary-data>
+    <p id="p-41" num="41">
+      <page-break num="8"/>
+[0029]          EGM waveform 110 illustrates ventricular tachycardia. The interval or wavelength of VT waveform <part-num-ref name="interval or wavelength of VT waveform">110</part-num-ref>
+ is shorter than normal sinus rhythm. This is a characteristic that is primarily used by <confidence value="5">I</confidence>
+CD <part-num-ref name="characteristic that is primarily used by ICD">10</part-num-ref>
+ to identify ventricular tachycardia.    </p>
+    <p id="p-42" num="42">If the interval between events sensed by ventricular sense amplifier <part-num-ref name="interval between events sensed by ventricular sense amplifier">28</part-num-ref>
+ falls into VT zone 1<confidence value="885">30B</confidence>
+, that sensed event is identified as a tachycardia sense event (TS).    </p>
+    <p id="p-43" num="43">[0030]         VT waveform 110 shows a generally regular waveform shape, which is different than the shape of the R-wave shown in normal sinus rhythm waveform <part-num-ref name="R-wave shown in normal sinus rhythm waveform">110.</part-num-ref>
+ A comparison of morphology of the ventricular tachycardia waveform pulses to one another shows relatively little variation. A comparison of the VT- waves to a normal R-wave shows a significant difference in morphology.    </p>
+    <p id="p-44" num="44">[0031]         Ventricular fibrillation (VF) waveform 120 is distinguished by its relatively low amplitude, its short interval or wavelength, and its irregular morphology. If the sensed interval is shorter than the VT zone <confidence value="5885">130B</confidence>
+, but greater than about <part-num-ref name="VT zone 130B, but greater than about">140</part-num-ref>
+ milliseconds, the event is classified as a fibrillation sense (<confidence value="5">F</confidence>
+S).    </p>
+    <p id="p-45" num="45">[0032]          Microprocessor 12 detects ventricular tachycardia (VT) or ventricular fibrillation (VF) by counting the number of TS or FS events. Detection occurs when the number of intervals detected (NID) rea<confidence value="8">c</confidence>
+hes a preset value.    </p>
+    <p id="p-46" num="46">[0033<confidence value="5">]</confidence>
+          Microprocessor 12 performs an algorithm that searches for three properties of T-wave oversensing: large successive interval differences, a current interval that equals the sum of the two previous intervals, and alternating morphologies. The first two properties are derived from the current interval RR(<confidence value="68">I)</confidence>
+ and the two proceeding intervals RR(<confidence value="5">I</confidence>
+-1) and RR (1-2). Current interval RR(<confidence value="5">I</confidence>
+) is truncated (e.g. divided by <part-num-ref name="divided by">10)</part-num-ref>
+ to act as a threshold. The following calculations are made:    </p>
+    <p id="p-47" num="47">[0034]          RR<confidence value="5">1</confidence>
+diff<confidence value="5">=</confidence>
+Abs(RR(<confidence value="2">I</confidence>
+-1) - RR(<confidence value="4">I</confidence>
+)) (i.e. successive difference) Eq. <part-num-ref name="successive difference) Eq.">1</part-num-ref>
+ <page-break num="9"/>
+      <boundary-data type="header">
+        <confidence value="2222">Atty</confidence>
+ Docket: P20639.00                                PATENT      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+[0035]         RR2diff<confidence value="5">=</confidence>
+Abs(RR(<confidence value="5">I</confidence>
+-2) - RR(<confidence value="5">I</confidence>
+))              Eq. <part-num-ref name="[0035]         RR2diff=Abs(RR(I-2) - RR(I))              Eq.">2</part-num-ref>
+ [0036]         Rrsum=RR(<confidence value="2">I</confidence>
+-2) + RR(<confidence value="2">I</confidence>
+-1)                   Eq. <part-num-ref name="[0036]         Rrsum=RR(I-2) + RR(I-1)                   Eq.">3</part-num-ref>
+ [0037]         Rrsumdiff=Abs(Rrsum - RR(<confidence value="5">I</confidence>
+))              Eq. <part-num-ref name="[0037]         Rrsumdiff=Abs(Rrsum - RR(I))              Eq.">4</part-num-ref>
+ [0038]         Rrdifdiff = Abs(Abs(RR(<confidence value="2">I</confidence>
+-2)-RR(<confidence value="5">I</confidence>
+-1)) - RR(<confidence value="5">I</confidence>
+))  Eq. <part-num-ref name="[0038]         Rrdifdiff = Abs(Abs(RR(I-2)-RR(I-1)) - RR(I))  Eq.">5</part-num-ref>
+ [0039]         Mindiff = Min(RR<confidence value="4">1</confidence>
+diff, RR2diff, Rrsumdiff, Rrdifdiff)  Eq. <part-num-ref name="[0039]         Mindiff = Min(RR1diff, RR2diff, Rrsumdiff, Rrdifdiff)  Eq.">6</part-num-ref>
+ [0040]         Rrtrun = truncated (RR<confidence value="68">/1</confidence>
+0) to lowest <part-num-ref name="[0040]         Rrtrun = truncated (RR/10) to lowest">10</part-num-ref>
+ <confidence value="5">m</confidence>
+s.  Eq. <part-num-ref name="ms.  Eq.">7</part-num-ref>
+ [0041]         A large successive difference exists if the absolute value of RR1 dif minus Mindiff is greater than or equal to a floor value, which represents the maximum of either Rrtrun or <part-num-ref name="maximum of either Rrtrun or">30</part-num-ref>
+ milliseconds.    </p>
+    <p id="p-48" num="48">[0042]         Abs(RR<confidence value="5">1</confidence>
+diff - Mindiff) &gt;= max(Rrtrun, 30)  Eq. <part-num-ref name="Eq.">8</part-num-ref>
+ [0043]          If a large successive difference is detected based on these calculations, a large successive difference count (Count <part-num-ref name="large successive difference count (Count">1)</part-num-ref>
+ is incremented. If a large successive difference is not detected, then Count <part-num-ref name="large successive difference is not detected, then Count">1</part-num-ref>
+ is decremented. Count <part-num-ref name="is decremented. Count">1</part-num-ref>
+ is maintained between a minimum of <part-num-ref name="minimum of">0</part-num-ref>
+ and a maximum of <part-num-ref name="maximum of">12,</part-num-ref>
+ with a threshold level of <part-num-ref name="threshold level of">8.</part-num-ref>
+ If the threshold level is met, then there is sufficient evidence that alternating length RR intervals exist, which is the first characteristic of T-wave oversensing.    </p>
+    <p id="p-49" num="49">[0044]         The second characteristic of T-wave oversensing is that the current interval RR(<confidence value="5">I</confidence>
+) is approximately equal to the sum of the two previous intervals RR(<confidence value="2">I</confidence>
+-1) and RR(<confidence value="2">I</confidence>
+-2). Microprocessor <part-num-ref name="two previous intervals RR(I-1) and RR(I-2). Microprocessor">12</part-num-ref>
+ uses the values calculated from the current interval and two previous intervals to see whether the absolute value of the difference between the current interval and the sum of the two previous intervals is less than or equal to the truncated value Rrtrun.    </p>
+    <p id="p-50" num="50">[0045]         Rrsumdiff&lt;<confidence value="5">=</confidence>
+ Rrtrun                        Eq. 9 [0046]          If the current RR(<confidence value="5">I</confidence>
+) is equal to the sum of the two previous intervals RR(<confidence value="28">I-</confidence>
+ <part-num-ref name="two previous intervals RR(I-">1)</part-num-ref>
+ and RR(<confidence value="2">I</confidence>
+-2), within a tolerance defined by Rrtrun, then Count <part-num-ref name="tolerance defined by Rrtrun, then Count">2</part-num-ref>
+ is incremented.    </p>
+    <p id="p-51" num="51">If Count 2 is greater than <part-num-ref name="is greater than">1</part-num-ref>
+ for the previous twenty four intervals, then its threshold is met.    </p>
+    <p id="p-52" num="52">[0047]         The third characteristic of T-wave oversensing, alternating morphologies, makes use of wavelet match scores. The portion of the EGM waveform representing a sensed event is reduced to a set of wavelet values, which are <page-break num="10"/>
+      <boundary-data type="header">Atty Docket: P20639.00                               PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+then compared by microprocessor <part-num-ref name="set of wavelet values, which are then compared by microprocessor">12</part-num-ref>
+ to the wavelet values for a template R- wave. If the sensed event is an R-wave, the percentage match with the template should be high (70% or higher). If a T-wave has been misidentified as an R- wave, the wavelet match to the R-wave template will be low (less than 50%) since the T-wave is much broader and lower amplitude than the R-wave. If T- wave oversensing is occurring, the sensed events will represent an R-wave, then a T-wave, then an R-wave, and so on. This will result in a pattern of a high match score for the R-wave, followed by a low match score for the T-wave, and another high match score for the next R-wave. The three successive sensed events, therefore, show an alternating morphology between high-to-low-to-high match. A similar situation occurs when the sensed events are a T-wave, followed by an R-wave, followed by another T-wave. With that sequence of three events, the match scores will be low-to-high-to- low. Once again, an alternating morphology is present. If three consecutive sensed events have alternating scores greater than the threshold (e.g. at least <part-num-ref name="at least">50</part-num-ref>
+ percentage points), then an alternating morphology counter (Count <part-num-ref name="alternating morphology counter (Count">3)</part-num-ref>
+ is incremented.    </p>
+    <p id="p-53" num="53">[0048]         Ventricular tachycardia (VT) typically exhibits match scores which are less than 70%, but which are relatively consistent, since each pulse is of generally the same shape. Thus, a T-wave oversensing pattern, with its alternating morphology, will not be confused with ventricular tachycardia.</p>
+    <p id="p-54" num="54">
+      <confidence value="5">[</confidence>
+0049<confidence value="5">]</confidence>
+         Ventricular fibrillation is (VF) characterized by a waveform which has very low match scores. It does not exhibit the alternating morphology found with a T- wave oversensing pattern.    </p>
+    <p id="p-55" num="55">
+      <confidence value="5">[</confidence>
+0050<confidence value="5">]</confidence>
+         FIG. 3 shows an example of a T-wave oversensing pattern and the calculations used to produce Counts 1-3. FIG. 3 includes ventricular EGM waveform <part-num-ref name="includes ventricular EGM waveform">150,</part-num-ref>
+ marker channel <part-num-ref name="includes ventricular EGM waveform 150, marker channel">160,</part-num-ref>
+ corresponding calculations based on sensed intervals, and Counts 1-3.    </p>
+    <p id="p-56" num="56">[0051]         Marker channel 160 shows sensed events which are labeled VS, FS and FD in FIG. 3. Those events corresponding to intervals that fall into the normal sinus rhythm range are labeled VS. Events resulting in an interval that falls <page-break num="11"/>
+      <boundary-data type="header">
+        <confidence value="2222">Atty</confidence>
+ Docket: P20639.00                               PATENT      </boundary-data>
+      <confidence value="2">-</confidence>
+                                         <part-num-ref name="interval that falls -">
+        <confidence value="88">10</confidence>
+      </part-num-ref>
+ within the ventricular fibrillation range are labeled <confidence value="5">F</confidence>
+S. With the tenth interval identified as being within the fibrillation range (at the far right end of marker channel 160), a fibrillation detect labeled <confidence value="5">F</confidence>
+D appears. In this example, no sensed interval falls into the VT range, and therefore there are no events labeled     </p>
+    <heading id="h-14">TS.</heading>
+    <p id="p-57" num="57">[0052]         Below the sensed event markers are calculated RR interval values in milliseconds. Thus, the first RR interval is <part-num-ref name="first RR interval is">410</part-num-ref>
+ milliseconds. The second interval is <part-num-ref name="second interval is">190</part-num-ref>
+ milliseconds, the third interval is <part-num-ref name="third interval is">220</part-num-ref>
+ milliseconds, and so on. By comparing EGM waveform <part-num-ref name="milliseconds, and so on. By comparing EGM waveform">150</part-num-ref>
+ with marker channel <part-num-ref name="with marker channel">160,</part-num-ref>
+ a pattern of T-wave oversensing is apparent. Starting from the left end of marker channel <part-num-ref name="left end of marker channel">160,</part-num-ref>
+ the third, seventh, ninth, eleventh, and fourteenth sensed events are T-waves, which result in short intervals that are identified as ventricular fibrillation. In fact, waveform <part-num-ref name="third, seventh, ninth, eleventh, and fourteenth sensed events are T-waves, which result in short intervals that are identified as ventricular fibrillation. In fact, waveform">150</part-num-ref>
+ shows a normal sinus rhythm with a generally stable RR interval of approximately <part-num-ref name="generally stable RR interval of approximately">410</part-num-ref>
+ milliseconds.    </p>
+    <p id="p-58" num="58">[0053]         With the real-time T-wave oversensing of the present invention, microprocessor <part-num-ref name="present invention, microprocessor">12</part-num-ref>
+ checks Counts <part-num-ref name="checks Counts">1,</part-num-ref>
+ <part-num-ref name="checks Counts 1,">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ before accepting fibrillation detect event <confidence value="5">F</confidence>
+D as a genuine detection. If Counts 1-3 show evidence that T-wave oversensing contributed to the <confidence value="5">F</confidence>
+D event (as they do in <confidence value="5">F</confidence>
+IG. 3), then detection is withheld. The process repeats itself with each new sensed event.    </p>
+    <p id="p-59" num="59">[0054]         FIG. 4 is a flow diagram showing how the present invention is used to identify T-wave oversensing in real time, so that detection of ventricular tachycardia or ventricular fibrillation is withheld if there is evidence of T-wave oversensing. The determination is made on a event-by-event basis as shown in <confidence value="5">F</confidence>
+IG. 4. With each new sensed event, microprocessor <part-num-ref name="event-by-event basis as shown in FIG. 4. With each new sensed event, microprocessor">12</part-num-ref>
+ gets the RR interval value associated with that sensed event (step 200). Using the calculations which have been described above, microprocessor <part-num-ref name="calculations which have been described above, microprocessor">12</part-num-ref>
+ determines whether a large successive RR difference exists (step 202). If a large successive RR difference exists, Count <part-num-ref name="large successive RR difference exists, Count">1</part-num-ref>
+ is incremented up to a maximum value of <part-num-ref name="maximum value of">12</part-num-ref>
+ (step 202).    </p>
+    <p id="p-60" num="60">Whenever Count 1 is greater than or equal to <part-num-ref name="is greater than or equal to">8,</part-num-ref>
+ microprocessor <part-num-ref name="is greater than or equal to 8, microprocessor">12</part-num-ref>
+ sets a flag indicating that Count <part-num-ref name="flag indicating that Count">1</part-num-ref>
+ threshold has been met (step 206). If a large successive <page-break num="12"/>
+      <boundary-data type="header">Atty Docket: P20639.00                                PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+RR difference is not present with the current interval, Count <part-num-ref name="current interval, Count">1</part-num-ref>
+ is decremented toward a minimum value of zero Step 208).    </p>
+    <p id="p-61" num="61">[0055]         Once Count 1 has been incremented ordecremented, microprocessor <part-num-ref name="has been incremented ordecremented, microprocessor">12</part-num-ref>
+ then determines whether the current interval is equal to the sum of the two previous intervals (step 210). If the answer is yes, Count <part-num-ref name="answer is yes, Count">2</part-num-ref>
+ is incremented (step 212). Count <part-num-ref name="is incremented (step 212). Count">2</part-num-ref>
+ is maintained for only the last <part-num-ref name="last">24</part-num-ref>
+ intervals, so that Count <part-num-ref name="intervals, so that Count">2</part-num-ref>
+ reflects only recent activity. The threshold for Count <part-num-ref name="threshold for Count">2</part-num-ref>
+ is one. If there is one instance in the last <part-num-ref name="last">24</part-num-ref>
+ intervals where the current interval equals the sum of the two previous intervals, then the Count <part-num-ref name="Count">2</part-num-ref>
+ threshold is met and a flag is set (step 214), and microprocessor <part-num-ref name="flag is set (step 214), and microprocessor">12</part-num-ref>
+ moves on to the third category. If the sum of the two previous intervals does not equal the sum of the current interval, microprocessor <part-num-ref name="current interval, microprocessor">12</part-num-ref>
+ moves onto the third category. Count <part-num-ref name="third category. Count">2</part-num-ref>
+ is not decremented.    </p>
+    <p id="p-62" num="62">[0056]          For the third category (alternating morphologies), microprocessor <part-num-ref name="third category (alternating morphologies), microprocessor">12</part-num-ref>
+ compares the wavelet match score of the current sensed event with the wavelet match scores for the two preceding events (step 216). If a pattern of alternating morphologies exists with those three sensed events (i.e. high-low-high or low- high-low), using the difference between wavelet scores greater than the threshold value (e.g. <part-num-ref name="">50</part-num-ref>
+ percentage points), then Count <part-num-ref name="percentage points), then Count">3</part-num-ref>
+ is incremented (step 218). The score in Count <part-num-ref name="score in Count">3</part-num-ref>
+ is maintained only for the last eight sensed events. If Count <part-num-ref name="last eight sensed events. If Count">3</part-num-ref>
+ is greater than or equal to one, microprocessor <part-num-ref name="is greater than or equal to one, microprocessor">12</part-num-ref>
+ sets a flag indicating the Count <part-num-ref name="Count">3</part-num-ref>
+ threshold has been met (step 220). If microprocessor <part-num-ref name="threshold has been met (step 220). If microprocessor">12</part-num-ref>
+ determines that the last three consecutive sensed events do not exhibit alternating morphologies, Count <part-num-ref name="last three consecutive sensed events do not exhibit alternating morphologies, Count">3</part-num-ref>
+ is not changed, it is not decremented.    </p>
+    <p id="p-63" num="63">[0057]         Microprocessor 12 then checks to see whether either ventricular tachycardia (VT) or ventricular fibrillation (VF) has been detected (Dx) (Step 222).</p>
+    <p id="p-64" num="64">This will occur when the VT or VF NID value is met. If the NID value is not met, microprocessor <part-num-ref name="NID value is not met, microprocessor">12</part-num-ref>
+ returns to step <part-num-ref name="returns to step">200</part-num-ref>
+ and gets the next RR interval.    </p>
+    <p id="p-65" num="65">[0058]          If the VT or VF NID value has been met, then microprocessor <part-num-ref name="VT or VF NID value has been met, then microprocessor">12</part-num-ref>
+ checks the flag to see whether at least two of the three count thresholds have been met (step 224). If the answer is yes, this is evidence of T-wave oversensing.    </p>
+    <boundary-data type="header">Atty Docket: P20639.00                                PATENT</boundary-data>
+    <boundary-data type="header">
+      <confidence value="88">12</confidence>
+    </boundary-data>
+    <p id="p-66" num="66">
+      <page-break num="13"/>
+Microprocessor 12 withholds detection and proceeds to step <part-num-ref name="withholds detection and proceeds to step">200</part-num-ref>
+ to get the next RR interval. If not, microprocessor <part-num-ref name="next RR interval. If not, microprocessor">12</part-num-ref>
+ then checks to see if there is a large number of instances where the current interval is equal to the sum of the two previous intervals (step 226). This occurs if Count <part-num-ref name="two previous intervals (step 226). This occurs if Count">2</part-num-ref>
+ is greater than or equal to <part-num-ref name="is greater than or equal to">4.</part-num-ref>
+    </p>
+    <p id="p-67" num="67">If that condition is met, it is strong evidence that the normal sinus rhythm is present. Microprocessor <part-num-ref name="normal sinus rhythm is present. Microprocessor">12</part-num-ref>
+ withholds detection and returns to step <part-num-ref name="withholds detection and returns to step">200</part-num-ref>
+ to get the next RR interval.    </p>
+    <p id="p-68" num="68">[0059]          If less than two of the count thresholds are met and Count <part-num-ref name="count thresholds are met and Count">2</part-num-ref>
+ is less than <part-num-ref name="is less than">4,</part-num-ref>
+ then microprocessor <part-num-ref name="is less than 4, then microprocessor">12</part-num-ref>
+ checks for a large alternating morphology count (step 228). This occurs if Count <part-num-ref name="large alternating morphology count (step 228). This occurs if Count">3</part-num-ref>
+ is greater than or equal to <part-num-ref name="is greater than or equal to">4.</part-num-ref>
+ If this condition is met, it also is strong evidence that a sinus rhythm is present. Detection is withheld and microprocessor <part-num-ref name="sinus rhythm is present. Detection is withheld and microprocessor">12</part-num-ref>
+ returns to step <part-num-ref name="returns to step">200</part-num-ref>
+ to get the next RR interval. If not, then detection occurs and therapy (Rx) (if programmed) begins (step 230).    </p>
+    <p id="p-69" num="69">[0060]          In the example which has been discussed, the interval analysis and the morphology analysis takes place on sensed event-by-event basis. In other embodiments, the wavelet alternating morphology analysis (which is more computation intensive) may not be performed with every sensed event. Instead, the alternating morphology analysis can begin after one or more events have been identified as either a tachycardia sense or a fibrillation sense. For example, a threshold of three tachycardia sense (TS) or fibrillation sense (FS) events may be a threshold for beginning wavelet analysis on an event-by-event basis.</p>
+    <p id="p-70" num="70">[0061]         With the present invention, T-wave oversensing is done on a real-time basis, using counts that are being updated on an event-by-event basis. Counts <part-num-ref name="event-by-event basis. Counts">1,</part-num-ref>
+ <part-num-ref name="event-by-event basis. Counts 1,">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ provide evidence of T-wave oversensing, which is then used whenever the device determines that VT or VF is present. Detection is withheld if the combination of the three counts indicates T-wave oversensing is present, or if one of the counts strongly indicates the presence of T-wave oversensing. Thus, VT or VF detection, and the resulting therapy based on that detection, has been cross-checked for evidence of T-wave oversensing before microprocessor <part-num-ref name="resulting therapy based on that detection, has been cross-checked for evidence of T-wave oversensing before microprocessor">12</part-num-ref>
+ indicates that detection has occurred.    </p>
+    <boundary-data type="header">
+      <confidence value="2222">Atty</confidence>
+ Docket: P20639.<confidence value="5">0</confidence>
+0                              PATENT    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="88">13</confidence>
+    </boundary-data>
+    <p id="p-71" num="71">
+      <page-break num="14"/>
+      <confidence value="2">{</confidence>
+0062]        In addition, microprocessor 12 can produce an alert to the detection of T- wave oversensing. When T-wave oversensing is detected, an alert from the <confidence value="588">ICD</confidence>
+ <part-num-ref name="ICD">10</part-num-ref>
+ can be sounded or sent as a wireless transmission by telemetry circuit <part-num-ref name="wireless transmission by telemetry circuit">46</part-num-ref>
+ and antenna <part-num-ref name="and antenna">48</part-num-ref>
+ to a wireless receiver. Data received from <confidence value="5">I</confidence>
+CD <part-num-ref name="wireless receiver. Data received from ICD">10</part-num-ref>
+ as part of the alert can be analyzed and presented on a network, such as Carelink, that is accessible by a clinician.    </p>
+    <p id="p-72" num="72">[0063]         Although the present invention has been described with reference to preferred embodiments, workers skilled in the art will recognize that changes may be made in form and detail without departing from the spirit and scope of the invention.</p>
+  </description>
+</us-patent-application>
+

applicant/11120240.xml

@@ -0,0 +1,404 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11120240</doc-number>
+        <date>2005-05-02</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">LEEE 2 00496</boundary-data>
+    <heading id="h-1">TORQUE BOOST FOR WIRE FEEDER</heading>
+    <p id="p-1" num="1">This invention relates generally to wire feeders used in arc welding, and more particularly, to protecting a wire feed motor during the feeding of welding wire.</p>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-2" num="2">Many welding applications such as MIG (metal inert gas) or GMAW (gas metal arc welding) utilize a wire feeder to provide a consumable electrode to a workpiece to form a weld bead on the workpiece. Typically, the wire feeder feeds the consumable electrode at a generally constant speed;</p>
+    <p id="p-3" num="3">however, variable wire feed speeds can be selected. A typical wire feeder includes a motor that pulls the consumable electrode from a reel, spool or drum and feeds the consumable electrode wire at a wire feed speed to the welding arc. The wire feeder motor is controlled by a wire feed speed controller that may be a stand alone controller or may be part of a controller that controls other aspects of the welding process. The wire feed controller controls the speed of the wire feeder motor and commonly includes a potentiometer or digital controller which the operator uses to set wire feed speed. When a MIG welding system is used, the wire feeder commonly is integrated with the welding system. In such a welding system, the purpose of the wire feeder is to pull a consumable electrode from a spool, reel or drum and pr<confidence value="8">o</confidence>
+pel the consumable electrode through a welding gun to the welding arc. The propelling action of the wire feeder commonly occurs by the use of a series of rollers that grip the consumable electrode and propel the consumable electrode forward as the roller rotates. Typically, the series of rollers are driven by an electric motor. Typically, a DC permanent magnet motor is used since such motors are typically the cheapest; however, AC motors, DC <confidence value="222222222">brushless</confidence>
+ motors or stepper motors can also be used.    </p>
+    <p id="p-4" num="4">During operation of a welder, the operator typically pulls a trigger on the welding gun when a welding operation is to be performed. The trigger in the welding gun typically causes power to be directed to the wire feed motor to cause the consumable electrode to be propelled to the welding arc. When the trigger on the welding gun is released by the operator, power is typically terminated to the wire feed motor and the welding arc. Under normal operating conditions, the wire feeder provides the consumable electrode wire to the welding ar<confidence value="5">c</confidence>
+ and the current draw of the wire feed motor is within an acceptable range of operation for the motor. In certain situations during the operation of the arc welder, the current draw of the wire feed motor will be outside normal operating ranges thereby causing the motor to overheat. This overheating situation can occur when large <boundary-data type="header">
+        <confidence value="888">-1-</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+diameter consumable electrodes are used. Larger diameter consumable electrodes are more difficult to feed through a wire feeder since the stiff<confidence value="6">,</confidence>
+ large diameter electrode resists bending within the welding gun or conduit to the welding gun. As such, the wire feed motor has to draw more current to force the electrode through the welding gun and to the welding arc. The overheating of the motor can cause damage to the motor <confidence value="222222">and/or</confidence>
+ cause other problems to other components of the welding system.    </p>
+    <p id="p-5" num="5">One common method to prevent motor damage from excessive current draw is to provide a fuse or fusible link electrically between the motor and power source. When excessive current is drawn, the fuse that opens the current to the motor is terminated. However, when a fuse or fusible link is used, the fuse or fusible link must to replaced or reset prior to restarting the wire feeder, thus causing inconvenience and down-time of the welding system. Another known device that is used to protect the wire feed motor is a thermistor. The thermistor can be used as a protective element and/or a control element, wherein the thermistor is used to inhibit current to the motor under extreme conditions, and/or controls the magnitude of power provided to the motor under normal conditions.</p>
+    <p id="p-6" num="6">One particular thermistor is disclosed in US 6,204,479, which is incorporated herein by reference.</p>
+    <p id="p-7" num="7">A PTC thermistor is disposed electrically between the power supply and the wire feed motor. Under normal current conditions, the PTC thermistor allows current to be provided to the wire feed motor from the power supply; however, under excessive current conditions, the PTC thermistor inhibits current from being provided to the wire feed motor from the power supply. The wire feed <confidence value="8">m</confidence>
+otor disclosed in the <confidence value="5">'</confidence>
+479 patent is a DC motor, thus the power supply to the motor provides current in a single direction. As such, the current is disclosed to flow from the power supply, through the PTC thermistor, and then to the motor. The PTC thermistor is disclosed to not be shunted by a resistor and/or a varistor, and/or is not in parallel with a relay.    </p>
+    <p id="p-8" num="8">Other methods to protect the wire feed motor from damage include the use of an external circuit that is used to terminate the welding process when the current to the motor exceeds a set limit.</p>
+    <p id="p-9" num="9">This external circuit can include a circuit breaker, PTC, NTC and/or a software program. When the set limit is exceeded, the welding process is disabled for a given time to allow the wire feed motor <confidence value="666">-to</confidence>
+ cool. The advantage of these types of circuits are that such circuits incorporate simple components and/or a simple algorithm. However, none of the circuits facilitate in solving the problem of the wire feed motor overheating when feeding larger diameter electrodes. These circuits <boundary-data type="header">-2-</boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+are only designed to prevent damage to the motor by temporarily terminating the operation of the motor.    </p>
+    <p id="p-10" num="10">In view of the current state of the art regarding wire feeder, there is a need for a motor controller that can operate a wire feed motor during the use of large diameter electrodes and reduce the incidence of the motor overheating during the feed of such electrode to a welding arc.</p>
+    <heading id="h-3">SUMMARY OF THE INVENTION</heading>
+    <p id="p-11" num="11">The present invention is directed to an improved wire feeder for a welding system that overcomes the past problems of overheating the wire feeder motor, and more particularly to a control system for a wire feeder that reduces the incidence of overheating the wire feeder motor when feeding a large diameter consumable electrode through a welding gun and to the welding arc. The wire feeder of the present invention includes a wire feed motor and a wire feed power supply in electrical communication with the wire feed motor. A feeder electrical circuit is integrated with the power supply and the wire feed motor to adjust the amount of power that is directed to the wire feed motor. In one embodiment of the invention, the feeder electrical circuit selects <confidence value="222222">and/or</confidence>
+ controls the amount of current <confidence value="222222">and/or</confidence>
+ power supplied to the wire feed motor. The feeder electrical circuit, can use one or more hard wire circuits, microprocessors, databases, mathematical algorithms, etc. to control the wire feed motor. Power to the wire feed motor is based on the amount of voltage and current supplied to the wire feed motor. In prior art wire feeders, the current to the motor was held constant and the voltage was varied to adjust the speed of the motor. As such, the voltage was increased to increase the speed of the motor and the voltage was decreased to decrease the speed of the motor. The present invention is a departure from prior art wire feeders in that the current to the wire feed motor is not held constant when adjusting the speed of the motor. It has been found that by adjusting the current to the wire feed motor, the amount of torque generated by the motor can be increased at lower operation speeds without damage to the motor. Such higher torque values enable the wire feeder to feed larger diameter consumable electrodes, which are typically fed at lower speeds, to the welding gun and reduce the overheating problems commonly associated with the feeding of such consumable electrodes.    </p>
+    <p id="p-12" num="12">In another aspect of the present invention, the feeder electrical circuit includes a microprocessor that calculates <confidence value="222222">and/or</confidence>
+ accesses feeder data relating to current, voltage <confidence value="222222">and/or</confidence>
+ power values to the wire feed motor based upon a selected wire feed speed (WFS), power level and/or wire <boundary-data type="header">
+        <confidence value="888">-3-</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+feed motor. The feeder data can be in a modifiable or unmodifiable form. If the feeder data is modifiable, the feeder data can be updated; however, this is not required. The feeder data can include information on current, voltage, Watts, WFS, wire type, <confidence value="222222">and/or</confidence>
+ motor type. As can be appreciated, the data can include other information. In one non-limiting embodiment of the invention, the feeder data provides a current and voltage value for a selected WFS. As such, for each WFS selected by an operator, the microprocessor accesses and/or calcualtes the feeder data and obtains a voltage and current value that is to be directed to the wire feed motor to achieve the selected WFS for the consumable electrode. When a low WFS is selected by the operator, the feeder data that corresponds to such WFS includes a larger current value and lower voltage value than used in prior art wire feeder systems. This higher current value results in greater torque generated by the wire feeder for a selected W<confidence value="5">F</confidence>
+S. When a higher WFS is selected by the operator, the feeder data that corresponds to such WFS includes a standard or lower current value and standard or higher voltage value as compared with prior art wire feeder systems. In another non-limiting embodiment of the invention, the feeder data provides current and voltage values to correspond to a selected power setting by an operator. In this situation, the operator selects a WFS and a power value. The selected power value can be a relative value (e.g., low setting, medium setting, high setting, etc.), an adjusted value (e.g., -50W, -30W, -<confidence value="55">1O</confidence>
+W, <confidence value="566">+10</confidence>
+W, +30W, +50W, etc.) or be a more exact setting (e.g., 200W, <confidence value="8">3</confidence>
+00W, 400W, etc.). As can be appreciated, other or additional arrangements can be used. Based on the selected WFS and power value, the microprocessor accesses and/or calculates the feeder data to obtain the corresponding current and voltage values that are to be directed to the wire feed motor to achieve the desired WFS and power supply to the motor. In still another non-limiting embodiment of the invention, the feeder data corresponds to the type of wire feed motor. Different sizes of motors have different power ratings. In addition, different types of motors (e.g., DC permanent magnet motors, AC motors, DC brushless motors, stepper motors, etc.) have different operating characteristics. The accessed and/or calculated feeder data can provide current, voltage, power and/or WFS information that corresponds to a particular size and/or type of wire feed motor. In yet another non-limiting embodiment of the invention, the feeder data can be in a variety of forms. One form of the feeder data can be a database that includes values for one or more of the following variables, namely, current, voltage, WFS, power (e.g., Watts, etc.), feed motor type, feed motor size, consumable electrode type, consumable electrode size, etc. When such a database is used, a <boundary-data type="header">
+        <confidence value="888">-4-</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+microprocessor is typically used to access this database and obtain values based on one or more preset and/or selected settings (e.g., WFS, power, feed motor type, feed motor size, consumable electrode type, consumable electrode size, etc.). Another or additional form of the feeder data, the feeder data is fully or partially generated by a mathematical algorithm. When one or more values are generated by a mathematical algorithm, a microprocessor is used to access run this mathematical algorithm and obtain values based on one or more preset and/or selected settings (e.g., WFS, power, feed motor type, feed motor size, consumable electrode type, consumable electrode size, etc.).    </p>
+    <p id="p-13" num="13">In still another aspect of the invention, the feeder electrical circuit includes a circuit breaker, PTC, NTC and/or a software program to terminate current and/or voltage to the wire feed motor from the power supply so as to inhibit or prevent damage to the wire feed motor in an overheating situation. In certain situations, a consumable electrode feed problem can occur (e.g., tangling and/or jamming of the electrode, etc.). When such a problem occurs, the consumable electrode cannot be advanced by the wire feed motor, thus the motor begins to overheat. In such situations, a circuit breaker, PTC, NTC and/or a software program is used to terminate current and/or voltage to the wire feed motor to inhibit or prevent damage to the motor from overheating and to enable an operator to correct the feed problem.</p>
+    <p id="p-14" num="14">One object of the present invention is the provision of a wire feeder that can feed various sizes of consumable electrodes with reduced incidence of overheating the wire feed motor.</p>
+    <p id="p-15" num="15">Another object of the present invention is the provision of a wire feeder that includes a feeder an electrical circuit that can control the current and power levels to the wire feed motor.</p>
+    <p id="p-16" num="16">Still another object of the present invention is the provision of a wire feeder that includes a feeder electrical circuit that calculates and/or accesses current, voltage and/or power values that are to be used to operate the wire feed motor.</p>
+    <p id="p-17" num="17">Yet another object of the present invention is the provision of a wire feeder that includes a wire feed motor that generates higher torque values as compared with prior art wire feed motors when feeding large diameter consumable electrodes to a welding gun.</p>
+    <p id="p-18" num="18">These and other objects and advantages will become apparent from the following description taken together with the accompanying drawings.</p>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-19" num="19">Reference may now be made to the drawings, which illustrate an embodiment that the <boundary-data type="header">
+        <confidence value="888">-5-</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+invention may take in physical form and in certain parts and arrangements of parts wherein;    </p>
+    <p id="p-20" num="20">FIGURE 1 illustrates a block diagram of a prior art welding system that includes a wire feeder control to control the speed of a consumable electrode through a welding gun;</p>
+    <p id="p-21" num="21">FIGURE 2 illustrates a block diagram of a prior art electrical circuit for a wire feed motor;</p>
+    <p id="p-22" num="22">FIGURE 3 illustrates a block diagram of another prior art electrical circuit for a wire feed motor;</p>
+    <p id="p-23" num="23">FIGURE 4 illustrates a block diagram of another prior art electrical circuit for a wire feed motor;</p>
+    <p id="p-24" num="24">FIGURE 5 illustrates a block diagram of another prior art electrical circuit for a wire feed motor;</p>
+    <p id="p-25" num="25">FIGURE 6 illustrates a block diagram of a general electrical circuit for a wire feed motor in accordance with the present invention;</p>
+    <p id="p-26" num="26">FIGURE 7 illustrates a block diagram of one specific electrical circuit for a wire feed motor in accordance with the present invention;</p>
+    <p id="p-27" num="27">FIGURE 7A illustrates a graft of the current value to WFS relationship of the current reference values illustrated in FIGURE 7;</p>
+    <p id="p-28" num="28">FIGURE 8 illustrates a block diagram of another specific electrical circuit for a wire feed motor in accordance with the present invention;</p>
+    <p id="p-29" num="29">FIGURE 9 illustrates a block diagram of another specific electrical circuit for a wire feed motor in accordance with the present invention; and, FIGURE 10 illustrates a graft of the enhanced motor torque in relation to the WFS of the motor and the power to the motor in accordance with the present invention.</p>
+    <heading id="h-5">DETAILED DESCRIPTION OF T<confidence value="5">H</confidence>
+E INVENTION    </heading>
+    <p id="p-30" num="30">Referring now to the drawings wherein the showings are for the purpose of illustrating the preferred embodiment only and not for the purpose of limiting the same, FIGURES 1-5 illustrate various prior art arrangements of wire feeders used in conjunction with a welding system such as, but not limited to, a MIG or GMAW welding system. As illustrated in FIGURE 1, there is schematically illustrated a welding system <part-num-ref name="welding system">20</part-num-ref>
+ that includes a power supply <part-num-ref name="power supply">30</part-num-ref>
+ which provides current to the tip <part-num-ref name="tip">40</part-num-ref>
+ of a welding gun so as to generate an electric ar<confidence value="5">c</confidence>
+ A between the tip of the welding gun and a workpiece W. A shielding gas G can be provided through the welding gun to <boundary-data type="header">
+        <confidence value="888">-6-</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+provide shielding to the weld metal from undesired elements and/or compounds in the surrounding environment. The welding system also includes a consumable electrode source <part-num-ref name="consumable electrode source">50</part-num-ref>
+ which is illustrated to be in the form of a reel of wire; however, a drum of wire or other wire source can be used. The consumable electrode <part-num-ref name="consumable electrode">60</part-num-ref>
+ is drawn from the consumable electrode source <part-num-ref name="consumable electrode source">50</part-num-ref>
+ by drive rollers <part-num-ref name="by drive rollers">70</part-num-ref>
+ which form part of the weld wire feeder. A wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ causes the drive roller to rotate at a certain speed so that the consumable electrode <part-num-ref name="consumable electrode">60</part-num-ref>
+ is fed through the welding gun at a desired WFS. Motor <part-num-ref name="desired WFS. Motor">80</part-num-ref>
+ is a DC motor and the power supply to the motor is a DC power source;    </p>
+    <p id="p-31" num="31">however, it can be appreciated that other types of motors and power supplies can be used. The speed of the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ is controlled by a standard control circuit <part-num-ref name="standard control circuit">100.</part-num-ref>
+ A preset or manually selected command <part-num-ref name="preset or manually selected command">110</part-num-ref>
+ sets the WFS. This WFS command is sent to a microprocessor <part-num-ref name="microprocessor">120.</part-num-ref>
+ The microprocessor directs a certain voltage level V to the wire feed motor based on the received WFS command. The current to the wire feed motor is maintained at a relatively constant level, thus the control of the speed of the wire feed motor is by the voltage level directed to the wire feed motor.    </p>
+    <p id="p-32" num="32">As can be appreciated, a potentiometer and/or other type of circuit can be used to direct a voltage V to the wire feed motor, thus eliminating the use of microprocessor <part-num-ref name="use of microprocessor">120.</part-num-ref>
+ Control circuit <part-num-ref name="use of microprocessor 120. Control circuit">100</part-num-ref>
+ also includes an overheating protection system to protect the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ from becoming overheated during the operation of the welding system. This overheating protection system includes a current detector <part-num-ref name="current detector">130</part-num-ref>
+ that detects the amount of current being drawn by the wire feed motor. When the current level detected by the current detector <part-num-ref name="current detector">130</part-num-ref>
+ is above a preset upper limit, a circuit breaker <part-num-ref name="circuit breaker">140</part-num-ref>
+ is opened thereby terminating the operation of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The opening of the circuit breaker can be an automatic operation of the circuit breaker and/or can be at least partially controlled by microprocessor <part-num-ref name="circuit breaker and/or can be at least partially controlled by microprocessor">120</part-num-ref>
+ and/or one or more other control circuits. The time period that the circuit breaker remains open may be a preset time, a manually set time, etc. The circuit breaker can be designed to be manually and/or automatically reset. The opening of the circuit breaker can also cause power source <part-num-ref name="circuit breaker can also cause power source">30</part-num-ref>
+ to terminate; however, this is not required. Power supply <part-num-ref name="to terminate; however, this is not required. Power supply">30,</part-num-ref>
+ control circuit <part-num-ref name="to terminate; however, this is not required. Power supply 30, control circuit">100</part-num-ref>
+ and the components of the wire feeder are shown as discrete blocks; however, in practice, these components can be part of a single housed unit or can be separate and distinct components of the welding system.    </p>
+    <p id="p-33" num="33">Referring now to FIGURE 2, another prior art arrangement control circuit 100 is illustrated for controlling of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ In this particular control arrangement, a WFS command <boundary-data type="header">
+        <confidence value="888">-7-</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+      <part-num-ref name="WFS command">110</part-num-ref>
+ is preset or manually selected by an operator. This WFS command is directed to microprocessor <part-num-ref name="operator. This WFS command is directed to microprocessor">120.</part-num-ref>
+ The microprocessor controls a certain power (Watts) to the wire feed motor based on the received WFS command. The current to the wire feed motor is maintained at a relatively constant level, thus the control of the speed of the wire feed motor is by the voltage level directed to the wire feed motor. The overheating of the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ is protected by the use of circuit beaker <part-num-ref name="use of circuit beaker">140.</part-num-ref>
+    </p>
+    <p id="p-34" num="34">Circuit breaker 140 is positioned between the power output controlled by the microprocessor and the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The circuit breaker receives current output signal Im from the wire feed motor. When the current level is above a preset upper limit, circuit breaker <part-num-ref name="preset upper limit, circuit breaker">140</part-num-ref>
+ opens, thereby terminating the operation of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The time period that the circuit breaker remains open may be a preset time, a manually set time, etc. The circuit breaker can be designed to be manually and/or automatically reset. The opening of the circuit breaker can also cause power source <part-num-ref name="circuit breaker can also cause power source">30</part-num-ref>
+ to terminate; however, this is not required.    </p>
+    <p id="p-35" num="35">Referring now to FIGURE 3, another prior art arrangement control circuit 100 is illustrated for controlling of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ In this particular control arrangement, a WFS command <part-num-ref name="WFS command">110</part-num-ref>
+ is preset or manually selected by an operator. This WFS command is directed to microprocessor <part-num-ref name="operator. This WFS command is directed to microprocessor">120.</part-num-ref>
+ The microprocessor controls a certain power (Watts) to the wire feed motor based on the received WFS command. The current to the wire feed motor is maintained at a relatively constant level, thus the control of the speed of the wire feed motor is by the voltage level directed to the wire feed motor. The overheating of the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ is protected by the use of circuit beaker <part-num-ref name="use of circuit beaker">140.</part-num-ref>
+    </p>
+    <p id="p-36" num="36">Circuit breaker 140 is positioned between wire feed motor <part-num-ref name="is positioned between wire feed motor">80</part-num-ref>
+ and microprocessor <part-num-ref name="and microprocessor">120.</part-num-ref>
+ The circuit breaker receives current and voltage output signal and/or power output signal from the wire feed motor. A preset and/or manually selected power output setting <part-num-ref name="preset and/or manually selected power output setting">150</part-num-ref>
+ directs power into the circuit breaker, which in turn is directed to microprocessor <part-num-ref name="circuit breaker, which in turn is directed to microprocessor">120.</part-num-ref>
+ As can be appreciated, the power output setting <part-num-ref name="power output setting">150</part-num-ref>
+ can be alternatively a maximum power output setting level that is compared with the power output received by the circuit breaker. When the power level is above a preset upper limit, circuit breaker <part-num-ref name="preset upper limit, circuit breaker">140</part-num-ref>
+ opens thereby terminating the operation of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The time period that the circuit breaker remains open may be a preset time, a manually set time, etc. The circuit breaker can be designed to be manually and/or automatically reset. The opening of the circuit breaker can also cause power source <part-num-ref name="circuit breaker can also cause power source">30</part-num-ref>
+ to terminate; however, this is not required.    </p>
+    <p id="p-37" num="37">Referring now to FIGURE 4, another prior art arrangement control circuit 100 is illustrated <boundary-data type="header">
+        <confidence value="888">-8-</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+for controlling of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ This control circuit is similar to the control circuit disclosed in US 6,204,479, which is incorporated herein by reference. In this particular control arrangement, a WFS command <part-num-ref name="WFS command">110</part-num-ref>
+ is preset or manually selected by an operator. This WFS command is directed to microprocessor <part-num-ref name="operator. This WFS command is directed to microprocessor">120.</part-num-ref>
+ The microprocessor controls a certain power (Watts) to the wire feed motor based on the received WFS command. The current to the wire feed motor is maintained at a relatively constant level, thus the control of the speed of the wire feed motor is by the voltage level directed to the wire feed motor. The overheating of the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ is protected by the use of PTC (positive temperature coefficient) thermistor <part-num-ref name="use of PTC (positive temperature coefficient) thermistor">160.</part-num-ref>
+ PCT thermistor <part-num-ref name="use of PTC (positive temperature coefficient) thermistor 160. PCT thermistor">160</part-num-ref>
+ is positioned between the power output controlled by the microprocessor and the wi<confidence value="8">r</confidence>
+e feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The PTC thermistor is used to avoid damaging motor <part-num-ref name="PTC thermistor is used to avoid damaging motor">80</part-num-ref>
+ when excessive current (e.g., 10%, 20%, or more excess current over the expected, typical, or rated current) is being drawn by the motor. PTC thermistor <part-num-ref name="motor. PTC thermistor">160</part-num-ref>
+ provides over-current protection to the motor circuit. Under normal current conditions the PTC thermistor allows current to be provided to the wire feed motor from the power supply, but under excessive current conditions the PTC thermistor inhibits current from being provided to the wire feed motor from the power supply. When motor <part-num-ref name="power supply. When motor">80</part-num-ref>
+ draws excessive current, the excessive current causes the PTC thermistor to switch to a high impedance state, effectively opening the motor circuit. The PTC thermistor will remain in its high-impedance state until power is removed from the circuit and the PTC is allowed to cool. The time period that the PTC thermistor remains open may be a preset time, a manually set time, etc. The PTC thermistor can be designed to be manually <confidence value="222222">and/or</confidence>
+ automatically reset. The opening of the PTC thermistor can also cause power source <part-num-ref name="PTC thermistor can also cause power source">30</part-num-ref>
+ to terminate; however, this is not required.    </p>
+    <p id="p-38" num="38">Referring now to FIGURE 5, another prior art arrangement control circuit 100 is illustrated for controlling of the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ In this particular control arrangement, a WFS command <part-num-ref name="WFS command">110</part-num-ref>
+ is preset or manually selected by an operator. This WFS command is directed to microprocessor <part-num-ref name="operator. This WFS command is directed to microprocessor">120.</part-num-ref>
+ The microprocessor controls a certain power (Watts) to the wire feed motor based on the received WFS command. The current to the wire feed motor is maintained at a relatively constant level, thus the control of the speed of the wire feed motor is by the voltage level directed to the wire feed motor. The overheating of the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ is protected by the microprocessor. The microprocessor receives current output signal <confidence value="5">I</confidence>
+m from the wire feed motor. When the current level is above a preset upper limit, the microprocessor terminates <confidence value="222222">and/or</confidence>
+ causes termination of voltage <boundary-data type="header">
+        <confidence value="888">-9-</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+      <confidence value="222222">and/or</confidence>
+ current to the wire feed motor <part-num-ref name="wire feed motor">80.</part-num-ref>
+ The time period that the microprocessor terminates the operation of the motor may be a preset time, a manually set time, etc. The microprocessor can be designed to be manually <confidence value="222222">and/or</confidence>
+ automatically reset. The microprocessor can also cause power source <part-num-ref name="microprocessor can also cause power source">30</part-num-ref>
+ to terminate; however, this is not required.    </p>
+    <p id="p-39" num="39">In all of the control circuits described above, the purpose of the control circuit is to prevent damage to the wire feed motor due to overheating. One or more of these control circuits can be used <confidence value="86">in</confidence>
+ the welding system of the present invention for such purpose. Although the control circuits illustrated in FIGURES 1-5 can be used to successfully inhibit or prevent damage to the wire feed motor <part-num-ref name="wire feed motor">80</part-num-ref>
+ from over heating, none of these control circuits can provide added torque to the wire feed motor when lower WFS are selected <confidence value="222222">and/or</confidence>
+ larger diameter consumable electrodes are used.    </p>
+    <p id="p-40" num="40">The novel method of operating the wire feed motor to obtain higher torque at lower WFS than were previously possible is by manipulation of the current level being directed to the wire feed motor. In prior art wire feeder, the current to the wire feed motor was maintained relatively constant and the WFS was adjusted by adjusting the voltage to the wire feed motor. When the current to the wire feed motor deviated a certain amount from this constant level, the operation of the wire feed motor was terminated as represented in the control circuits set forth in FIGURES 1-5. The present invention is a departure from the use of a generally constant current to the wire feed motor over all selected WFS.</p>
+    <p id="p-41" num="41">The wire feed motors are designed for a given set point that is used to represent the maximum operating conditions of the wire feed motor. For instance, a wire feed motor may run at <part-num-ref name="wire feed motor may run at">140</part-num-ref>
+ rpm and produce about <part-num-ref name="rpm and produce about">11</part-num-ref>
+ Nm or torque using a input to the wire feed motor of about 28V and <part-num-ref name="wire feed motor of about 28V and">10</part-num-ref>
+ Amps. The wire feed motor thus outputs about <part-num-ref name="wire feed motor thus outputs about">161</part-num-ref>
+ Watts with <part-num-ref name="Watts with">280</part-num-ref>
+ Watt input, thus has about a 58% efficiency.    </p>
+    <p id="p-42" num="42">In the past, the current limit for such a wire feed motor was set at about <confidence value="45">lO</confidence>
+Amps and the motor speed was adjusted by adjusting the voltage to the motor from 0-28V. When this same motor had a speed of about <part-num-ref name="speed of about">50</part-num-ref>
+ rpms, the voltage was s<confidence value="4">e</confidence>
+t to about <part-num-ref name="voltage was set to about">
+        <confidence value="5">1</confidence>
+      </part-num-ref>
+ <confidence value="6">O</confidence>
+V and the current remained at about <confidence value="45">lO</confidence>
+Amps. The input power to the wire feed motor is about <part-num-ref name="wire feed motor is about">100</part-num-ref>
+ Watts and the output power is about <part-num-ref name="output power is about">58</part-num-ref>
+ Watts.    </p>
+    <p id="p-43" num="43">Since the current level of the wire feed motor remains at about <part-num-ref name="wire feed motor remains at about">
+        <confidence value="5">1</confidence>
+      </part-num-ref>
+ <confidence value="6">O</confidence>
+Amps, the maximum torque of the wire feed motor is <part-num-ref name="wire feed motor is">11</part-num-ref>
+ Nm.    </p>
+    <p id="p-44" num="44">The present invention is based on the discovery that at lower wire feed motor speeds, it is possible to increase the current limit to the wire feed motor without causing damage to the wire feed <boundary-data type="header">
+        <confidence value="8888">-10-</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+motor. Even though the wire feed motor efficiency at such higher current levels may be less than the maximum efficiency of the wire feed motor, the total power dissipated in the wire feed motor is less than the power dissipated by the wire feed motor under maximum operating conditions of the wire feed motor. For example, in the above wire feed motor, the wire feed motor under maximum operating conditions of <part-num-ref name="wire feed motor under maximum operating conditions of">140</part-num-ref>
+ rps was able to dissipate about <part-num-ref name="rps was able to dissipate about">119</part-num-ref>
+ Watts <part-num-ref name="Watts">(280</part-num-ref>
+ Watts - <part-num-ref name="Watts -">161</part-num-ref>
+ Watts). At the lower speed of <part-num-ref name="lower speed of">50</part-num-ref>
+ rpms, the wire feed motor only dissipated about <part-num-ref name="wire feed motor only dissipated about">42</part-num-ref>
+ Watts <part-num-ref name="Watts">(100</part-num-ref>
+ Watts - <part-num-ref name="Watts -">58</part-num-ref>
+ Watts). As such, it has been found that the current to the wire feed motor can be increased at lower speeds to increase the torque of the motor without damaging the wire feed motor. For instance, the current to the wire feed motor at about <part-num-ref name="wire feed motor at about">50</part-num-ref>
+ rpms could be increased to nearly <part-num-ref name="rpms could be increased to nearly">28</part-num-ref>
+ Amps. DC permanent magnet motors which are commonly used as wire feed motors have a generally linear relationship between current and torque. As such, if <part-num-ref name="generally linear relationship between current and torque. As such, if">28</part-num-ref>
+ Amps and <part-num-ref name="Amps and">
+        <confidence value="5">1</confidence>
+      </part-num-ref>
+ <confidence value="6">O</confidence>
+V were directed to the wire feed motor to obtain the maximum rating of the wire feed motor of <part-num-ref name="wire feed motor of">280</part-num-ref>
+ Watts, the torque of such wire feed motor using such amp and voltage values could be as high as about 30.8 Nm. As can be appreciated, the upper current limit to the wire feed motor is not only limited to the maximum rating of the wire feed motor, but also to the current density of the brushes of the motor and the changes in motor efficiency as the motor heats up. As can be appreciated, other types of wire feed motors can be used (e.g., DC permanent magnet motors, AC motors, DC brushless motors, stepper motors, etc.).    </p>
+    <p id="p-45" num="45">Referring now to FIGURE 6, a control circuit <part-num-ref name="control circuit">200</part-num-ref>
+ for controlling the weld feed motor <part-num-ref name="weld feed motor">210</part-num-ref>
+ of a wire feeder in accordance with the present invention is illustrated. A WFS command <part-num-ref name="WFS command">220</part-num-ref>
+ is preset or selected by an operator. Based on the selected WFS, a calculating circuit <part-num-ref name="calculating circuit">230</part-num-ref>
+ selects or calculates a current control level and a voltage control level so as to control the current <confidence value="22">Im</confidence>
+ and a voltage V<confidence value="5">m</confidence>
+ for the wire feed motor so as to obtain a desired WFS of the consumable electrode and to cause the motor <part-num-ref name="motor">21<confidence value="5">0</confidence>
+      </part-num-ref>
+ to have higher torque values when the WFS is at lower values. Typically the calculating circuit is or includes one or more microprocessors; however, this is not required. A variety of arrangements can be used to select the current <confidence value="55">Im</confidence>
+ and a voltage V<confidence value="5">m</confidence>
+ for the wire feed motor.    </p>
+    <p id="p-46" num="46">In one non-limiting arrangement, the command signal is a voltage signal such as from a potentiometer or digital device. When a potentiometer is used to generate the voltage, the potentiometer is typically a non-linear potentiometer; however, this is not required. When the microprocessor receives the voltage signal that is representative of the WFS, the microprocessor <boundary-data type="header">
+        <confidence value="8888">-11-</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+calculates or selects from a database a current control value that is used to control the current to the wire feed motor <part-num-ref name="wire feed motor">210.</part-num-ref>
+ In this particular arrangement, the current control value decreases as the selected WFS increases. The decrease in the current control value from the lowest to highest WFS that is generated by the wire feed motor can be a continuous decrease or non-continuous decrease.    </p>
+    <p id="p-47" num="47">When the current decreases, the decrease can be a linear or nonlinear decrease. One such nonlinear current decrease is illustrated in FIGURE 7. Another nonlinear current decrease is illustrated in FIGURE 10. As can be appreciated, numerous current profiles can be used for the wire feed motor.</p>
+    <p id="p-48" num="48">In another non-limiting arrangement, the command signal is a current signal. The increase or decrease in the current control signal can be linear or non-linear. When the microprocessor receives the current control signal that is representative of the WFS, the microprocessor calculates or selects from a database a voltage control value that is to be sent to the wire feed motor <part-num-ref name="wire feed motor">210.</part-num-ref>
+ In this particular arrangement, the voltage control value increases as the selected WFS increases. The increase in the voltage control value from the lowest to highest WFS that is generated by the wire feed motor can be a continuous decrease or non-continuous decrease. When the voltage control value increases, the increase can be a linear or nonlinear increase. In still another non-limiting arrangement, the command signal is a WFS signal. When the microprocessor receives the WFS signal, the microprocessor calculates or selects from a database a voltage and current control value that is used to control the current and voltage to the wire feed motor <part-num-ref name="wire feed motor">210.</part-num-ref>
+ In this particular arrangement, the voltage control value increases and the current value decreases as the selected WFS increases. The increase in voltage control value and the decrease in the current control value as the <confidence value="86">WF</confidence>
+S is increased can be a continuous decrease or non-continuous decrease. When the voltage control value increases, the increase can be a linear or nonlinear increase. When the current control value decreases, the decrease can be linear or non-linear. As can be appreciated many other control arrangements for the current <confidence value="222222">and/or</confidence>
+ voltage can be used which are in accordance with the present invention.    </p>
+    <p id="p-49" num="49">Referring now to FIGURES 7 and 7A, one non-limiting embodiment of the calculating circuit <part-num-ref name="calculating circuit">230</part-num-ref>
+ is illustrated. As shown in FIGURE 7, a WFS <part-num-ref name="WFS">300</part-num-ref>
+ is manually or automatically selected.    </p>
+    <p id="p-50" num="50">The WFS signal can be digital or non-digital. The selected WFS typically is representative of the voltage control value that is used to control the voltage to the wire feed motor; however, this is not required. The selected WFS corresponds to a certain current control value or current reference value <boundary-data type="header">
+        <confidence value="8888">-12-</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+      <confidence value="865">IRF</confidence>
+ for the wire feed motor <part-num-ref name="wire feed motor">210.</part-num-ref>
+ The current reference value <confidence value="566">IRE</confidence>
+F is shown to be included in a database of values 310; however, it can be appreciated that the current reference value could be a calculated value. The current reference value <confidence value="5">I</confidence>
+REF is typically <confidence value="8">s</confidence>
+elected for a particular type and size of wire feed motor. As illustrated in FIGURE 7A, the current reference value I<confidence value="52">RE</confidence>
+ <confidence value="66">is</confidence>
+ not a con<confidence value="8">s</confidence>
+tant value over the WFS range. The I<confidence value="666">REF</confidence>
+ is shown to have a nonlinear relationship to the selected WFS.    </p>
+    <p id="p-51" num="51">As can be appreciated, the current reference value <confidence value="5">I</confidence>
+REF can decrea<confidence value="8">s</confidence>
+e in one or more linear relationships over the partial or full WFS range. The current reference value is shown to decrease as the WFS increases. At a lower WFS, the higher current to the wire feed motor results in a larger torque value generated by the wire feed motor. This higher torque beneficial consumable electrode is being used in the welding system. As can be appreciated, database <part-num-ref name="welding system. As can be appreciated, database">310</part-num-ref>
+ or another database can include the voltage control value or voltage reference value for controlling the voltage to the motor based on the selected WFS; however, this is not required. The changing of the current to the wire feed motor as the WFS is changed is novel to the art of welding. Referring again to FIGURE 7, the current reference value <confidence value="55">IR</confidence>
+EF <confidence value="66">is</confidence>
+ compared in a comparing device <part-num-ref name="comparing device">320</part-num-ref>
+ to the actual current <confidence value="54">IM</confidence>
+ that is being sent to the wire feed motor. The comparing device causes the <confidence value="54">IM</confidence>
+ to adjust to the current reference value I<confidence value="25">RF</confidence>
+ during the operation of the wire feed motor.    </p>
+    <p id="p-52" num="52">Referring now to FIGURE 8, another non-limiting embodiment of the calculating circuit <part-num-ref name="calculating circuit">230</part-num-ref>
+ for controlling wire feed motor <part-num-ref name="for controlling wire feed motor">210</part-num-ref>
+ is illustrated. As shown in FIGURE 8, a WFS <part-num-ref name="WFS">400</part-num-ref>
+ is manually or automatically selected. The WFS signal can be digital or non-digital. The selected WFS corresponds to a certain power control value or power reference value PREF <confidence value="86">to</confidence>
+ control the power to the wire feed motor <part-num-ref name="wire feed motor">210.</part-num-ref>
+ The power reference value <confidence value="566">PRE</confidence>
+F is shown to be included in one or more databases of values 410; however, it can be appreciated that the power reference value could be a calculated value. The power reference value <confidence value="566">PRE</confidence>
+F is typically selected for a particular type and size of wire feed motor. In one optional design of the calculating circuit, the type and/or size of wire feed motor can be selected by selector <part-num-ref name="type and/or size of wire feed motor can be selected by selector">420.</part-num-ref>
+ This selection can be an automatic or manual selection of the motor type and/or size. The selected motor type <part-num-ref name="selected motor type">430</part-num-ref>
+ is transmitted to database <part-num-ref name="is transmitted to database">410</part-num-ref>
+ so that the appropriate power reference value for a particular type of wire feed motor is selected for the selected WFS. This optional design can be used when the wire feed is a separate component of the welding system. When the wire feeder is a separate component, various types of wire feeders may be used in the welding system. These various types of wire feeder can have different sizes and/or types of <boundary-data type="header">
+        <confidence value="8">-</confidence>
+ <confidence value="88">13</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+wire feed motors. As such, this optional design accounts for such varying types of wire feed motors so as to select an appropriate power reference value for a particular type of wire feed motor for the selected WFS. When the wire feeder is an integrated component of the welding system, this optional design can be eliminated. The power reference values in database <part-num-ref name="power reference values in database">410</part-num-ref>
+ are typically based on the motor efficiency characteristics. The power reference table typically provides a current reference value and a voltage reference value for use in controlling <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+ during the operation of the wire feed motor; however, this is not required. As shown in FIGURE 8, the <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+.of the wire feed motor is directed to a summing component <part-num-ref name="summing component">440.</part-num-ref>
+ The summing component generates a power value.    </p>
+    <p id="p-53" num="53">Power is obtained by multiplying <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+. This power value is sent to a comparing component <part-num-ref name="comparing component">450.</part-num-ref>
+ The actual power being used to operate the wire feed motor is compared to the power reference value <confidence value="5586">PEF.</confidence>
+ The comparing component uses the power reference value <confidence value="6686">PREF</confidence>
+ <confidence value="66">to</confidence>
+ control the actual amount of power being sent to the wire feed motor. The <confidence value="54">IM</confidence>
+ that is used to operate the wire feed motor is not constant over the WFS range. Typically the <confidence value="54">IM</confidence>
+ and the V<confidence value="4">M</confidence>
+ are not constant over the WFS range. Typically the <confidence value="54">IM</confidence>
+ will decrease and the V<confidence value="4">M</confidence>
+ will increase as the WFS increases. The increase in V<confidence value="4">M</confidence>
+ <confidence value="222222">and/or</confidence>
+ the decrease in <confidence value="54">IM</confidence>
+ can be over the partial or full WFS range of the wire feed motor. As can also appreciated, the P<confidence value="666">REF</confidence>
+ can be a con<confidence value="8">s</confidence>
+tant <confidence value="5">o</confidence>
+r n<confidence value="5">o</confidence>
+n-constant value over the WFS range. The <confidence value="666">PRE</confidence>
+F f<confidence value="5">o</confidence>
+r a parti<confidence value="8">c</confidence>
+ular type and size of wire feed mot<confidence value="8">o</confidence>
+r f<confidence value="5">o</confidence>
+r a particular W<confidence value="5">F</confidence>
+S will depend on the efficiency characteristics of the wire feed motor. A power interruption component <part-num-ref name="power interruption component">460</part-num-ref>
+ can be used to terminate power to the wire feed motor. The power interruption component can be part of or a separate component from the calculating circuit <part-num-ref name="calculating circuit">230.</part-num-ref>
+ The power interruption component is designed to protect the wire feed motor from becoming overheated. the power interruption circuit can be the same as or similar to the safety circuits illustrated in FIGURES 1-5, or can be some other arrangement.    </p>
+    <p id="p-54" num="54">Referring now to FIGURE 9, another non-limiting embodiment of the calculating circuit <part-num-ref name="calculating circuit">230</part-num-ref>
+ for controlling wire feed motor <part-num-ref name="for controlling wire feed motor">210</part-num-ref>
+ is illustrated. As shown in FIGURE 9, a power setting <part-num-ref name="power setting">500</part-num-ref>
+ is manually selected. This manually adjusted power setting is optional. When no manual power setting is used, a preset or automatically set power setting is used by the calculating circuit. The manual set, preset or automatically set power setting creates a power reference setting <confidence value="6668">PREF</confidence>
+ <part-num-ref name="power reference setting PREF">
+        <confidence value="88">51</confidence>
+0.      </part-num-ref>
+ This <confidence value="5668">PREF</confidence>
+ <confidence value="66">is</confidence>
+ a <confidence value="8">c</confidence>
+on<confidence value="8">s</confidence>
+tant value k that is used by the calculating circuit to control the power to the wire feed motor. The power reference table typically provides a current reference value and a voltage <boundary-data type="header">
+        <confidence value="8888">-14-</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+      <boundary-data type="header">LEEE <confidence value="8">2</confidence>
+ 00496      </boundary-data>
+reference value for use in controlling <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+ during the operation of the wire feed motor;    </p>
+    <p id="p-55" num="55">however, this is not required. As shown in FIGURE 9, the <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+ of the wire feed motor is directed to a summing component <part-num-ref name="summing component">520.</part-num-ref>
+ The summing component generates a power value. Power is obtained by multiplying <confidence value="54">IM</confidence>
+ and V<confidence value="4">M</confidence>
+. This power value is sent to a comparing component <part-num-ref name="comparing component">530.</part-num-ref>
+ The actual power being used to operate the wire feed motor is compared to the power reference value <confidence value="86664">PREF.</confidence>
+ The comparing component uses the power reference value P<confidence value="668">REF</confidence>
+ <confidence value="54">to</confidence>
+ control the actual amount of power being sent to the wire feed motor. The <confidence value="54">IM</confidence>
+ that is used to operate the wire feed motor is not constant over the WFS range. Typically the <confidence value="54">IM</confidence>
+ and the V<confidence value="4">M</confidence>
+ are not constant over the WFS range.    </p>
+    <p id="p-56" num="56">Typically the <confidence value="54">IM</confidence>
+ will decrease and the V<confidence value="4">M</confidence>
+ will increase as the WFS increases. The increase in V<confidence value="4">M</confidence>
+ and/or the decrease in <confidence value="55">IM</confidence>
+ can be over the partial or full WFS range of the wire feed motor. As can also be appreciated, the <confidence value="5">P</confidence>
+REF can be a constant or non-con<confidence value="5">s</confidence>
+tant value over the WFS range. The <confidence value="525">PRF</confidence>
+ for a particular type and size of wire feed motor for a particular WFS will depend on the efficiency characteristics of the wire feed motor. A power interruption component <part-num-ref name="power interruption component">540</part-num-ref>
+ can be used to terminate power to the wire feed motor. The power interruption component can be part of or a separate component from the calculating circuit <part-num-ref name="calculating circuit">230.</part-num-ref>
+ The power interruption component is designed to protect the wire feed motor from becoming overheated<confidence value="5">.</confidence>
+ the power interruption circuit can be the same as or similar to the safety circuits illustrated in FIGURES 1-5, or can be some other arrangement.    </p>
+    <p id="p-57" num="57">In the non-limiting embodiments of the invention illustrated in FIGURES 6-9, the current to the wire feed motor is increased at lower WFS and decreased at higher WFS so that the torque generated by the wire feed motor is greater at lower WFS. This relationship of greater motor torque at lower WFS in combination with the use of higher currents to the motor at lower WFS is illustrated in FIGURE 10. FIGURE 10 illustrates just one of many motor torque to WFS profiles that can be used in the present invention. Different types and sizes of motors may utilize different motor torque to WFS profiles. As illustrated in FIGURE 10, the maximum allowable power to the wire feed motor can be varied over the WFS range of the wire feed motor. This increase in power in represented by the hatched area. In prior wire feed motor control arrangements, the maximum power to the wire feed motor remained generally constant as illustrated by the non-hatched region. As the WFS increases, the maximum allowable power to the wire feed motor deceases due to the limits on motor efficiency. The current limit and motor torque limit of the wire feed motor at lower WFS is <boundary-data type="header">
+        <confidence value="8">-</confidence>
+ <confidence value="88">15</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">LEEE 2 00496</boundary-data>
+limited by the brush current limit of the wire feed motor and/or other structural limits of the components of the<confidence value="2">-</confidence>
+wire feed motor. As stated above with respect to FIGURE 7A, different types and sizes of motors may utilize different current to WFS profiles. All these different possible profiles fall within the scope of the present invention. In summary, the present invention is directed to a wire feeder control system that can augment the torque generated by the wire feed motor at lower WFS. This augmentation of the torque is accomplished by varying the current control level to the wire feed motor at least partially over the WFS range of the wire feeder.    </p>
+    <p id="p-58" num="58">It should be apparent that there has been provided in accordance with the present invention a method and apparatus for generating high torque values for wire feed motors under certain conditions and also protecting the wire feed motor from overheating when feeding the consumable electrode that fully satisfies the objectives and advantages set forth above. It will thus be seen that the objects set forth above, among those made apparent from the preceding description, are efficiently attained, and since certain changes may be made in the constructions set forth without departing from the spirit and scope of the invention, it is intended that all matter contained in the above description and shown in the accompanying drawings shall be interpreted as illustrative and not in a limiting sense. The invention has been described with reference to preferred and alternate embodiments. Modifications and alterations will become apparent to those skilled in the art upon reading and understanding the detailed discussion of the invention provided herein. This invention is intended to include all such modifications and alterations insofar as they come within the scope of the present invention. It is also to be understood that the following claims are intended to cover all of the generic and specific features of the invention <confidence value="8">h</confidence>
+erein described and all statements of the scope of the invention, which, as a matter of language, might be said to fall therebetween.    </p>
+    <boundary-data type="header">
+      <confidence value="8">-</confidence>
+ <confidence value="88">16</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11139353.xml

@@ -0,0 +1,436 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11139353</doc-number>
+        <date>2005-05-27</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">200312594-1</boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">1</confidence>
+    </boundary-data>
+    <heading id="h-1">IMAGING SYSTEM AND METHOD</heading>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">[0001]   Automatic document feeders are used to automatically feed sheets of paper <confidence value="222222">and/or</confidence>
+ other types of media objects to a scanning area of an imaging device such as a scanner, copier, or facsimile machine. For example, some types of automatic document feeders have a scan window through which the media object is "viewed" by the imaging device to generate a scanned image of the media object. However, if an opaque object such as dirt, dust, or another type of undesired object is disposed within a viewing area as defined by the scan window, the resulting scanned image of the media object generally contains a streak corresponding to a location of the opaque object as the media is moved across the opaque object during a scan.    </p>
+    <heading id="h-3">BRIEF DESCRI<confidence value="8">P</confidence>
+TION OF THE DRAWINGS    </heading>
+    <p id="p-2" num="2">[0002]   For a more complete understanding of the present invention and the advantages thereof, reference is now made to the following descriptions taken in connection with the accompanying drawings in which:</p>
+    <p id="p-3" num="3">[0003]   FIGURE 1 is a diagram illustrating an embodiment of an imaging system in accordance with the present invention;</p>
+    <p id="p-4" num="4">[0004<confidence value="5">]</confidence>
+   FIGURE 2 is a block diagram illustrating an embodiment of the imaging system illustrated in FIGURE 1 in accordance with the present invention; and <confidence value="5">[</confidence>
+0005]   FIGURE 3 is a flow diagram illustrating an embodiment of an imaging method in accordance with the present invention.    </p>
+    <heading id="h-4">
+      <confidence value="6">,</confidence>
+    </heading>
+    <p id="p-5" num="5">
+      <page-break num="2"/>
+200312594<confidence value="68">-1</confidence>
+ <confidence value="8">2</confidence>
+     </p>
+    <heading id="h-5">DETAILED DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-6" num="6">[0006]   The preferred embodiments of the present invention and the advantages thereof are best understood by referring to FIGURES 1-3 of the drawings, like numerals being used for like and corresponding parts of the various drawings.</p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0007]   FIGURE 1 is a diagram illustrating an embodiment of an imaging system <part-num-ref name="imaging system">10</part-num-ref>
+ in accordance with the present invention. In the embodiment illustrated in FIGURE 1, imaging system <part-num-ref name="embodiment illustrated in FIGURE 1, imaging system">10</part-num-ref>
+ comprises an automatic document feeder (ADF) <part-num-ref name="automatic document feeder (ADF)">12</part-num-ref>
+ and an imaging device <part-num-ref name="imaging device">14.</part-num-ref>
+ Imaging device <part-num-ref name="imaging device 14. Imaging device">14</part-num-ref>
+ comprises any type of device for scanning and generating an image of a media object <part-num-ref name="media object">18</part-num-ref>
+ such as, but not limited to, a scanner, copier, or facsimile machine. ADF <part-num-ref name="scanner, copier, or facsimile machine. ADF">12</part-num-ref>
+ comprises any type of feeding mechanism for automatically feeding or placing media object(s) <part-num-ref name="comprises any type of feeding mechanism for automatically feeding or placing media object(s)">18</part-num-ref>
+ within view of imaging device <part-num-ref name="within view of imaging device">14</part-num-ref>
+ to facilitate scanning of media object(s) <part-num-ref name="to facilitate scanning of media object(s)">18</part-num-ref>
+ such as, but not limited to, a scroll-feed or a platen-feed mechanism.    </p>
+    <p id="p-8" num="8">[0008]   In the embodiment illustrated in FIGURE 1, imaging device <part-num-ref name="embodiment illustrated in FIGURE 1, imaging device">14</part-num-ref>
+ comprises a light source <part-num-ref name="light source">20</part-num-ref>
+ for illuminating media object <part-num-ref name="for illuminating media object">18</part-num-ref>
+ and an optical head <part-num-ref name="optical head">22</part-num-ref>
+ for receiving an optical signal reflected by media object <part-num-ref name="optical signal reflected by media object">18.</part-num-ref>
+ For example, in the embodiment illustrated in FIGURE 1, optical head <part-num-ref name="embodiment illustrated in FIGURE 1, optical head">22</part-num-ref>
+ comprises an image sensor array <part-num-ref name="image sensor array">24</part-num-ref>
+ for converting optical signals received or otherwise reflected from media object <part-num-ref name="for converting optical signals received or otherwise reflected from media object">18</part-num-ref>
+ to electronic signals such as, but not limited to, a charge coupled device (CCD) array. Imaging device <part-num-ref name="charge coupled device (CCD) array. Imaging device">14</part-num-ref>
+ also comprises a platen <part-num-ref name="platen">30</part-num-ref>
+ for supporting media object(s) <part-num-ref name="for supporting media object(s)">18</part-num-ref>
+ during a scanning operation.    </p>
+    <p id="p-9" num="9">[0009<confidence value="5">]</confidence>
+   In the embodiment illustrated in FIGURE 1, imaging device <part-num-ref name="embodiment illustrated in FIGURE 1, imaging device">14</part-num-ref>
+ also comprises a controller <part-num-ref name="controller">36,</part-num-ref>
+ an interface <part-num-ref name="interface">38,</part-num-ref>
+ and a calibration system <part-num-ref name="calibration system">40.</part-num-ref>
+ Controller <part-num-ref name="calibration system 40. Controller">36,</part-num-ref>
+ interface <part-num-ref name="calibration system 40. Controller 36, interface">38,</part-num-ref>
+ and calibration system <part-num-ref name="calibration system 40. Controller 36, interface 38, and calibration system">40</part-num-ref>
+ may comprise hardware, software, or a combination of hardware and software. In operation, controller <part-num-ref name="combination of hardware and software. In operation, controller">36</part-num-ref>
+ is used to control a scanning operation using imaging device <part-num-ref name="scanning operation using imaging device">14</part-num-ref>
+ such as, but not limited to, locating and/or otherwise positioning or moving optical head <part-num-ref name="such as, but not limited to, locating and/or otherwise positioning or moving optical head">22</part-num-ref>
+ relative to platen <part-num-ref name="relative to platen">30</part-num-ref>
+ and/or activating and deactivating light source <part-num-ref name="and/or activating and deactivating light source">20.</part-num-ref>
+ Interface <part-num-ref name="and/or activating and deactivating light source 20. Interface">38</part-num-ref>
+ is used to provide a user of system <part-num-ref name="user of system">10</part-num-ref>
+ with an interface for communicating with system <part-num-ref name="interface for communicating with system">10,</part-num-ref>
+ for inputting information to system <part-num-ref name="interface for communicating with system 10, for inputting information to system">10</part-num-ref>
+ or receiving an output of information from system <part-num-ref name="output of information from system">10.</part-num-ref>
+ For example, interface <part-num-ref name="output of information from system 10. For example, interface">38</part-num-ref>
+ may comprise a keypad, touch pad, liquid crystal display (LCD), or other type of mechanism for enabling information transfer between system <part-num-ref name="keypad, touch pad, liquid crystal display (LCD), or other type of mechanism for enabling information transfer between system">10</part-num-ref>
+ and a user of system <part-num-ref name="user of system">10.</part-num-ref>
+ Calibration system <part-num-ref name="user of system 10. Calibration system">40</part-num-ref>
+ is used for performing a calibration scan of system <part-num-ref name="calibration scan of system">10.</part-num-ref>
+    </p>
+    <boundary-data type="header">200312594-1</boundary-data>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <p id="p-10" num="10">
+      <page-break num="3"/>
+[0010<confidence value="5">]</confidence>
+   In the embodiment illustrated in FIGURE 1, ADF <part-num-ref name="embodiment illustrated in FIGURE 1, ADF">12</part-num-ref>
+ comprises a scan window <part-num-ref name="scan window">44</part-num-ref>
+ through which media object(s) <part-num-ref name="through which media object(s)">18</part-num-ref>
+ to be scanned can be imaged by imaging device <part-num-ref name="to be scanned can be imaged by imaging device">14.</part-num-ref>
+ In the embodiment illustrated in FIGURE 1, scan window <part-num-ref name="embodiment illustrated in FIGURE 1, scan window">44</part-num-ref>
+ is sized having a generally small cross-sectional area relative to a cross-sectional area of platen <part-num-ref name="cross-sectional area of platen">30.</part-num-ref>
+ However, it should be understood that scan window <part-num-ref name="cross-sectional area of platen 30. However, it should be understood that scan window">44</part-num-ref>
+ may be otherwise sized (e.g., scan window <part-num-ref name="scan window">44</part-num-ref>
+ may be sized having a cross-sectional area smaller than, greater than, or equal to a cross-sectional area of platen 30). In the embodiment illustrated in FIGURE 1, ADF <part-num-ref name="embodiment illustrated in FIGURE 1, ADF">12</part-num-ref>
+ also comprises a feed strip <part-num-ref name="feed strip">46</part-num-ref>
+ constructed from mylar, plastic or another suitable transparent material and disposed over scan window <part-num-ref name="constructed from mylar, plastic or another suitable transparent material and disposed over scan window">44</part-num-ref>
+ between media object <part-num-ref name="between media object">18</part-num-ref>
+ and platen <part-num-ref name="and platen">30</part-num-ref>
+ to enable recovery and/or rejection of media object(s) <part-num-ref name="to enable recovery and/or rejection of media object(s)">18</part-num-ref>
+ from ADF <part-num-ref name="from ADF">12.</part-num-ref>
+ ADF <part-num-ref name="from ADF 12. ADF">12</part-num-ref>
+ also comprises rollers <part-num-ref name="also comprises rollers">50</part-num-ref>
+ and <part-num-ref name="and">52</part-num-ref>
+ for feeding media object(s) <part-num-ref name="for feeding media object(s)">18</part-num-ref>
+ past scan window <part-num-ref name="past scan window">44</part-num-ref>
+ to facilitate image scanning of media object(s) <part-num-ref name="to facilitate image scanning of media object(s)">18</part-num-ref>
+ by imaging device <part-num-ref name="by imaging device">14.</part-num-ref>
+    </p>
+    <p id="p-11" num="11">[0011<confidence value="5">]</confidence>
+   In the embodiment illustrated in FIGURE 1, ADF <part-num-ref name="embodiment illustrated in FIGURE 1, ADF">12</part-num-ref>
+ further comprises a luminescent calibration strip <part-num-ref name="luminescent calibration strip">60</part-num-ref>
+ disposed at least partially within an area as defined by scan window <part-num-ref name="area as defined by scan window">44</part-num-ref>
+ such that calibration strip <part-num-ref name="such that calibration strip">60</part-num-ref>
+ is visible by optical head <part-num-ref name="is visible by optical head">22</part-num-ref>
+ through feed strip <part-num-ref name="through feed strip">46,</part-num-ref>
+ scan window <part-num-ref name="through feed strip 46, scan window">44</part-num-ref>
+ and platen <part-num-ref name="and platen">30</part-num-ref>
+ (e.g., calibration strip <part-num-ref name="calibration strip">60</part-num-ref>
+ may be sized having a cross-sectional area greater than, less than, or equal to a cross-sectional area of scan window 44). In the embodiment illustrated in FIGURE 1, calibration strip <part-num-ref name="embodiment illustrated in FIGURE 1, calibration strip">60</part-num-ref>
+ is disposed within ADF <part-num-ref name="is disposed within ADF">12</part-num-ref>
+ such that feed strip <part-num-ref name="such that feed strip">46</part-num-ref>
+ is disposed between calibration strip <part-num-ref name="is disposed between calibration strip">60</part-num-ref>
+ and platen <part-num-ref name="and platen">30</part-num-ref>
+ of imaging device <part-num-ref name="of imaging device">14.</part-num-ref>
+    </p>
+    <p id="p-12" num="12">In some embodiments of the present invention, calibration strip <part-num-ref name="present invention, calibration strip">60</part-num-ref>
+ is formed by coating or otherwise applying a luminescent material or coating to a substrate material such as, but not limited to, plastic or mylar. In other embodiments of the present invention, a luminescent material is impregnated into a substrate material. Thus, it should be understood that a variety of different types or methods may be used to form calibration strip <part-num-ref name="variety of different types or methods may be used to form calibration strip">60.</part-num-ref>
+ In operation, calibration strip <part-num-ref name="variety of different types or methods may be used to form calibration strip 60. In operation, calibration strip">60</part-num-ref>
+ is used to determine whether an opaque object(s) or material(s) such as, but not limited to, dust, dirt, fingerprint, smudge, or any other type foreign or undesirable matter is disposed on or within feed strip <part-num-ref name="opaque object(s) or material(s) such as, but not limited to, dust, dirt, fingerprint, smudge, or any other type foreign or undesirable matter is disposed on or within feed strip">46</part-num-ref>
+ which may otherwise cause a streak to appear on an output of a scanned image of media object(s) <part-num-ref name="scanned image of media object(s)">18.</part-num-ref>
+    </p>
+    <p id="p-13" num="13">[0012<confidence value="5">]</confidence>
+   In operation, according to some embodiments of the present invention, calibration system <part-num-ref name="present invention, calibration system">40</part-num-ref>
+ causes or otherwise communicates with controller <part-num-ref name="causes or otherwise communicates with controller">36</part-num-ref>
+ to activate light source <part-num-ref name="to activate light source">20</part-num-ref>
+ to illuminate and/or otherwise charge calibration strip <part-num-ref name="to illuminate and/or otherwise charge calibration strip">60.</part-num-ref>
+ After a predetermined time period (e.g., a time period adequate to suitably charge calibration strip <part-num-ref name="time period adequate to suitably charge calibration strip">60</part-num-ref>
+ for obtaining a <page-break num="4"/>
+      <boundary-data type="header">200312594<confidence value="68">-1</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+desired level of illumination by calibration strip 60), calibration system <part-num-ref name="desired level of illumination by calibration strip 60), calibration system">40</part-num-ref>
+ causes and/or otherwise communicates with controller <part-num-ref name="causes and/or otherwise communicates with controller">36</part-num-ref>
+ to turn off light source <part-num-ref name="to turn off light source">20.</part-num-ref>
+ Calibration system <part-num-ref name="to turn off light source 20. Calibration system">40</part-num-ref>
+ also causes and/or otherwise communicates with controller <part-num-ref name="also causes and/or otherwise communicates with controller">36</part-num-ref>
+ to move optical head <part-num-ref name="to move optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ to perform a calibration scan of at least a portion of scan window <part-num-ref name="portion of scan window">44</part-num-ref>
+ using light emitted by the charged calibration strip <part-num-ref name="charged calibration strip">60</part-num-ref>
+ through feed strip <part-num-ref name="through feed strip">46,</part-num-ref>
+ scan window <part-num-ref name="through feed strip 46, scan window">44</part-num-ref>
+ and platen <part-num-ref name="and platen">30</part-num-ref>
+ to optical head <part-num-ref name="to optical head">22.</part-num-ref>
+ The image information captured by optical head <part-num-ref name="image information captured by optical head">22</part-num-ref>
+ during the calibration scan is used to identify and/or otherwise locate opaque objects or materials within a visible or viewable area defined by the scan window <part-num-ref name="scan window">44</part-num-ref>
+ (e.g., such as opaque objects or materials on or within feed strip 46). In the embodiment of the present invention described above, light source <part-num-ref name="present invention described above, light source">20</part-num-ref>
+ of imaging device <part-num-ref name="of imaging device">14</part-num-ref>
+ is used to charge calibration strip <part-num-ref name="is used to charge calibration strip">60.</part-num-ref>
+ However, it should be understood that calibration strip <part-num-ref name="is used to charge calibration strip 60. However, it should be understood that calibration strip">60</part-num-ref>
+ may be otherwise charged (e.g., a light source located within ADF <part-num-ref name="light source located within ADF">12</part-num-ref>
+ or elsewhere).    </p>
+    <p id="p-14" num="14">[0013<confidence value="5">]</confidence>
+   FIGURE 2 is a block diagram illustrating an embodiment of system <part-num-ref name="embodiment of system">10</part-num-ref>
+ in accordance with the present invention. In the embodiment illustrated in FIGURE 2, imaging device <part-num-ref name="embodiment illustrated in FIGURE 2, imaging device">14</part-num-ref>
+ comprises a processor <part-num-ref name="processor">62</part-num-ref>
+ and a memory <part-num-ref name="memory">64.</part-num-ref>
+ In the embodiment illustrated in FIGURE 2, controller <part-num-ref name="embodiment illustrated in FIGURE 2, controller">36</part-num-ref>
+ and calibration system <part-num-ref name="and calibration system">40</part-num-ref>
+ a<confidence value="5">r</confidence>
+e illustrated as being stored in memory <part-num-ref name="are illustrated as being stored in memory">64</part-num-ref>
+ <confidence value="66">so</confidence>
+ as to be accessible and/or executable by processor <part-num-ref name="so as to be accessible and/or executable by processor">62.</part-num-ref>
+ However, it should be understood that controller <part-num-ref name="so as to be accessible and/or executable by processor 62. However, it should be understood that controller">36</part-num-ref>
+ and/or calibration system <part-num-ref name="and/or calibration system">40</part-num-ref>
+ may be otherwise stored, even remotely from imaging device <part-num-ref name="may be otherwise stored, even remotely from imaging device">14.</part-num-ref>
+ In the embodiment illustrated in FIGURE 2, calibration system <part-num-ref name="embodiment illustrated in FIGURE 2, calibration system">40</part-num-ref>
+ comprises a calibration module <part-num-ref name="calibration module">70</part-num-ref>
+ and a mapping module <part-num-ref name="mapping module">72</part-num-ref>
+ each of which may comprise hardware, software, or a combination of hardware and software. Calibration module <part-num-ref name="combination of hardware and software. Calibration module">70</part-num-ref>
+ is used to perform and/or otherwise control a calibration scan of calibration strip <part-num-ref name="calibration scan of calibration strip">60.</part-num-ref>
+ Mapping module <part-num-ref name="calibration scan of calibration strip 60. Mapping module">72</part-num-ref>
+ is used to map and/or otherwise analyze image information obtained during the calibration scan based on light received from a charged calibration strip <part-num-ref name="charged calibration strip">60</part-num-ref>
+ to locate and/or otherwise identify opaque object(s) or material(s) within a visible or viewable area defined by scan window <part-num-ref name="visible or viewable area defined by scan window">44</part-num-ref>
+ by optical head <part-num-ref name="by optical head">22</part-num-ref>
+ (e.g., on or within feed strip 46).    </p>
+    <p id="p-15" num="15">[0014]   In the embodiment illustrated in FIGURE 2, memory <part-num-ref name="embodiment illustrated in FIGURE 2, memory">64</part-num-ref>
+ comprises a database <part-num-ref name="database">80</part-num-ref>
+ having object mapping data <part-num-ref name="having object mapping data">82,</part-num-ref>
+ calibration data <part-num-ref name="having object mapping data 82, calibration data">84,</part-num-ref>
+ and interval data <part-num-ref name="having object mapping data 82, calibration data 84, and interval data">86.</part-num-ref>
+ Object mapping data <part-num-ref name="having object mapping data 82, calibration data 84, and interval data 86. Object mapping data">82</part-num-ref>
+ comprises information associated with mapping of locations of opaque objects within a visible or viewable a<confidence value="8">r</confidence>
+ea as defined by scan window <part-num-ref name="visible or viewable area as defined by scan window">44</part-num-ref>
+ by optical head <part-num-ref name="by optical head">22.</part-num-ref>
+    </p>
+    <p id="p-16" num="16">For example, in operation, opaque objects visible by optical head 22 in the area defined by scan window <part-num-ref name="area defined by scan window">44</part-num-ref>
+ generally result in black or da<confidence value="8">r</confidence>
+k spots in the imaging content resulting from <page-break num="5"/>
+      <boundary-data type="header">200312594-1</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+the calibration scan of calibration strip <part-num-ref name="calibration scan of calibration strip">60</part-num-ref>
+ which are mapped relative to a cross-sectional area of at least a portion of scan window <part-num-ref name="portion of scan window">44.</part-num-ref>
+ In the embodiment illustrated in FIGURE 2, object mapping data <part-num-ref name="embodiment illustrated in FIGURE 2, object mapping data">82</part-num-ref>
+ comprises threshold data <part-num-ref name="comprises threshold data">90</part-num-ref>
+ and history data <part-num-ref name="and history data">91.</part-num-ref>
+ Threshold data <part-num-ref name="and history data 91. Threshold data">90</part-num-ref>
+ comprises information associated with a threshold value used to evaluate calibration scan image information (e.g., dark or black spots) indicating an opaque(s) object within the visible area defined by scan window <part-num-ref name="visible area defined by scan window">44.</part-num-ref>
+ For example, in some embodiments of the present invention, image information indicating the presence of an opaque object(s) within the visible area defined by scan window <part-num-ref name="visible area defined by scan window">44</part-num-ref>
+ falling below a predetermined threshold value as indicated by threshold data <part-num-ref name="predetermined threshold value as indicated by threshold data">90</part-num-ref>
+ (e.g., a relatively small object as indicated by a relatively small black or dark spot) are considered to be insignificant and/or otherwise inconsequential to the quality of a scanned image of media object(s) <part-num-ref name="scanned image of media object(s)">18.</part-num-ref>
+ In some embodiments of the present invention, threshold data <part-num-ref name="present invention, threshold data">90</part-num-ref>
+ is also used to evaluate calibration scan information on a scan line-by-scan line basis. For example, in some embodiments of the present invention, threshold data <part-num-ref name="present invention, threshold data">90</part-num-ref>
+ comprises information associated with a threshold value for determining a quantity or level of obstruction from opaque objects within the visible or viewable area defined by scan window <part-num-ref name="visible or viewable area defined by scan window">44</part-num-ref>
+ for a particular scan line of imaging device <part-num-ref name="particular scan line of imaging device">14</part-num-ref>
+ to determine whether the particular scan line produces a desired level of quality for scanning media object(s) <part-num-ref name="desired level of quality for scanning media object(s)">18.</part-num-ref>
+ For example, in some embodiments of the present invention, particular scan lines of optical head <part-num-ref name="present invention, particular scan lines of optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ that meet or exceed a particular threshold value as indicated by threshold data <part-num-ref name="particular threshold value as indicated by threshold data">90</part-num-ref>
+ are considered to be relatively free or minimally obstructed by opaque objects visible through scan window <part-num-ref name="are considered to be relatively free or minimally obstructed by opaque objects visible through scan window">44,</part-num-ref>
+ thereby indicating an acceptable scan line location for optical head <part-num-ref name="acceptable scan line location for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ for scanning media object(s) <part-num-ref name="for scanning media object(s)">18.</part-num-ref>
+ In some embodiments of the present invention, mapping data <part-num-ref name="present invention, mapping data">82</part-num-ref>
+ is used to determine a percent of visible area defined by scan window <part-num-ref name="percent of visible area defined by scan window">44</part-num-ref>
+ that is occluded by opaque object(s) and/or material(s). For example, in some embodiments of the present invention, mapping data <part-num-ref name="present invention, mapping data">82</part-num-ref>
+ is used to determine whether a percent of visible area defined by scan window <part-num-ref name="percent of visible area defined by scan window">44</part-num-ref>
+ that is occluded by opaque object(s) and/or material(s) is acceptable or unacceptable for generating a scanned image.  Thus, embodiments of the present invention enable positioning of optical head <part-num-ref name="present invention enable positioning of optical head">22</part-num-ref>
+ for a scanning procedure to take advantage of identified acceptable scan line locations. However, it should be understood that threshold data <part-num-ref name="scanning procedure to take advantage of identified acceptable scan line locations. However, it should be understood that threshold data">90</part-num-ref>
+ may be otherwise used or formulated for analyzing image information acquired via the calibration scan. Further, in some embodiment of the present invention, a user of system <part-num-ref name="user of system">10</part-num-ref>
+ is notified (e.g., via a display or otherwise) of a percent <page-break num="6"/>
+      <boundary-data type="header">200312594-1</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+of visible area defined by scan window <part-num-ref name="percent of visible area defined by scan window">44</part-num-ref>
+ that is occluded by opaque object(s) and/or material(s), thereby enabling a user of system to evaluate whether to generate a scanned image given the current percent of visible area defined by scan window <part-num-ref name="current percent of visible area defined by scan window">44</part-num-ref>
+ that is occluded by opaque object(s) and/or material(s).    </p>
+    <p id="p-17" num="17">[0015]   History data 91 comprises historical and/or time-based information associated with calibration scan image content. For example, in some embodiments of the present invention, historical data <part-num-ref name="present invention, historical data">91</part-num-ref>
+ comprises information associated with mapping content resulting from calibration scans of calibration strip <part-num-ref name="comprises information associated with mapping content resulting from calibration scans of calibration strip">60</part-num-ref>
+ as a function of time to determine whether changes to the quantity or severity of opaque objects visible by optical head <part-num-ref name="quantity or severity of opaque objects visible by optical head">22</part-num-ref>
+ through scan window <part-num-ref name="through scan window">44</part-num-ref>
+ has increased. Thus, in operation, history data <part-num-ref name="has increased. Thus, in operation, history data">91</part-num-ref>
+ is used to compare object mapping data <part-num-ref name="is used to compare object mapping data">82</part-num-ref>
+ over time. In some embodiments of the present invention, if the quantity or severity of opaque objects visible by optical head through scan window <part-num-ref name="quantity or severity of opaque objects visible by optical head through scan window">44</part-num-ref>
+ has increased beyond a predetermined threshold, as indicated and/or otherwise defined by threshold data <part-num-ref name="predetermined threshold, as indicated and/or otherwise defined by threshold data">90,</part-num-ref>
+ calibration system <part-num-ref name="predetermined threshold, as indicated and/or otherwise defined by threshold data 90, calibration system">40</part-num-ref>
+ is configured to alert and/or otherwise notify a user of system <part-num-ref name="user of system">10</part-num-ref>
+ (e.g., via interface <part-num-ref name="via interface">38)</part-num-ref>
+ of such a condition, thereby indicating to the user that scan window <part-num-ref name="user that scan window">44</part-num-ref>
+ and/or feed strip <part-num-ref name="and/or feed strip">46</part-num-ref>
+ requires cleaning and/or replacement.    </p>
+    <p id="p-18" num="18">[0016<confidence value="5">]</confidence>
+   In the embodiment illustrated in FIGURE 2, calibration data <part-num-ref name="embodiment illustrated in FIGURE 2, calibration data">84</part-num-ref>
+ comprises optical head position data <part-num-ref name="comprises optical head position data">92</part-num-ref>
+ having information associated with least-obstructed scan line location(s) relative to scan window <part-num-ref name="having information associated with least-obstructed scan line location(s) relative to scan window">44</part-num-ref>
+ based on the calibration scan of calibration strip <part-num-ref name="calibration scan of calibration strip">60.</part-num-ref>
+    </p>
+    <p id="p-19" num="19">For example, in operation, based on mapping data 82 acquired using the calibration scan, calibration module <part-num-ref name="calibration scan, calibration module">70</part-num-ref>
+ evaluates a level of obstruction by opaque objects visible by optical head <part-num-ref name="level of obstruction by opaque objects visible by optical head">22</part-num-ref>
+ through scan window <part-num-ref name="through scan window">44</part-num-ref>
+ for one or more scan lines of optical head <part-num-ref name="for one or more scan lines of optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44.</part-num-ref>
+ Thus, in operation, calibration module <part-num-ref name="relative to scan window 44. Thus, in operation, calibration module">70</part-num-ref>
+ identifies or otherwise locates a least-obstructed scan line relative to scan window <part-num-ref name="least-obstructed scan line relative to scan window">44</part-num-ref>
+ for locating optical head <part-num-ref name="for locating optical head">22</part-num-ref>
+ for performing a scan operation of a media object <part-num-ref name="media object">18</part-num-ref>
+ based on object mapping data <part-num-ref name="based on object mapping data">82.</part-num-ref>
+ The particular scan line or location of optical head <part-num-ref name="particular scan line or location of optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ for performing a scanning operation of a media object <part-num-ref name="media object">18</part-num-ref>
+ is stored as optical head position data <part-num-ref name="is stored as optical head position data">92</part-num-ref>
+ such that upon initiating a scan of a media object <part-num-ref name="media object">18,</part-num-ref>
+ calibration module <part-num-ref name="media object 18, calibration module">70</part-num-ref>
+ communicates or otherwise interfaces with controller <part-num-ref name="communicates or otherwise interfaces with controller">36</part-num-ref>
+ to position or locate optical head <part-num-ref name="to position or locate optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ having a least-obstructed view of media object(s) <part-num-ref name="least-obstructed view of media object(s)">18</part-num-ref>
+ based on object mapping data <part-num-ref name="based on object mapping data">82.</part-num-ref>
+    </p>
+    <p id="p-20" num="20">[0017]   In the embodiment illustrated in FIGURE 2, interval data <part-num-ref name="embodiment illustrated in FIGURE 2, interval data">86</part-num-ref>
+ comprises information associated with an interval for performing a calibration scan of scan window <part-num-ref name="calibration scan of scan window">44</part-num-ref>
+ <page-break num="7"/>
+      <boundary-data type="header">200312594<confidence value="58">-1</confidence>
+      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+using calibration strip <part-num-ref name="using calibration strip">60.</part-num-ref>
+ For example, in the embodiment illustrated in FIGURE 2, interval data <part-num-ref name="embodiment illustrated in FIGURE 2, interval data">86</part-num-ref>
+ comprises a calibration interval <part-num-ref name="calibration interval">94</part-num-ref>
+ indicating or otherwise designating a predetermined interval for performing a calibration scan using calibration strip <part-num-ref name="calibration scan using calibration strip">60</part-num-ref>
+ to evaluate scan window <part-num-ref name="to evaluate scan window">44.</part-num-ref>
+ In some embodiments of the present invention, calibration interval <part-num-ref name="present invention, calibration interval">94</part-num-ref>
+ comprises information associated with a predetermined time period (e.g., every thirty minutes), quantity of scans (e.g., fifty scanning passes of optical head <part-num-ref name="fifty scanning passes of optical head">22)</part-num-ref>
+ and/or quantity of media object <part-num-ref name="and/or quantity of media object">18</part-num-ref>
+ feeds (e.g., fifty media object <part-num-ref name="fifty media object">18</part-num-ref>
+ feeds) such that a calibration scan is performed using calibration strip <part-num-ref name="calibration scan is performed using calibration strip">60</part-num-ref>
+ at such predetermined interval. In other embodiments of the present invention, calibration interval <part-num-ref name="present invention, calibration interval">94</part-num-ref>
+ indicates or otherwise designates that a calibration scan is performed before each scan of a media object <part-num-ref name="media object">18</part-num-ref>
+ (e.g., before a scan of a single or multiple media object(s) <part-num-ref name="single or multiple media object(s)">18,</part-num-ref>
+ upon each reboot of imaging system <part-num-ref name="single or multiple media object(s) 18, upon each reboot of imaging system">10</part-num-ref>
+ and/or after being idle for a predetermined period of time). However, it should understood that the interval of performing a calibration scan may be otherwise determined. Additionally, in some embodiments of the present invention, a user may request the performance of a calibration scan via interface <part-num-ref name="calibration scan via interface">38.</part-num-ref>
+    </p>
+    <p id="p-21" num="21">[0018<confidence value="5">]</confidence>
+   Thus, in operation, calibration system 40 interfaces and/or otherwise communicates with controller <part-num-ref name="interfaces and/or otherwise communicates with controller">36</part-num-ref>
+ to perform a calibration scan by turning on light source <part-num-ref name="calibration scan by turning on light source">20</part-num-ref>
+ to illuminate and/or otherwise charge luminescent calibration strip <part-num-ref name="to illuminate and/or otherwise charge luminescent calibration strip">60.</part-num-ref>
+ When calibration strip <part-num-ref name="to illuminate and/or otherwise charge luminescent calibration strip 60. When calibration strip">60</part-num-ref>
+ is sufficiently charged, calibration system <part-num-ref name="is sufficiently charged, calibration system">40</part-num-ref>
+ interfaces and/or otherwise communicates with controller <part-num-ref name="interfaces and/or otherwise communicates with controller">36</part-num-ref>
+ to tu<confidence value="88">rn</confidence>
+ off light source <part-num-ref name="to turn off light source">20</part-num-ref>
+ and performs a calibration scan of at least a portion of scan window <part-num-ref name="portion of scan window">44</part-num-ref>
+ using optical head <part-num-ref name="using optical head">22.</part-num-ref>
+ In operation, using light emitted by calibration strip <part-num-ref name="using optical head 22. In operation, using light emitted by calibration strip">60</part-num-ref>
+ and received by optical head <part-num-ref name="and received by optical head">22</part-num-ref>
+ during the calibration scan, calibration system <part-num-ref name="calibration scan, calibration system">40</part-num-ref>
+ generates object mapping data <part-num-ref name="generates object mapping data">82</part-num-ref>
+ (e.g., via mapping module <part-num-ref name="via mapping module">72)</part-num-ref>
+ indicating the locations of opaque objects visible by optical head <part-num-ref name="locations of opaque objects visible by optical head">22</part-num-ref>
+ through scan window <part-num-ref name="through scan window">44</part-num-ref>
+ (e.g., opaque objects on or within feed strip 46).    </p>
+    <p id="p-22" num="22">[0019]   Using the calibration scan, calibration module <part-num-ref name="calibration scan, calibration module">70</part-num-ref>
+ evaluates object mapping data <part-num-ref name="evaluates object mapping data">82</part-num-ref>
+ to determine and/or otherwise identify scan lines for optical head <part-num-ref name="to determine and/or otherwise identify scan lines for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ for obtaining an optimum view of a media object <part-num-ref name="media object">18</part-num-ref>
+ through scan window <part-num-ref name="through scan window">44</part-num-ref>
+ (e.g., a least-obstructed view of a media object 18). As described above, in some embodiments of the present invention, calibration module <part-num-ref name="present invention, calibration module">70</part-num-ref>
+ accesses and/or otherwise uses threshold data <part-num-ref name="accesses and/or otherwise uses threshold data">90</part-num-ref>
+ to evaluate particular locations and/or scan lines of scan window <part-num-ref name="to evaluate particular locations and/or scan lines of scan window">44</part-num-ref>
+ to determine and/or otherwise identify particular scan lines for optical head <part-num-ref name="to determine and/or otherwise identify particular scan lines for optical head">22</part-num-ref>
+ for performing a <page-break num="8"/>
+      <boundary-data type="header">200312594-1</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+scan operation of a media object <part-num-ref name="media object">18.</part-num-ref>
+ Additionally, in some embodiments of the present invention, threshold data <part-num-ref name="present invention, threshold data">90</part-num-ref>
+ also comprises information associated with object mapping over a predetermined time interval as indicated by history data <part-num-ref name="predetermined time interval as indicated by history data">91</part-num-ref>
+ to determine whether an increase in obstruction to scan window <part-num-ref name="increase in obstruction to scan window">44</part-num-ref>
+ is occurring over the predetermined time interval.    </p>
+    <p id="p-23" num="23">Thus, in operation, if calibration module 70 determines that, over a predetermined time interval, the level of obstruction of scan window <part-num-ref name="level of obstruction of scan window">44</part-num-ref>
+ is increasing based on a series or set of different calibration scans, calibration system <part-num-ref name="series or set of different calibration scans, calibration system">40</part-num-ref>
+ alerts and/or otherwise notifies a user of system <part-num-ref name="user of system">10</part-num-ref>
+ of such condition, thereby notifying and/or otherwise enabling a user to clean or perform another action on system <part-num-ref name="user to clean or perform another action on system">10</part-num-ref>
+ (e.g., clean platen <part-num-ref name="clean platen">30,</part-num-ref>
+ clean feed strip <part-num-ref name="clean platen 30, clean feed strip">46</part-num-ref>
+ and/or replace feed strip 46).    </p>
+    <p id="p-24" num="24">[0020]   FIGURE 3 is a flow diagram illustrating an embodiment of an imaging method in accordance with the present invention. The method begins at block <part-num-ref name="method begins at block">102,</part-num-ref>
+ where a calibration scan is initiated and light source <part-num-ref name="calibration scan is initiated and light source">20</part-num-ref>
+ is turned on. At block <part-num-ref name="is turned on. At block">104,</part-num-ref>
+ light source <part-num-ref name="is turned on. At block 104, light source">20</part-num-ref>
+ is used to charge luminescent calibration strip <part-num-ref name="is used to charge luminescent calibration strip">60.</part-num-ref>
+ At block <part-num-ref name="is used to charge luminescent calibration strip 60. At block">106,</part-num-ref>
+ after a predetermined time interval, light source <part-num-ref name="predetermined time interval, light source">20</part-num-ref>
+ is turned off. At block <part-num-ref name="is turned off. At block">108,</part-num-ref>
+ calibration system <part-num-ref name="is turned off. At block 108, calibration system">40</part-num-ref>
+ performs a calibration scan relative to at least a portion of scan window <part-num-ref name="portion of scan window">44</part-num-ref>
+ using light emitted through scan window <part-num-ref name="using light emitted through scan window">44</part-num-ref>
+ by calibration strip <part-num-ref name="by calibration strip">60</part-num-ref>
+ and received by optical head <part-num-ref name="and received by optical head">22.</part-num-ref>
+    </p>
+    <p id="p-25" num="25">[0021]   At block 110, calibration system 40 generates object mapping data <part-num-ref name="generates object mapping data">82</part-num-ref>
+ based on light received by optical head <part-num-ref name="based on light received by optical head">22</part-num-ref>
+ from calibration strip <part-num-ref name="from calibration strip">60</part-num-ref>
+ during the calibration scan. At block <part-num-ref name="calibration scan. At block">112,</part-num-ref>
+ calibration system <part-num-ref name="calibration scan. At block 112, calibration system">40</part-num-ref>
+ evaluates scan line locations of optical head <part-num-ref name="evaluates scan line locations of optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ using object mapping data <part-num-ref name="using object mapping data">82.</part-num-ref>
+ At decisional block <part-num-ref name="using object mapping data 82. At decisional block">114,</part-num-ref>
+ a determination is made whether the particular scan line is clear or otherwise exceeds a predetermined threshold, as indicated by a threshold data <part-num-ref name="threshold data">90,</part-num-ref>
+ thereby indicating a desired and/or least-obstructed view of media object <part-num-ref name="desired and/or least-obstructed view of media object">18</part-num-ref>
+ during a scan operation. If the particular scan line is clear and/or otherwise exceeds a predetermined threshold, the method proceeds to block <part-num-ref name="method proceeds to block">116,</part-num-ref>
+ where the particular scan line is selected as a location for locating optical head <part-num-ref name="location for locating optical head">22</part-num-ref>
+ for performing a scan of a media object <part-num-ref name="media object">18.</part-num-ref>
+ If, at decisional block <part-num-ref name="media object 18. If, at decisional block">114,</part-num-ref>
+ a determination is made that the particular scan line is not clear or otherwise does not exceed a predetermined threshold indicating an acceptable or desired view of a media object <part-num-ref name="media object">18</part-num-ref>
+ via scan window <part-num-ref name="via scan window">44,</part-num-ref>
+ the method proceeds to <confidence value="2222222222">decisional</confidence>
+ block <part-num-ref name="method proceeds to decisional block">118,</part-num-ref>
+ where a determination is made whether another scan line for optical head <part-num-ref name="determination is made whether another scan line for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ is available. If another scan line for optical head <part-num-ref name="is available. If another scan line for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ is available, the method proceeds to block <part-num-ref name="method proceeds to block">120,</part-num-ref>
+ <page-break num="9"/>
+      <boundary-data type="header">200312594-1</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+where the next or another scan line for optical head <part-num-ref name="next or another scan line for optical head">22</part-num-ref>
+ is selected and analyzed using object mapping data <part-num-ref name="is selected and analyzed using object mapping data">82.</part-num-ref>
+ If another scan line for optical head <part-num-ref name="is selected and analyzed using object mapping data 82. If another scan line for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ is not available, the method proceeds to block <part-num-ref name="method proceeds to block">122,</part-num-ref>
+ where calibration system <part-num-ref name="method proceeds to block 122, where calibration system">40</part-num-ref>
+ determines or otherwise locates a least object-obstructed scan line location using object mapping data <part-num-ref name="least object-obstructed scan line location using object mapping data">82</part-num-ref>
+ for locating optical head <part-num-ref name="for locating optical head">22</part-num-ref>
+ for performing a scan of media object <part-num-ref name="scan of media object">18.</part-num-ref>
+ For example, in some embodiments of the present invention, calibration system <part-num-ref name="present invention, calibration system">40</part-num-ref>
+ may be used to analyze each scan line for optical head <part-num-ref name="may be used to analyze each scan line for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ before locating and/or otherwise identifying a particular scan line for locating optical head <part-num-ref name="particular scan line for locating optical head">22</part-num-ref>
+ for performing a scan of a media object <part-num-ref name="media object">18</part-num-ref>
+ (e.g., using a best-fit type of analysis or other type of comparative analysis method). In other embodiments of the present invention, it may occur that each scan line for optical head <part-num-ref name="present invention, it may occur that each scan line for optical head">22</part-num-ref>
+ relative to scan window <part-num-ref name="relative to scan window">44</part-num-ref>
+ falls below a particular threshold value as indicated by threshold data <part-num-ref name="particular threshold value as indicated by threshold data">90,</part-num-ref>
+ such that calibration system <part-num-ref name="particular threshold value as indicated by threshold data 90, such that calibration system">40</part-num-ref>
+ identifies and/or otherwise selects a least object-obstructed scan line location from the object mapping data <part-num-ref name="object mapping data">82</part-num-ref>
+ for selecting and/or otherwise determining a location for optical head <part-num-ref name="location for optical head">22</part-num-ref>
+ when performing a scan of a media object <part-num-ref name="media object">18.</part-num-ref>
+ The<confidence value="5">'</confidence>
+ method proceeds to block <part-num-ref name="media object 18. The' method proceeds to block">124,</part-num-ref>
+ where calibration system <part-num-ref name="media object 18. The' method proceeds to block 124, where calibration system">40</part-num-ref>
+ selects the least object-obstructed scan line location for optical head <part-num-ref name="least object-obstructed scan line location for optical head">22</part-num-ref>
+ for performing a scan operation of a media object <part-num-ref name="media object">18.</part-num-ref>
+    </p>
+    <p id="p-26" num="26">[0022]   Thus, embodiments of the present invention automatically determine whether opaque objects are disposed within a scan window of an automatic document feeder, which may otherwise cause a streak in a scanned image of a media object, and automatically locate a scan line for an optical head of an imaging device which is least-obstructed by any identified opaque objects for scanning a media object. In some embodiments of the present invention, a calibration scan is performed of the scan window using a luminescent scan strip located in the automatic document feeder to locate and/or otherwise identify any such opaque objects within the scan window. In some embodiments of the present invention, calibration scan information is analyzed over time to determine whether changes to the severity and/or quantity of opaque objects within the scan window have occurred and, if so, notify the user of such a condition. It should also be understood that in other embodiments of the method of the present invention described in FIGURE 3, certain functions may be omitted, combined, or accomplished in a sequence different than depicted in FIGURE 3. Also, it should be understood that the method depicted in FIGURE 3 may be altered to encompass any of the other features or aspects described elsewhere in the specification.</p>
+  </description>
+</us-patent-application>
+

applicant/11174130.xml

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<pat:SpecificationDocument xmlns:pat="urn:us:gov:doc:uspto:patent" xmlns="urn:us:gov:doc:uspto:patent" xmlns:ent="urn:us:gov:doc:uspto:enterprise" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tbl="http://www.oasis-open.org/tables/exchange/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:com="http://www.wipo.int/standards/XMLSchema/Common/1" pat:instanceFileName="11174130.07-06-2015.IBRW4776PXXIFW3.SPEC.xml" pat:id="IBRW4776PXXIFW3" xsi:schemaLocation="urn:us:gov:doc:uspto:patent XMLSchema/V1_3/SpecificationDocument_1_0.xsd">
+<pat:DocumentCode>SPEC</pat:DocumentCode><pat:DocumentHeaderDetails pat:id="ID-00001">
+<pat:ApplicationHeaderDetails><pat:ApplicationNumber>11174130</pat:ApplicationNumber></pat:ApplicationHeaderDetails>
+<pat:PageTotalQuantity>1</pat:PageTotalQuantity>
+<pat:ParagraphTotalQuantity>2</pat:ParagraphTotalQuantity>
+</pat:DocumentHeaderDetails>
+<pat:MailRoomDate>2015-07-06</pat:MailRoomDate>
+<pat:Specification pat:id="Specification">
+<?PageStart number="1"?>
+<pat:BoundaryData><pat:HeaderText>Application No.: 11/174,130                Attorney Docket No.: 1334/US</pat:HeaderText></pat:BoundaryData>
+<pat:BoundaryData><pat:HeaderText>Paper Filed: July 6, 2015                               Page 2 of 15</pat:HeaderText></pat:BoundaryData>
+<pat:BoundaryData><pat:HeaderText>Reply to Final Office Action Mailed January 27, 2015</pat:HeaderText></pat:BoundaryData>
+<pat:P pat:id="p-1" pat:pNumber="1">Amendments to the Specification:</pat:P>
+<pat:P pat:id="p-2" pat:pNumber="2">Please REPLACE the <pat:PartName pat:idref="PN-00001">first unnumbered paragraph on page </pat:PartName><pat:PartNumber pat:id="PN-00001">1</pat:PartNumber> of the specification corresponding to the Title of the Application with the following amended Title:</pat:P>
+<pat:Heading pat:id="h-1">CONTROLLING FUNCTIONS OF A MULTIFUNCTION DEVICE BY ORIENTATION</pat:Heading>
+</pat:Specification></pat:SpecificationDocument>

applicant/11188397.xml

@@ -0,0 +1,26 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11188397</doc-number>
+        <date>2009-03-05</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Serial No. 11/188,397 Amendment and Response to Office Action Mailed December 10, 2008 </p>
+    <heading id="h-1">AMENDMENTS TO THE SPECIFICATION</heading>
+    <p id="p-2" num="2">On page 21, please replace the entire original section entitled "Abstract of the Disclosure" with the following amended section:</p>
+    <heading id="h-2">ABSTRACT OF THE DISCLOSURE</heading>
+    <p id="p-3" num="3">
+      <confidence value="6">.</confidence>
+ An exemplary embodiment of the present invention provides a method that includes using <confidence value="8">a</confidence>
+ computer-executable pro<confidence value="8">g</confidence>
+ram to process information pertaining to an object detected at or near a display to determine a predicted location of the object in the future. The predicted location is used to capture an image of a region of interest on the display that includes the predicted location.    </p>
+    <p id="p-4" num="4">Page 2 of <part-num-ref name="of">25</part-num-ref>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11215420.xml

@@ -0,0 +1,768 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11215420</doc-number>
+        <date>2005-08-30</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">
+      <confidence value="5">"</confidence>
+Express Mail<confidence value="5">"</confidence>
+ Mailing Label No.: EV639807580US Date of Deposit: August 30, 2005 ATTORNEY DOCKET NO. 16660U<confidence value="588">S01</confidence>
+     </p>
+    <heading id="h-1">METHOD AND SYSTEM FOR OPTIMIZED ARCHITECTURE FOR BLUETOOTH</heading>
+    <heading id="h-2">STREAMING AUDIO APPLICATIONS</heading>
+    <heading id="h-3">CROSS-REFERENCE TO RELATED APPLICATIONS/INCORPORATION BY</heading>
+    <heading id="h-4">REFERENCE</heading>
+    <p id="p-2" num="2">[0001]  Not Applicable.</p>
+    <heading id="h-5">FIELD OF THE INVENTION</heading>
+    <p id="p-3" num="3">[0002]  Certain embodiments of the invention relate to Bluetooth enabled devices.</p>
+    <p id="p-4" num="4">More specifically, certain embodiments of the invention relate to a method and system for an optimized architecture for Bluetooth streaming audio applications.</p>
+    <heading id="h-6">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-5" num="5">[0003]  Bluetooth<confidence value="5">®</confidence>
+ wireless technology is set to revolutionize personal connectivity by providing freedom from wired connections. <confidence value="2222222222">Bluetooth®</confidence>
+ is a specification for a small form-factor, low-cost radio solution providing links between mobile computers, mobile phones and other portable and handheld devices.    </p>
+    <p id="p-6" num="6">[0004]  Bluetooth<confidence value="5">®</confidence>
+ wireless technology is an international, open standard for allowing intelligent devices to communicate with each other through wireless, short-range communications. This technology allows any sort of Bluetooth<confidence value="5">®</confidence>
+ compliant device - from computers and cell phones to keyboards and headphones - to make its own connections, without wires, cables or <confidence value="5">.</confidence>
+any direct action from a user. <confidence value="2222222222">Bluetooth®</confidence>
+ is currently incorporated into numerous commercial products including laptops, PDAs, cell phones, and printers, with more products coming out every day.    </p>
+    <p id="p-7" num="7">[0005]  Bluetooth devices, such as mobile phones and PDAs, are evolving to become more complex as such devices may be adapted to transmit and receive audio <boundary-data type="header">
+        <confidence value="5">1</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+information. For example, a Bluetooth<confidence value="5">®</confidence>
+ device may utilize a coder/decoder (CODEC) to encode audio information prior to communicating the encoded information to another <confidence value="2222222222">Bluetooth®</confidence>
+ device, for example. Similarly, the CODEC may be utilized to decode encoded audio information received from another Bluetooth<confidence value="5">®</confidence>
+ device.    </p>
+    <p id="p-8" num="8">[0006]  In conventional Bluetooth<confidence value="5">®</confidence>
+ enabled handheld devices having an integrated <confidence value="2222222222">Bluetooth®</confidence>
+ chip, the low-complexity sub-band CODEC (SBC) encoder runs on the handheld's main processor. As a result, the Bluetooth<confidence value="5">®</confidence>
+ encoding process utilizes valuable main processor resources, which may otherwise be utilized for handling other tasks being run on the handheld device. In these conventional handheld devices, such as cellular telephones, the handheld device must have sufficient additional processing power to handle tasks associated with encoding SBC audio. As a result of this requirement, cheaper handheld devices that lack adequate processing power are eliminated from ever handling SBC audio encoding. The same is true for other CODECs other than SBC that may be utilized for Bluetooth<confidence value="68">®.</confidence>
+    </p>
+    <p id="p-9" num="9">[0007]  Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.</p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <heading id="h-7">BRIEF SUMMARY OF THE INVENTION</heading>
+    <p id="p-10" num="10">
+      <page-break num="3"/>
+[0008]  A system and/or method is provided for an optimized architecture for Bluetooth streaming audio applications, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.    </p>
+    <p id="p-11" num="11">[0009]  These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.</p>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <heading id="h-8">BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS</heading>
+    <p id="p-12" num="12">
+      <page-break num="4"/>
+      <confidence value="5">[</confidence>
+0010] FIG. 1 is a diagram illustrating some examples of Bluetooth<confidence value="5">®</confidence>
+ (BT) streaming audio devices.    </p>
+    <p id="p-13" num="13">[0011]  FIG. 2 is a simplified exemplary protocol stack.</p>
+    <p id="p-14" num="14">[0012]  FIG. 3 is a block diagram illustrating an exemplary Bluetooth<confidence value="5">®</confidence>
+ hardware implementation.    </p>
+    <p id="p-15" num="15">[0013]  FIG. 4 is a block diagram illustrating a Bluetooth<confidence value="5">®</confidence>
+ protocol stack for streaming audio.    </p>
+    <p id="p-16" num="16">[0014]  FIG. 5A is a block diagram illustrating AVDTP features.</p>
+    <p id="p-17" num="17">[0015] FIG. 5B is a block diagram illustrating an exemplary hardware implementation for streaming audio playback, in accordance with an embodiment of the invention.</p>
+    <p id="p-18" num="18">[0016]  FIG. 6 is a block diagram illustrating audio signal processing within a <confidence value="2222222222">Bluetooth®</confidence>
+ enabled host device, in accordance with an embodiment of the invention.    </p>
+    <p id="p-19" num="19">[0017]  FIG. 7 is a block diagram of exemplary Bluetooth<confidence value="5">®</confidence>
+ protocol stack, in accordance with an embodiment of the invention.    </p>
+    <p id="p-20" num="20">[0018]  FIG. 8 is a block diagram illustrating audio signal compression within a <confidence value="2222222222">Bluetooth®</confidence>
+ transceiver, in accordance with an embodiment of the invention.    </p>
+    <p id="p-21" num="21">[0019]  FIG. 9 is a block diagram of exemplary Bluetooth<confidence value="5">®</confidence>
+ transceiver utilizing audio signal compression, in accordance with an embodiment of the invention.    </p>
+    <p id="p-22" num="22">
+      <confidence value="5">[</confidence>
+0020] FIG. 10 is a flow diagram illustrating exemplary steps for processing data within a Bluetooth<confidence value="5">®</confidence>
+ device, in accordance with an embodiment of the invention.    </p>
+    <boundary-data type="header">
+      <confidence value="8">4</confidence>
+    </boundary-data>
+    <heading id="h-9">DETAILED DESCRIPTION OF THE INVENTION</heading>
+    <p id="p-23" num="23">
+      <page-break num="5"/>
+[0021]  Certain embodiments of the invention may be found in a method and system for optimized architecture for Bluetooth streaming audio applications. One aspect of the invention provides streaming audio over Bluetooth<confidence value="5">®</confidence>
+ to a Bluetooth<confidence value="5">®</confidence>
+ enabled device. In this regard, the optimized architecture utilizes the Bluetooth<confidence value="5">®</confidence>
+ chip, which may be integrated in a Bluetooth<confidence value="5">®</confidence>
+ enabled device, to directly handle SBC encoding of audio data. Since SBC encoding is done directly within the Bluetooth<confidence value="5">®</confidence>
+ enabled device, the resulting internally encoded audio data may be directly interfaced via the Bluetooth<confidence value="5">®</confidence>
+ protocol to externally enabled Bluetooth<confidence value="5">®</confidence>
+ devices, such as a Bluetooth<confidence value="5">®</confidence>
+ headset or to internal devices with the handset.    </p>
+    <p id="p-24" num="24">[0022]  In another embodiment of the invention, in this configuration, the Bluetooth<confidence value="5">®</confidence>
+ chip may provide hardware acceleration of the SBC encoding process. The Bluetooth<confidence value="5">®</confidence>
+ chip may be adapted to receive input audio signals from a standard pulse code modulation (PCM) wired CODEC interface such as a standard hardware stereo PCM interface. The Bluetooth<confidence value="5">®</confidence>
+ chip may accelerate SBC encoding of the input audio signals in hardware, rather than software, thereby freeing up processing resources that would normally be utilized for SBC audio encoding by a main processor.    </p>
+    <p id="p-25" num="25">[0023]  FIG. <confidence value="5">1</confidence>
+ is a diagram illustrating some examples of Bluetooth<confidence value="5">®</confidence>
+ (BT) streaming audio devices. Referring to FIG. 1, there is shown a stereo headset <part-num-ref name="stereo headset">104,</part-num-ref>
+ a mobile phone <part-num-ref name="mobile phone">106,</part-num-ref>
+ a Bluetooth<confidence value="5">®</confidence>
+-enabled stereo system <part-num-ref name="Bluetooth®-enabled stereo system">108,</part-num-ref>
+ personal computers (PC) <part-num-ref name="Bluetooth®-enabled stereo system 108, personal computers (PC)">110</part-num-ref>
+ and <part-num-ref name="and">102,</part-num-ref>
+ and stereo speakers 102a and 102b. The stereo headset <part-num-ref name="stereo headset">104</part-num-ref>
+ may receive streaming audio from MP3 files stored on the mobile phone <part-num-ref name="mobile phone">106.</part-num-ref>
+ The headset <part-num-ref name="headset">104</part-num-ref>
+ may also function as a normal Bluetooth<confidence value="5">®</confidence>
+ telephony headset for phone calls. The Bluetooth<confidence value="5">®</confidence>
+-enabled stereo system <part-num-ref name="Bluetooth®-enabled stereo system">108</part-num-ref>
+ may receive streaming audio from MP3 files stored on the PC <part-num-ref name="PC">110,</part-num-ref>
+ solving the problem of how to get the MP3's from the PC <part-num-ref name="PC">110</part-num-ref>
+ to the stereo system <part-num-ref name="stereo system">108.</part-num-ref>
+ The PC <part-num-ref name="PC">102</part-num-ref>
+ may play stereo audio to the pair of Bluetooth<confidence value="5">®</confidence>
+ wireless speakers 102a and 102b, thus freeing the desktop from wired clutter.    </p>
+    <p id="p-26" num="26">[0024]  The Bluetooth<confidence value="5">®</confidence>
+ protocol utilizes a frequency hopping spread spectrum (FHSS) radio system operating in the 2.4 GHz unlicensed band. Its low power transmissions allow a typical range of about <part-num-ref name="typical range of about">10</part-num-ref>
+ meters. Devices may connect to each <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+other to form a network known as a piconet, with up to seven active devices in the piconet. The maximum data throughput between devices may be between 2.0 and 3.0 megabits per second (Mbps), with the data capacity shared between devices on the piconet.    </p>
+    <p id="p-27" num="27">
+      <confidence value="5">[</confidence>
+0025]  The Bluetooth<confidence value="5">®</confidence>
+ protocol utilizes a protocol stack to transfer data and to implement various advanced features that may be required by various applications.    </p>
+    <p id="p-28" num="28">The Bluetooth<confidence value="5">®</confidence>
+ protocol stack may comprise a plurality of different protocols designed for different purposes. Various profiles, or applications, may reside above the protocol stack, and utilize the services that are offered by the Bluetooth<confidence value="5">®</confidence>
+ protocol stack. The <confidence value="2222222222">Bluetooth®</confidence>
+ protocol may also comprise a lower protocol stack for link management and baseband control.    </p>
+    <p id="p-29" num="29">[0026]  One or more of the protocols within the Bluetooth<confidence value="5">®</confidence>
+ protocol stack, may reside within a host device, such as a Bluetooth<confidence value="5">®</confidence>
+ enabled device. Other protocols within the <confidence value="2222222222">Bluetooth®</confidence>
+ protocol stack, such as protocols within the lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack, may reside within the Bluetooth<confidence value="5">®</confidence>
+ chip. In this regard, SBC encoding, or compression of audio data may be transferred from the upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack to the lower <confidence value="2222222222">Bluetooth®</confidence>
+ protocol stack residing on the Bluetooth<confidence value="5">®</confidence>
+ chip. Consequently, processing resources handled by a host processor within the Bluetooth<confidence value="5">®</confidence>
+ enabled device may be freed and allocated for other purposes.    </p>
+    <p id="p-30" num="30">[0027]  FIG. 2 is a simplified exemplary protocol stack. Referring to FIG. 2, there is illustrated an exemplary Bluetooth<confidence value="5">®</confidence>
+ protocol stack <part-num-ref name="exemplary Bluetooth® protocol stack">201.</part-num-ref>
+ The exemplary Bluetooth<confidence value="5">®</confidence>
+ protocol stack <part-num-ref name="exemplary Bluetooth® protocol stack">201</part-num-ref>
+ may comprise profiles layer <part-num-ref name="may comprise profiles layer">202,</part-num-ref>
+ Bluetooth<confidence value="5">®</confidence>
+ management entity (BTM) layer <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer">204,</part-num-ref>
+ radio frequency communication (RFCOMM) protocol <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer 204, radio frequency communication (RFCOMM) protocol">206,</part-num-ref>
+ audio/video distribution transport protocol (AVDTP) <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer 204, radio frequency communication (RFCOMM) protocol 206, audio/video distribution transport protocol (AVDTP)">207,</part-num-ref>
+ service discovery protocol (SDP) <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer 204, radio frequency communication (RFCOMM) protocol 206, audio/video distribution transport protocol (AVDTP) 207, service discovery protocol (SDP)">208,</part-num-ref>
+ logical link control and adaptation protocol (L2CAP) <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer 204, radio frequency communication (RFCOMM) protocol 206, audio/video distribution transport protocol (AVDTP) 207, service discovery protocol (SDP) 208, logical link control and adaptation protocol (L2CAP)">210,</part-num-ref>
+ host controller interface (H<confidence value="588">CI)</confidence>
+ <part-num-ref name="may comprise profiles layer 202, Bluetooth® management entity (BTM) layer 204, radio frequency communication (RFCOMM) protocol 206, audio/video distribution transport protocol (AVDTP) 207, service discovery protocol (SDP) 208, logical link control and adaptation protocol (L2CAP) 210, host controller interface (HCI)">212,</part-num-ref>
+ and a lower stack <part-num-ref name="lower stack">214.</part-num-ref>
+ The profiles layer <part-num-ref name="profiles layer">202</part-num-ref>
+ may comprise profiles of one or more applications that may be utilized in connection with the Bluetooth<confidence value="5">®</confidence>
+ protocol stack.    </p>
+    <p id="p-31" num="31">The BTM layer 204 makes it possible for various equipment to have wireless communication by integrating with a Bluetooth<confidence value="5">®</confidence>
+ module. The RFCOMM protocol <part-num-ref name="RFCOMM protocol">206</part-num-ref>
+ may be utilized to provide emulation of RS-232 serial ports over the L2CAP protocol, <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+providing both transport capabilities for upper level services, such as OBEX, that use serial line as the transport mechanism.    </p>
+    <p id="p-32" num="32">[0028]  The SDP <part-num-ref name="SDP">208</part-num-ref>
+ may be utilized for querying Bluetooth<confidence value="5">®</confidence>
+ device information, <confidence value="2222222222">Bluetooth®</confidence>
+ device services, and characteristics of the services. The L2CAP <part-num-ref name="L2CAP">210</part-num-ref>
+ may be utilized to support higher level protocol multiplexing, packet segmentation and reassembly, and quality of service (QoS). L2CAP <part-num-ref name="may be utilized to support higher level protocol multiplexing, packet segmentation and reassembly, and quality of service (QoS). L2CAP">210</part-num-ref>
+ may permit higher-level protocols and applications to transmit and receive data packets up to <part-num-ref name="may permit higher-level protocols and applications to transmit and receive data packets up to">64</part-num-ref>
+ kilobytes in length. The HCI <part-num-ref name="HCI">212</part-num-ref>
+ may be adapted to provide a command interface to the baseband controller, link manager, and access to hardware status and control registers.    </p>
+    <p id="p-33" num="33">[0029]  The Audio<confidence value="66">/V</confidence>
+ideo Distribution Transport Protocol (AVDTP) <part-num-ref name="Audio/Video Distribution Transport Protocol (AVDTP)">207</part-num-ref>
+ is the protocol designed especially for Bluetooth<confidence value="5">®</confidence>
+ streaming audio and video. It may perform the signaling that may be utilized to configure, open, and/or close a stream between two <confidence value="2222222222">Bluetooth®</confidence>
+ devices. An Audio stream data may be transferred utilizing real-time protocol (RTP) packets. AVDTP resides in the protocol stack above L2CAP and may utilize separate L2CAP channels for signaling and data.    </p>
+    <p id="p-34" num="34">[0030]  The lower stack <part-num-ref name="lower stack">214</part-num-ref>
+ may comprise a link manager protocol (LMP) <part-num-ref name="link manager protocol (LMP)">215</part-num-ref>
+ and a link controller (LC) <part-num-ref name="link controller (LC)">217.</part-num-ref>
+ The link manager (LM) <part-num-ref name="link manager (LM)">215</part-num-ref>
+ may be adapted to carry out link setup, authentication, link configuration and other protocols. The link manager <part-num-ref name="link manager">215</part-num-ref>
+ may also discover other remote LM<confidence value="5">'</confidence>
+s and communicates with them via the LMP. To perform its service provider role, the LM <part-num-ref name="LM">215</part-num-ref>
+ may utilize the underlying Link Controller (LC) <part-num-ref name="underlying Link Controller (LC)">217.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">The LMP essentially comprises a number of protocol data units (PDUs), which may be sent from one device to another, determined by an address in the packet header, for example. The LMP <part-num-ref name="LMP">215</part-num-ref>
+ may control the communication between various Bluetooth<confidence value="5">®</confidence>
+ enabled devices, such as a phone and a PC.    </p>
+    <p id="p-36" num="36">[0031]  The LC <part-num-ref name="LC">217</part-num-ref>
+ within the lower stack <part-num-ref name="lower stack">214</part-num-ref>
+ may be adapted to handle Bluetooth<confidence value="5">®</confidence>
+ baseband functions, such as encoding of voice and/or data packets, error correction, slot delimitation, frequency hopping, radio interface, data encryption, and/or link authentication. In addition, the LC <part-num-ref name="LC">217</part-num-ref>
+ may be adapted to execute link management software associated with the LMP <part-num-ref name="LMP">215.</part-num-ref>
+ The link manager's control may include setting up the communication link and performing authentication, configuration, and other <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+protocols, for example. In an exemplary embodiment of the invention, the lower stack <part-num-ref name="lower stack">214</part-num-ref>
+ may comprise an advanced audio distribution profile (A2DP) utilizing SBC encoding or compression. In this regard, the A2DP implemented within the lower stack <part-num-ref name="lower stack">214</part-num-ref>
+ may be adapted to handle audio data formatting, such as compression or encoding.    </p>
+    <p id="p-37" num="37">[0032]  Bluetooth<confidence value="5">®</confidence>
+ hardware implementations are typically highly integrated systems consisting of one or two chips. FIG. 3 is a block diagram illustrating an exemplary <confidence value="2222222222">Bluetooth®</confidence>
+ hardware implementation. Referring to FIG. 3, the Bluetooth<confidence value="5">®</confidence>
+ hardware implementation may comprise a Bluetooth<confidence value="5">®</confidence>
+ baseband integrated circuit (IC) <part-num-ref name="Bluetooth® baseband integrated circuit (IC)">305</part-num-ref>
+ and a radio IC <part-num-ref name="radio IC">301.</part-num-ref>
+ The radio IC <part-num-ref name="radio IC">301</part-num-ref>
+ may comprise a Bluetooth<confidence value="5">®</confidence>
+ radio circuit <part-num-ref name="Bluetooth® radio circuit">303.</part-num-ref>
+ The baseband IC <part-num-ref name="baseband IC">305</part-num-ref>
+ may comprise Bluetooth<confidence value="5">®</confidence>
+ baseband circuit <part-num-ref name="may comprise Bluetooth® baseband circuit">307,</part-num-ref>
+ processor <part-num-ref name="may comprise Bluetooth® baseband circuit 307, processor">309,</part-num-ref>
+ random access memory (RAM) <part-num-ref name="may comprise Bluetooth® baseband circuit 307, processor 309, random access memory (RAM)">311,</part-num-ref>
+ read only memory (ROM) <part-num-ref name="may comprise Bluetooth® baseband circuit 307, processor 309, random access memory (RAM) 311, read only memory (ROM)">313,</part-num-ref>
+ voice CODEC <part-num-ref name="may comprise Bluetooth® baseband circuit 307, processor 309, random access memory (RAM) 311, read only memory (ROM) 313, voice CODEC">321,</part-num-ref>
+ a serial peripheral interface (SPI) <part-num-ref name="serial peripheral interface (SPI)">319,</part-num-ref>
+ universal serial bus (USB) <part-num-ref name="serial peripheral interface (SPI) 319, universal serial bus (USB)">317,</part-num-ref>
+ and universal asynchronous receiver/transmitter (UART) <part-num-ref name="serial peripheral interface (SPI) 319, universal serial bus (USB) 317, and universal asynchronous receiver/transmitter (UART)">315.</part-num-ref>
+ The radio IC <part-num-ref name="radio IC">301</part-num-ref>
+ may be implemented in a separate chip. The processor <part-num-ref name="processor">309</part-num-ref>
+ may be adapted to operate all the required software including lower stack, upper stack, and embedded profile, for example. This type of single CPU implementation allows for a small, low power, and low cost solution.    </p>
+    <p id="p-38" num="38">[0033]  The <part-num-ref name="">723</part-num-ref>
+ kbps throughput of a Bluetooth<confidence value="5">®</confidence>
+ link may be suitable for streaming audio utilizing MP3 and/or other codec formats. <confidence value="2222222222">Bluetooth®</confidence>
+ streaming audio may be defined by three Bluetooth<confidence value="5">®</confidence>
+ specifications covering the protocol and profiles comprising AVDTP, GAVDP, and A2DP. The Audio/Video Distribution Transport Protocol (AVDTP) is the protocol designed especially for Bluetooth<confidence value="5">®</confidence>
+ streaming audio and video. It may perform the signaling that may be utilized to configure, open, and/or close a stream between two Bluetooth<confidence value="5">®</confidence>
+ devices. An Audio stream data may be transferred utilizing real-time protocol (RTP) packets. AVDTP resides in the protocol stack above L2CAP and may utilize separate L2CAP channels for signaling and data.    </p>
+    <p id="p-39" num="39">[0034]  The Generic Audio/Video Distribution Profile (GAVDP) is an abstract profile that defines how applications can use AVDTP. The Advanced Audio Distribution Profile (A2DP) defines how Bluetooth<confidence value="5">®</confidence>
+ streaming audio applications may operate. For example, A2DP defines how to get and set audio CODEC parameters for MPEG and/or other codecs. The A2DP may also define the media payload formats for packaging <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+audio stream data into packets and may contain the specification for the low-complexity sub-band CODEC (SBC). In this regard, the SBC may be implemented on-chip within the Bluetooth<confidence value="5">®</confidence>
+ baseband IC <part-num-ref name="Bluetooth® baseband IC">305</part-num-ref>
+ and may be used for audio data compression of uncompressed data received from the radio IC <part-num-ref name="radio IC">301.</part-num-ref>
+ For example, the SBC may be implemented within the processor <part-num-ref name="processor">309</part-num-ref>
+ or may be implemented outside the processor <part-num-ref name="processor">309,</part-num-ref>
+ as a separate compression acceleration block.    </p>
+    <p id="p-40" num="40">[0035]  FIG. 4 is a block diagram illustrating a Bluetooth<confidence value="5">®</confidence>
+ protocol stack for streaming audio. Referring to FIG. 4, the Bluetooth<confidence value="5">®</confidence>
+ protocol stack for streaming audio <part-num-ref name="Bluetooth® protocol stack for streaming audio">401</part-num-ref>
+ may comprise A2DP <part-num-ref name="may comprise A2DP">402,</part-num-ref>
+ Bluetooth<confidence value="5">®</confidence>
+ management entity (BTM) protocol <part-num-ref name="may comprise A2DP 402, Bluetooth® management entity (BTM) protocol">404,</part-num-ref>
+ GAVDP/AVDTP <part-num-ref name="may comprise A2DP 402, Bluetooth® management entity (BTM) protocol 404, GAVDP/AVDTP">406,</part-num-ref>
+ service discovery protocol (SDP) <part-num-ref name="may comprise A2DP 402, Bluetooth® management entity (BTM) protocol 404, GAVDP/AVDTP 406, service discovery protocol (SDP)">408,</part-num-ref>
+ logical link control and adaptation protocol (L2CAP) <part-num-ref name="may comprise A2DP 402, Bluetooth® management entity (BTM) protocol 404, GAVDP/AVDTP 406, service discovery protocol (SDP) 408, logical link control and adaptation protocol (L2CAP)">410,</part-num-ref>
+ host controller interface (H<confidence value="54">CI</confidence>
+) <part-num-ref name="may comprise A2DP 402, Bluetooth® management entity (BTM) protocol 404, GAVDP/AVDTP 406, service discovery protocol (SDP) 408, logical link control and adaptation protocol (L2CAP) 410, host controller interface (HCI)">412,</part-num-ref>
+ and a lower stack <part-num-ref name="lower stack">414.</part-num-ref>
+ In addition to the Bluetooth<confidence value="5">®</confidence>
+ specifications illustrated on FIG. 4, there are several ISO<confidence value="5">/</confidence>
+IEC and Internet RFC specifications used for Bluetooth<confidence value="5">®</confidence>
+ streaming audio, which are summarized in Table <part-num-ref name="Bluetooth® specifications illustrated on FIG. 4, there are several ISO/IEC and Internet RFC specifications used for Bluetooth® streaming audio, which are summarized in Table">1.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">Specification           Descri<confidence value="5">p</confidence>
+tion ISO/<confidence value="686">IEC</confidence>
+ 11172 <confidence value="8">p</confidence>
+art <part-num-ref name="part">3</part-num-ref>
+  MPEG audio ISO/<confidence value="686">IEC</confidence>
+ <part-num-ref name="MPEG audio ISO/IEC">13818</part-num-ref>
+ <confidence value="8">p</confidence>
+art <part-num-ref name="part">3</part-num-ref>
+  MPEG audio ISO/<confidence value="686">IEC</confidence>
+ <part-num-ref name="MPEG audio ISO/IEC">13818</part-num-ref>
+ <confidence value="8">p</confidence>
+art <part-num-ref name="part">7</part-num-ref>
+  MPEG advanced audio ISO/<confidence value="686">IEC</confidence>
+ <part-num-ref name="MPEG advanced audio ISO/IEC">14496</part-num-ref>
+ <confidence value="8">p</confidence>
+art <part-num-ref name="part">3</part-num-ref>
+  MPEG advanced audio RFC <part-num-ref name="MPEG advanced audio RFC">1889</part-num-ref>
+            Real-time <confidence value="8">p</confidence>
+rotocol <confidence value="5">(</confidence>
+RTP<confidence value="5">)</confidence>
+ RFC <part-num-ref name="Real-time protocol (RTP) RFC">2733</part-num-ref>
+            RTP error correction RFC <part-num-ref name="RTP error correction RFC">3095</part-num-ref>
+            Packet header com<confidence value="8">p</confidence>
+ression RFC <part-num-ref name="Packet header compression RFC">2250</part-num-ref>
+            RTP payload format RFC <part-num-ref name="RTP payload format RFC">3016</part-num-ref>
+            RTP payload format RFC <part-num-ref name="RTP payload format RFC">3119</part-num-ref>
+            RTP payload format Table <part-num-ref name="RTP payload format Table">1.</part-num-ref>
+ Additional specifications used for Bluetooth<confidence value="5">®</confidence>
+ streaming audio [0036]  The A2DP <part-num-ref name="A2DP">402</part-num-ref>
+ may comprise a <confidence value="885">low</confidence>
+-complexity sub-band CODEC (SBC) <part-num-ref name="low-complexity sub-band CODEC (SBC)">403.</part-num-ref>
+    </p>
+    <p id="p-42" num="42">The SBC 403 may be utilized for audio data compression, or encoding of uncompressed data received from a Bluetooth<confidence value="5">®</confidence>
+ radio, for example.    </p>
+    <p id="p-43" num="43">[0037] The bulk of the Bluetooth<confidence value="5">®</confidence>
+ streaming A<confidence value="66">/V</confidence>
+ system may be implemented in the AVDTP protocol. FIG. 5A is a block diagram illustrating AVDTP features. Referring to FIG. 5A, the AVDTP may comprise a portion of the Bluetooth<confidence value="5">®</confidence>
+ protocol stack <part-num-ref name="Bluetooth® protocol stack">501</part-num-ref>
+ located below a Bluetooth<confidence value="5">®</confidence>
+ protocol profile <part-num-ref name="Bluetooth® protocol profile">503,</part-num-ref>
+ such as an A2DP, and may be divided <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+into four subsystems: signaling <part-num-ref name="A2DP, and may be divided into four subsystems: signaling">502,</part-num-ref>
+ stream management <part-num-ref name="A2DP, and may be divided into four subsystems: signaling 502, stream management">504,</part-num-ref>
+ recovery <part-num-ref name="A2DP, and may be divided into four subsystems: signaling 502, stream management 504, recovery">506,</part-num-ref>
+ and adaptation layer <part-num-ref name="A2DP, and may be divided into four subsystems: signaling 502, stream management 504, recovery 506, and adaptation layer">508.</part-num-ref>
+ AVDTP signaling messages <part-num-ref name="A2DP, and may be divided into four subsystems: signaling 502, stream management 504, recovery 506, and adaptation layer 508. AVDTP signaling messages">502</part-num-ref>
+ are used to discover, configure, open, and close a stream between two Bluetooth<confidence value="5">®</confidence>
+ enabled devices. There are eleven message types with some messages being optional.    </p>
+    <p id="p-44" num="44">[0038]  A media transport feature of the stream manager <part-num-ref name="stream manager">504</part-num-ref>
+ may be utilized to transfer RTP packets containing audio data. This feature is a required feature of AVDTP. The reporting feature of the stream manager <part-num-ref name="stream manager">504</part-num-ref>
+ may allow link quality information, such as jitter and packet loss, to be exchanged utilizing the protocols defined in RFC <part-num-ref name="protocols defined in RFC">1889.</part-num-ref>
+ This is an optional feature. The recovery feature <part-num-ref name="recovery feature">506</part-num-ref>
+ adds extra packets containing error correction data to the packet transfer. This feature may allow for lost packets to be recovered. The recovery mechanism is defined by RFC <part-num-ref name="recovery mechanism is defined by RFC">2733.</part-num-ref>
+    </p>
+    <p id="p-45" num="45">This is an optional feature and may require additional ROM and/or RAM.</p>
+    <p id="p-46" num="46">[0039]  A header compression feature of the adaptation layer <part-num-ref name="adaptation layer">508</part-num-ref>
+ allows the RTP header to be compressed, as defined by RFC <part-num-ref name="RTP header to be compressed, as defined by RFC">3095.</part-num-ref>
+ When used with AVDTP, the RTP header may be reduced by <part-num-ref name="RTP header may be reduced by">5</part-num-ref>
+ to <part-num-ref name="to">7</part-num-ref>
+ bytes. This savings may probably not be worth the effort of implementing the feature especially when large media packets are used. A multiplexing feature of the AVDTP adaptation layer <part-num-ref name="AVDTP adaptation layer">508</part-num-ref>
+ allows L2CAP channels to be shared by media, reporting, and/or recovery packets, therefore resulting in fewer L2CAP channels and better baseband channel capacity utilization. This complex feature may be useful for devices that use multiple simultaneous streams with reporting and recovery.    </p>
+    <p id="p-47" num="47">[0040]  In an exemplary embodiment of the invention, the AVDTP may also utilize data formatting functionalities. For example, the AVDTP may utilize an audio data formatting functionality within the stream manager <part-num-ref name="stream manager">504.</part-num-ref>
+ The formatting functionality may be used in accordance with on-chip compression of audio data via an SBC, for example. In this regard, the stream manager <part-num-ref name="stream manager">504</part-num-ref>
+ may establish data formatting parameters, such as compression parameters for compressing audio data, and an SBC implemented within a Bluetooth<confidence value="5">®</confidence>
+ baseband IC may be used for audio data compression. Compressed audio data may then be communicated to a peer <confidence value="2222222222">Bluetooth®</confidence>
+ enabled device.    </p>
+    <boundary-data type="header">
+      <confidence value="88">10</confidence>
+    </boundary-data>
+    <p id="p-48" num="48">
+      <page-break num="11"/>
+[0041]  FIG. <confidence value="5">5</confidence>
+B is a block diagram illustrating an exemplary hardware implementation for streaming audio playback, in accordance with an embodiment of the invention.    </p>
+    <p id="p-49" num="49">Referring to FIG. 5B, the B<confidence value="5">l</confidence>
+uetooth<confidence value="2">@</confidence>
+ hardware implementation for streaming audio playback may comprise a Bluetooth<confidence value="5">®</confidence>
+ baseband integrated circuit (IC) <part-num-ref name="Bluetooth® baseband integrated circuit (IC)">525,</part-num-ref>
+ a radio IC <part-num-ref name="radio IC">521,</part-num-ref>
+ and an audio IC <part-num-ref name="audio IC">543.</part-num-ref>
+ The radio IC <part-num-ref name="radio IC">521</part-num-ref>
+ may comprise a Bluetooth<confidence value="5">®</confidence>
+ radio circuit <part-num-ref name="Bluetooth® radio circuit">523.</part-num-ref>
+ The audio IC <part-num-ref name="audio IC">543</part-num-ref>
+ may comprise an MP3 decoder <part-num-ref name="MP3 decoder">545</part-num-ref>
+ and a stereo codec circuit <part-num-ref name="stereo codec circuit">547.</part-num-ref>
+ The baseband IC <part-num-ref name="baseband IC">525</part-num-ref>
+ may comprise Bluetooth<confidence value="5">®</confidence>
+ baseband circuit <part-num-ref name="may comprise Bluetooth® baseband circuit">527,</part-num-ref>
+ the processor <part-num-ref name="processor">529,</part-num-ref>
+ random access memory (RAM) <part-num-ref name="processor 529, random access memory (RAM)">531,</part-num-ref>
+ read only memory (ROM) <part-num-ref name="processor 529, random access memory (RAM) 531, read only memory (ROM)">533,</part-num-ref>
+ voice codec <part-num-ref name="processor 529, random access memory (RAM) 531, read only memory (ROM) 533, voice codec">541,</part-num-ref>
+ a serial peripheral interface (SPI) <part-num-ref name="serial peripheral interface (SPI)">539,</part-num-ref>
+ universal serial bus (USB) <part-num-ref name="serial peripheral interface (SPI) 539, universal serial bus (USB)">537,</part-num-ref>
+ and universal asynchronous receiver/transmitter (UART) <part-num-ref name="serial peripheral interface (SPI) 539, universal serial bus (USB) 537, and universal asynchronous receiver/transmitter (UART)">535.</part-num-ref>
+ The radio IC <part-num-ref name="radio IC">521</part-num-ref>
+ and the audio IC <part-num-ref name="audio IC">543</part-num-ref>
+ may be implemented in separate chips. The processor <part-num-ref name="processor">529</part-num-ref>
+ may be adapted to operate all the required software including lower stack, upper stack, and embedded profile, for example. Data received over the Bluetooth<confidence value="5">®</confidence>
+ link may be processed by the protocol stack and passed to an application. The application may acquire the audio stream data and may communicate it over a hardware interface to the audio IC <part-num-ref name="audio IC">543.</part-num-ref>
+ The audio IC <part-num-ref name="audio IC">543</part-num-ref>
+ may decode the digital audio and may convert the audio signal to analog signal.    </p>
+    <p id="p-50" num="50">[0042]  Implementing AVDTP with the minimum required features may require multiple streams support. For the simple streaming audio device examples shown in FIG. 1, optional features such as recovery, reporting, header compression, and multiplexing may not be required as Bluetooth<confidence value="5">®</confidence>
+ devices may be adapted to perform adequately without such features.    </p>
+    <p id="p-51" num="51">[0043]  Maintaining a data transfer with a constant bit rate on a Bluetooth<confidence value="5">®</confidence>
+ link may be difficult to achieve. If data is sent too slowly, the audio decoder may run out of stream data to process, causing an audible error. Lost data packets may also cause the same problem. On the other hand, if data is sent too quickly, then data may be buffered up at the audio decoder, eventually causing congestion or data loss when the device runs out of buffer space. Since there is no flow control mechanism built into AVDTP or L2CAP, other mechanisms may be utilized to prevent data loss. The mechanism used by the audio source, or device sending the stream, may depend on the type of source. If the source is "live" and audio stream data is provided by an audio <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+encoder, then the encoder itself may provide the constant bit rate. If the source is from a file, then a timer may be utilized to maintain a constant bit rate.    </p>
+    <p id="p-52" num="52">[00<confidence value="66">44</confidence>
+]  To understand the idea behind using a timer, consider this example. A device is sending an MP3 stream from a file encoded at <part-num-ref name="file encoded at">128</part-num-ref>
+ kbps and <part-num-ref name="kbps and">48</part-num-ref>
+ kHz sample frequency. Referring to Table 2a, this means an MP3 audio frame <part-num-ref name="MP3 audio frame">384</part-num-ref>
+ bytes long is sent every 24.0 <confidence value="5">m</confidence>
+s. If the device simply sets a periodic timer for 24.0 <confidence value="5">m</confidence>
+s and sends a packet when the timer expires, the constant bit rate will be maintained.    </p>
+    <p id="p-53" num="53">Audio Frame Size vs. Data Rate and Sam<confidence value="5">p</confidence>
+le Fre<confidence value="5">q</confidence>
+uenc<confidence value="5">y</confidence>
+ SBC*                   <confidence value="888">MP3</confidence>
+ 64     <part-num-ref name="">128</part-num-ref>
+     <part-num-ref name="">320</part-num-ref>
+    <part-num-ref name="">64</part-num-ref>
+     <part-num-ref name="">128</part-num-ref>
+     <part-num-ref name="">320</part-num-ref>
+ <confidence value="2222">kbps</confidence>
+   <confidence value="2222">kbps</confidence>
+    <confidence value="2222">kbps</confidence>
+   <confidence value="2222">kbps</confidence>
+   <confidence value="2222">kbps</confidence>
+    <confidence value="2222">kbps</confidence>
+ <confidence value="88">48</confidence>
+kHz     <part-num-ref name="kbps   kbps    kbps   kbps   kbps    kbps 48kHz">20</part-num-ref>
+     <part-num-ref name="">42</part-num-ref>
+      <part-num-ref name="">108</part-num-ref>
+    <part-num-ref name="">192</part-num-ref>
+    <part-num-ref name="">384</part-num-ref>
+     <part-num-ref name="">960</part-num-ref>
+ 44.1 kHz   <part-num-ref name="44.1 kHz">22</part-num-ref>
+     <part-num-ref name="">46</part-num-ref>
+     <part-num-ref name="">118</part-num-ref>
+     <part-num-ref name="">209</part-num-ref>
+    <part-num-ref name="">418</part-num-ref>
+    <part-num-ref name="">1045</part-num-ref>
+ <confidence value="88">32</confidence>
+kHz     <part-num-ref name="32kHz">32</part-num-ref>
+     <part-num-ref name="">64</part-num-ref>
+      <part-num-ref name="">162</part-num-ref>
+    <part-num-ref name="">228</part-num-ref>
+    <part-num-ref name="">576</part-num-ref>
+    <part-num-ref name="">1440</part-num-ref>
+ Table 2a. Audio frame sizes for SBC and MP3.    </p>
+    <p id="p-54" num="54">Audio Frame Period vs. Sam<confidence value="8">p</confidence>
+le Fre<confidence value="5">q</confidence>
+uenc<confidence value="5">y</confidence>
+ SBC*          MP3 48 kHz    2.667 <confidence value="5">m</confidence>
+s     24.0 <confidence value="68">ms</confidence>
+ 44.1 kHz   2.902 <confidence value="5">m</confidence>
+s    26.122 ms <part-num-ref name="kHz    2.667 ms     24.0 ms 44.1 kHz   2.902 ms    26.122 ms">32</part-num-ref>
+ kHz     4.0 <confidence value="5">m</confidence>
+s      36.0 <confidence value="68">ms</confidence>
+ Table 2b. Audio frame periods for SBC and MP3.    </p>
+    <p id="p-55" num="55">[0045]  SBC frames may be small with a short period, as illustrated in Table 2b with regard to several typical values for SBC and MP3 audio frame periods. Some devices may have problems using timers or processing data at such short intervals. This suggests that rather than send a small packet containing a single frame at very short intervals, a larger packet containing several frames at longer intervals may be communicated instead. The maximum size of MP3 frames may correspond to the L2CAP MTU of the AVDTP transport channel, such that audio frames may not need to be fragmented across AVDTP packets.</p>
+    <p id="p-56" num="56">[0046]  When more than one stream is transferred between devices, the stream playback may be synchronized. Consider the example of the wireless PC speakers shown in F<confidence value="5">I</confidence>
+G. 1. The PC may communicate a Bluetooth<confidence value="4">®</confidence>
+ audio stream to each speaker. There are actually two synchronization problems in this example. First, the <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+audio playback of the two speakers may need to be synchronized with each other.    </p>
+    <p id="p-57" num="57">Second, the audio playback may need to be synchronized with the display on the PC.</p>
+    <p id="p-58" num="58">Although the Bluetooth<confidence value="5">®</confidence>
+ specifications do not cover synchronization issues, there are some features of the system that may be utilized to address these synchronization problems.    </p>
+    <p id="p-59" num="59">[0047]  FIG. 6 is a block diagram illustrating audio signal processing within a <confidence value="2222222222">Bluetooth®</confidence>
+ enabled host device, in accordance with an embodiment of the invention.    </p>
+    <p id="p-60" num="60">Referring to FIG. 6, the Bluetooth<confidence value="5">®</confidence>
+ device or host <part-num-ref name="Bluetooth® device or host">606</part-num-ref>
+ may comprise a central processing unit (CPU) <part-num-ref name="central processing unit (CPU)">608</part-num-ref>
+ and a Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602.</part-num-ref>
+ The CPU or processor <part-num-ref name="CPU or processor">608</part-num-ref>
+ may utilize, for example, a <confidence value="885">low</confidence>
+-complexity sub-band CODEC (SBC) block <part-num-ref name="low-complexity sub-band CODEC (SBC) block">610.</part-num-ref>
+ The <confidence value="2222222222">Bluetooth®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602</part-num-ref>
+ may comprise a CPU <part-num-ref name="CPU">604.</part-num-ref>
+ The CPU <part-num-ref name="CPU">608</part-num-ref>
+ may be adapted to process uncompressed audio data. For example, the CPU <part-num-ref name="CPU">608</part-num-ref>
+ may be adapted to encode or compress uncompressed audio data utilizing the SBC block <part-num-ref name="SBC block">610.</part-num-ref>
+ The CPU <part-num-ref name="CPU">604</part-num-ref>
+ within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602</part-num-ref>
+ may be adapted to control processing of the required Bluetooth<confidence value="5">®</confidence>
+ software including the lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack, the upper <confidence value="2222222222">Bluetooth®</confidence>
+ protocol stack, and/or an embedded profile, for example.    </p>
+    <p id="p-61" num="61">[0048]  In operation, uncompressed audio data 612 may be received by the <confidence value="2222222222">Bluetooth®</confidence>
+ enabled device <part-num-ref name="Bluetooth® enabled device">606.</part-num-ref>
+ The Bluetooth<confidence value="5">®</confidence>
+ enabled device <part-num-ref name="Bluetooth® enabled device">606</part-num-ref>
+ may also be adapted to receive uncompressed input audio signals <part-num-ref name="may also be adapted to receive uncompressed input audio signals">614</part-num-ref>
+ from a standard pulse code modulation (PCM) wired CODEC interface, such as a standard hardware stereo PCM interface. Uncompressed audio data may be compressed by the CPU <part-num-ref name="CPU">608</part-num-ref>
+ utilizing the SBC block <part-num-ref name="SBC block">610.</part-num-ref>
+ Resulting compressed audio data <part-num-ref name="SBC block 610. Resulting compressed audio data">616</part-num-ref>
+ may be communicated from the SBC block <part-num-ref name="SBC block">610</part-num-ref>
+ to the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602.</part-num-ref>
+ The resulting internally encoded audio data may be directly interfaced via the Bluetooth<confidence value="5">®</confidence>
+ protocol to externally enabled <confidence value="2222222222">Bluetooth®</confidence>
+ devices. For example, a Bluetooth<confidence value="5">®</confidence>
+ radio such as Bluetooth<confidence value="5">®</confidence>
+ radio <part-num-ref name="Bluetooth® radio such as Bluetooth® radio">523</part-num-ref>
+ within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602</part-num-ref>
+ may communicate the received compressed signal as compressed RF audio signal <part-num-ref name="received compressed signal as compressed RF audio signal">618</part-num-ref>
+ to a peer Bluetooth<confidence value="5">®</confidence>
+ device, for example.    </p>
+    <p id="p-62" num="62">[0049]  <confidence value="5">I</confidence>
+n an exemplary embodiment of the invention, processing resources of the host CPU <part-num-ref name="host CPU">608</part-num-ref>
+ may be freed by moving SBC compression functionalities to the <confidence value="2222222222">Bluetooth®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602.</part-num-ref>
+ In this regard, SBC functionalities may be moved from the <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack, such as the upper Bluetooth<confidence value="5">®</confidence>
+ A2DP, to a lower <confidence value="2222222222">Bluetooth®</confidence>
+ protocol stack, such as a lower Bluetooth<confidence value="5">®</confidence>
+ A2DP.    </p>
+    <p id="p-63" num="63">[0050]  FIG. 7 is a block diagram of exemplary Bluetooth<confidence value="5">®</confidence>
+ protocol stack, in accordance with an embodiment of the invention. Referring to FIGS. 6 and <part-num-ref name="and">7,</part-num-ref>
+ the exemplary Bluetooth<confidence value="5">®</confidence>
+ protocol stack may comprise an upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack and a lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack. The upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack may be implemented within the host <part-num-ref name="host">606</part-num-ref>
+ and may comprise an upper A2DP <part-num-ref name="upper A2DP">702,</part-num-ref>
+ an upper AVDTP <part-num-ref name="upper AVDTP">704,</part-num-ref>
+ an upper L2CAP <part-num-ref name="upper L2CAP">706,</part-num-ref>
+ and an upper HCI <part-num-ref name="upper HCI">708.</part-num-ref>
+ The lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack may be implemented within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602</part-num-ref>
+ and may comprise a lower HCI <part-num-ref name="lower HCI">710,</part-num-ref>
+ an LMP <part-num-ref name="LMP">712,</part-num-ref>
+ a lower A2DP, a lower AVDTP <part-num-ref name="lower AVDTP">718,</part-num-ref>
+ a lower L2CAL <part-num-ref name="lower L2CAL">719,</part-num-ref>
+ and an LC <part-num-ref name="LC">720.</part-num-ref>
+ The lower A2DP may comprise an SBC <part-num-ref name="SBC">716.</part-num-ref>
+ The upper L2CAP <part-num-ref name="upper L2CAP">706,</part-num-ref>
+ the upper HCI <part-num-ref name="upper HCI">708,</part-num-ref>
+ the lower HCI <part-num-ref name="lower HCI">710,</part-num-ref>
+ the LMP <part-num-ref name="LMP">712,</part-num-ref>
+ and the LC <part-num-ref name="LC">720</part-num-ref>
+ may perform the same functionalities as described above with regard to F<confidence value="5">I</confidence>
+GS. 2, <part-num-ref name="same functionalities as described above with regard to FIGS. 2,">4,</part-num-ref>
+ and 5A.    </p>
+    <p id="p-64" num="64">The upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack may be utilized to handle control signaling portion of the Bluetooth<confidence value="5">®</confidence>
+ protocol from the host, and the lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack may be utilized to handle data processing/formatting portion of the Bluetooth<confidence value="5">®</confidence>
+ protocol from the host controller.    </p>
+    <p id="p-65" num="65">[0051]  In an exemplary embodiment of the invention, the SBC block may be moved from the upper Bluetooth<confidence value="5">®</confidence>
+ protocol stack in the host <part-num-ref name="host">606</part-num-ref>
+ to the lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack in the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">602.</part-num-ref>
+ In this regard a lower A2DP <part-num-ref name="lower A2DP">714</part-num-ref>
+ with the SBC <part-num-ref name="SBC">716</part-num-ref>
+ may be included as a protocol layer below the lower HCI <part-num-ref name="lower HCI">710.</part-num-ref>
+ The lower A2DP <part-num-ref name="lower A2DP">714</part-num-ref>
+ may be utilized to establish a signaling channel, for example, from the host device <part-num-ref name="host device">606</part-num-ref>
+ to a peer Bluetooth<confidence value="5">®</confidence>
+ enabled device for communication of compressed audio data. The lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ may be implemented as a Bluetooth<confidence value="5">®</confidence>
+ protocol layer below the lower A2DP <part-num-ref name="lower A2DP">714</part-num-ref>
+ and may be utilized to provide fragmentation and assembly functionalities during processing of compressed audio data.    </p>
+    <p id="p-66" num="66">[0052]  For example, compressed audio data may be further fragmented or combined together, based on the size of the compressed audio data packets. The lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ may be utilized to compress a plurality of SBC packets into a single AVDTP packet and add a media payload header to the AVDTP packet. The lower L2CAP <part-num-ref name="lower L2CAP">719</part-num-ref>
+ may be <boundary-data type="header">
+        <confidence value="88">14</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+utilized to support higher level protocol multiplexing, packet segmentation and reassembly, and quality of service (QoS) processing with regard to compressed audio frames processed by the lower A2DP <part-num-ref name="lower A2DP">714</part-num-ref>
+ and the lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ protocols. The lower L2CAP <part-num-ref name="lower L2CAP">719</part-num-ref>
+ may be adapted to verify the AVDTP packet (with a header) received from lower AVDTP <part-num-ref name="header) received from lower AVDTP">718,</part-num-ref>
+ and to add an L2CAP header. The L2CAP packet and header may then be communicated to the LC <part-num-ref name="LC">720</part-num-ref>
+ for further baseband processing and transmission.    </p>
+    <p id="p-67" num="67">[0053]  Referring to FIGs. 7 and <part-num-ref name="and">8,</part-num-ref>
+ the host device <part-num-ref name="host device">806,</part-num-ref>
+ which may be a Bluetooth<confidence value="5">®</confidence>
+ enabled host device, may be aware that the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may be adapted to perform encoding or compression of audio frames. The Bluetooth<confidence value="5">®</confidence>
+ enabled host device may initially establish a connection to a peer Bluetooth<confidence value="5">®</confidence>
+ device utilizing standard Bluetooth<confidence value="5">®</confidence>
+ protocol and procedures. After a Bluetooth<confidence value="5">®</confidence>
+ connection is established between the Bluetooth<confidence value="5">®</confidence>
+ enabled host device <part-num-ref name="Bluetooth® enabled host device">806</part-num-ref>
+ and a peer Bluetooth<confidence value="5">®</confidence>
+ device, the Bluetooth<confidence value="5">®</confidence>
+ enabled host device <part-num-ref name="Bluetooth® enabled host device">806</part-num-ref>
+ may indicate to the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ that uncompressed audio data may be sent to the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ via a special L2CAP channel with a specific L2CAP channel ID (<confidence value="66">CI</confidence>
+D).    </p>
+    <p id="p-68" num="68">Such notification may be accomplished via a vendor specific command, for example, of the upper H<confidence value="5">C</confidence>
+I <part-num-ref name="upper HCI">708</part-num-ref>
+ and/or the lower HCI <part-num-ref name="lower HCI">710.</part-num-ref>
+    </p>
+    <p id="p-69" num="69">[0054]  The Bluetooth<confidence value="5">®</confidence>
+ enabled host device <part-num-ref name="Bluetooth® enabled host device">806</part-num-ref>
+ may then pass to the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ control information which may be utilized for SBC compression, as well as to build AVDTP and L2CAP packets for the lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ and the lower L2CAP <part-num-ref name="lower L2CAP">719.</part-num-ref>
+ Such control information may comprise, for example, SBC parameters and/or A2DP/AVDTP headers negotiated during the establishment of the Bluetooth<confidence value="5">®</confidence>
+ connection. When the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ receives the next H<confidence value="66">CI</confidence>
+ packet from the lower H<confidence value="66">CI</confidence>
+ <part-num-ref name="lower HCI">710,</part-num-ref>
+ the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may check whether the H<confidence value="66">CI</confidence>
+ packet belongs to a special L2CAP <confidence value="66">CI</confidence>
+D. If the H<confidence value="66">CI</confidence>
+ packet does not belong to a special L2CAP <confidence value="66">CI</confidence>
+D, the HCI packet may be delivered directly from the lower H<confidence value="5">C</confidence>
+I <part-num-ref name="lower HCI">710</part-num-ref>
+ to the LC <part-num-ref name="LC">720.</part-num-ref>
+ If the H<confidence value="5">C</confidence>
+I packet belongs to a special L2CAP <confidence value="66">CI</confidence>
+D, the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may combine the fragments of the L2CAP packet from the upper L2<confidence value="5">C</confidence>
+AP <part-num-ref name="upper L2CAP">706</part-num-ref>
+ and may pass it to the lower A2DP <part-num-ref name="lower A2DP">714</part-num-ref>
+ and the SBC <part-num-ref name="SBC">716</part-num-ref>
+ for compression. Compressed packets may be communicated to the lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ for delivery. The lower AVDTP <part-num-ref name="lower AVDTP">718</part-num-ref>
+ may add <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+required headers to the received packets and may communicate the resulting headers and packets to the lower L2CAP <part-num-ref name="lower L2CAP">719.</part-num-ref>
+ The lower L2CAP <part-num-ref name="lower L2CAP">719</part-num-ref>
+ may add L2CAP headers and the resulting packets and headers may be communicated to the LC <part-num-ref name="LC">720.</part-num-ref>
+    </p>
+    <p id="p-70" num="70">[0055]  Even though SBC encoding is utilized for audio compression, the present invention may not be so limited and other methods of encoding, such as MP3 or AAC, for example, may be also utilized.</p>
+    <p id="p-71" num="71">[0056]  FIG. 8 is a block diagram illustrating audio signal compression within a <confidence value="2222222222">Bluetooth®</confidence>
+ transceiver, in accordance with an embodiment of the invention. Referring to FIG. 8, the Bluetooth<confidence value="5">®</confidence>
+ device or host <part-num-ref name="Bluetooth® device or host">806</part-num-ref>
+ may comprise a central processing unit (CPU) <part-num-ref name="central processing unit (CPU)">808</part-num-ref>
+ and a Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802.</part-num-ref>
+ The Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may comprise a CPU <part-num-ref name="CPU">804</part-num-ref>
+ and the CPU <part-num-ref name="CPU">804</part-num-ref>
+ may utilize a <confidence value="885">low</confidence>
+-complexity sub-band CODEC (SBC) block <part-num-ref name="low-complexity sub-band CODEC (SBC) block">810.</part-num-ref>
+ The CPU <part-num-ref name="CPU">804</part-num-ref>
+ may be adapted to process uncompressed audio data received from the CPU <part-num-ref name="CPU">808.</part-num-ref>
+ For example, the CPU <part-num-ref name="CPU">804</part-num-ref>
+ may be adapted to encode or compress uncompressed audio data utilizing the SBC block <part-num-ref name="SBC block">810.</part-num-ref>
+ Furthermore, the CPU <part-num-ref name="CPU">804</part-num-ref>
+ within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may be adapted to operate all the required <confidence value="2222222222">Bluetooth®</confidence>
+ software including the lower Bluetooth<confidence value="5">®</confidence>
+ protocol stack, the upper <confidence value="2222222222">Bluetooth®</confidence>
+ protocol stack, and/or an embedded profile, for example.    </p>
+    <p id="p-72" num="72">[0057]  In operation, uncompressed audio data 812 may be received by the <confidence value="2222222222">Bluetooth®</confidence>
+ enabled device <part-num-ref name="Bluetooth® enabled device">806.</part-num-ref>
+ The uncompressed audio data may then be communicated to the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ via connection <part-num-ref name="via connection">814.</part-num-ref>
+  The uncompressed audio data may be compressed by the CPU <part-num-ref name="CPU">804</part-num-ref>
+ within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ utilizing the SBC block <part-num-ref name="SBC block">810.</part-num-ref>
+ The Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may be also adapted to receive uncompressed input audio signals <part-num-ref name="may be also adapted to receive uncompressed input audio signals">816</part-num-ref>
+ via a standard pulse code modulation (PCM) wired CODEC interface, such as a standard hardware stereo PCM interface. The resulting internally encoded audio data may be directly interfaced via the Bluetooth<confidence value="5">®</confidence>
+ protocol from the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ to externally enabled <confidence value="2222222222">Bluetooth®</confidence>
+ devices. For example, a Bluetooth<confidence value="5">®</confidence>
+ radio such as the Bluetooth<confidence value="5">®</confidence>
+ radio <part-num-ref name="Bluetooth® radio">523</part-num-ref>
+ of FIG. 5B, which is located within the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">802</part-num-ref>
+ may communicate the compressed audio signal as RF compressed audio signal <part-num-ref name="compressed audio signal as RF compressed audio signal">818</part-num-ref>
+ to a peer Bluetooth<confidence value="5">®</confidence>
+ device, for example.    </p>
+    <boundary-data type="header">
+      <confidence value="88">16</confidence>
+    </boundary-data>
+    <p id="p-73" num="73">
+      <page-break num="17"/>
+[0058]  Even though a PCM interface is utilized to receive uncompressed input audio signals, the present invention may not be so limited and other types of interfaces, such as 12S or another hardware interface may be also utilized to receive uncompressed input audio signals.    </p>
+    <p id="p-74" num="74">[0059]  FIG. 9 is a block diagram of exemplary Bluetooth<confidence value="5">®</confidence>
+ transceiver utilizing audio signal compression, in accordance with an embodiment of the invention. Referring to FIG. 9, the Bluetooth<confidence value="5">®</confidence>
+ transceiver <part-num-ref name="Bluetooth® transceiver">902</part-num-ref>
+ may comprise a transmit/receive switch <part-num-ref name="transmit/receive switch">904,</part-num-ref>
+ a transmitter (Tx) block <part-num-ref name="transmitter (Tx) block">906,</part-num-ref>
+ a receiver (Rx) block <part-num-ref name="receiver (Rx) block">908,</part-num-ref>
+ a baseband processing block <part-num-ref name="baseband processing block">910</part-num-ref>
+ and a compression acceleration block <part-num-ref name="compression acceleration block">914.</part-num-ref>
+ The baseband processing block <part-num-ref name="baseband processing block">910</part-num-ref>
+ may comprise a CPU <part-num-ref name="CPU">912.</part-num-ref>
+ The functionalities of the baseband processing block <part-num-ref name="baseband processing block">910</part-num-ref>
+ and the CPU <part-num-ref name="CPU">912</part-num-ref>
+ may be the same as the functionalities of the baseband IC <part-num-ref name="baseband IC">305</part-num-ref>
+ and the processor <part-num-ref name="processor">309,</part-num-ref>
+ as described above with regard to FIG. 3.    </p>
+    <p id="p-75" num="75">[0060]  The compression acceleration block <part-num-ref name="compression acceleration block">914</part-num-ref>
+ may comprise suitable circuitry, logic, and/or code and may be adapted to compress audio data received from the baseband processing block <part-num-ref name="baseband processing block">910.</part-num-ref>
+ In one embodiment of the invention, the compression acceleration block <part-num-ref name="compression acceleration block">914</part-num-ref>
+ may comprise a digital signal processor implementing a low- complexity sub-band CODEC, for example.    </p>
+    <p id="p-76" num="76">[0061] In another embodiment of the invention, the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may comprise an on-chip audio codec within the CPU <part-num-ref name="CPU">912,</part-num-ref>
+ that compresses received audio information on-chip. The audio codec within the CPU <part-num-ref name="CPU">912</part-num-ref>
+ may comprise a low complexity sub-band codec (SBC), for example. The Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may receive an audio stream comprising audio information, via a protocol stack that is external to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902.</part-num-ref>
+ The received audio stream may be generated via an audio/video distribution transport protocol (AVDTP) within the protocol stack that is external to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902.</part-num-ref>
+ A data channel may be established between the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ and a peer Bluetooth<confidence value="5">®</confidence>
+ device, for communicating the established audio stream to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ for compression. The data channel may be established utilizing a logical link control and adaptation protocol (L2CAP) and/or an advanced audio distribution profile (A2DP) within the protocol stack that is external to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902.</part-num-ref>
+    </p>
+    <boundary-data type="header">
+      <confidence value="88">17</confidence>
+    </boundary-data>
+    <p id="p-77" num="77">
+      <page-break num="18"/>
+[0062]  The Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may determine on-chip, a frame size of at least one audio frame comprising the compressed audio information. Exemplary SBC audio frame sizes are listed in Table 2a herein above. The Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may format on-chip, audio frames comprising the compressed audio information based on a determined frame size. The Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may format the audio frames on-chip by fragmenting the audio frames and/or by combining a plurality of the audio frames. The Bluetooth<confidence value="5">��</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">902</part-num-ref>
+ may format, the audio frames on-chip via the audio/video distribution transport protocol (AVDTP). The Bluetooth<confidence value="5">®</confidence>
+ transceiver chip may acquire the audio information on-chip via a pulse code modulation (PCM) wired connection.    </p>
+    <p id="p-78" num="78">[0063] FIG. 10 is a flow diagram illustrating exemplary steps for processing data within a Bluetooth<confidence value="5">®</confidence>
+ device, in accordance with an embodiment of the invention.    </p>
+    <p id="p-79" num="79">Referring to FIGs. 8 and <part-num-ref name="and">10,</part-num-ref>
+ at <part-num-ref name="and 10, at">1002,</part-num-ref>
+ audio stream <part-num-ref name="and 10, at 1002, audio stream">812</part-num-ref>
+ comprising audio information may be generated outside a Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802,</part-num-ref>
+ via an audio/video distribution transport protocol (AVDTP) external to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802.</part-num-ref>
+    </p>
+    <p id="p-80" num="80">At 1004, a data channel may be established via the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802</part-num-ref>
+ between a Bluetooth<confidence value="5">®</confidence>
+ enabled device and a peer Bluetooth<confidence value="5">®</confidence>
+ device, for communicating the established audio stream <part-num-ref name="established audio stream">812</part-num-ref>
+ to the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802</part-num-ref>
+ for compression. At <part-num-ref name="for compression. At">106,</part-num-ref>
+ the uncompressed audio information <part-num-ref name="uncompressed audio information">812</part-num-ref>
+ may be compressed on-chip within the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802</part-num-ref>
+ utilizing an audio CODEC, such as the SBC <part-num-ref name="SBC">810</part-num-ref>
+ implemented within the Bluetooth<confidence value="5">®</confidence>
+ transceiver chip <part-num-ref name="Bluetooth® transceiver chip">802.</part-num-ref>
+    </p>
+    <p id="p-81" num="81">[0064]  Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in at least one computer system or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.</p>
+    <boundary-data type="header">
+      <confidence value="88">18</confidence>
+    </boundary-data>
+    <p id="p-82" num="82">
+      <page-break num="19"/>
+[0065]  The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.    </p>
+    <p id="p-83" num="83">[0066]  While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims.</p>
+    <boundary-data type="header">
+      <confidence value="88">19</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11217057.xml

@@ -0,0 +1,100 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11217057</doc-number>
+        <date>2009-10-26</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Application No. 11/217,057</boundary-data>
+    <boundary-data type="header">Filed: 08-31-2005</boundary-data>
+    <boundary-data type="header">Attorney Docket No.: CA920050004US1 (548)</boundary-data>
+    <heading id="h-1">AMENDMENTS TO THE SPECIFICATIONS</heading>
+    <p id="p-1" num="1">Please replace paragraph [0010] with the following replacement paragraph:</p>
+    <p id="p-2" num="2">[0010] A main JavaServer Page may include a JSP segment multiple times. JavaServer Faces technology and specification dictate that each segment must be contained within a JavaServer Faces subview component. The code <part-num-ref name="code">100</part-num-ref>
+ shown in the prior art of FIG. la of a JavaServer Page includes three instances of a JSP segment: AsubviewOne<confidence value="66">@1</confidence>
+ <confidence value="888">10;</confidence>
+    </p>
+    <p id="p-3" num="3">Asubview<confidence value="5886">Two@</confidence>
+ 115; and Asubview<confidence value="5">T</confidence>
+hree<confidence value="6">@</confidence>
+ 120. Tag libraries contain the code for a set of JavaServer Faces tags, and in a JSP, the Ataglib<confidence value="6">@</confidence>
+ directive declares the name of a tag library. When a prefix is specified, such as in Ah:input<confidence value="5">T</confidence>
+ext<confidence value="5">@</confidence>
+, the prefix denotes in which tag library the tag, in this case Ainput<confidence value="5">T</confidence>
+ext<confidence value="6">@</confidence>
+ is located. One tag library has the universal resource identifier (uri) of Ahttp://Java.sun.com<confidence value="5">/</confidence>
+jsf/core<confidence value="6">@</confidence>
+ and refers to a core library having a prefix f, in this case, &lt;f:view&gt;135. A core is a JavaServer Faces tag specific to a JavaServer Face component. Another tag library has an uri of Ahttp://Java.sun.com<confidence value="5">/</confidence>
+jsf/html<confidence value="6">@</confidence>
+ <part-num-ref name="uri of Ahttp://Java.sun.com/jsf/html@">130</part-num-ref>
+ and refers to a JavaServer Faces tag specific to hypertext markup language (html) tag with a prefix h, shown above as &lt;h:form&gt;140. The actual grouping of the user interface components are within a JavaServer Page segment.    </p>
+    <p id="p-4" num="4">The code &lt;jsp:include page=<confidence value="5">@</confidence>
+segmentjsp<confidence value="5">@</confidence>
+/&gt;145 refers to the contained JSP segment in the file named "Segmentjsp" and describes a panel with three input fields: a customer's name; an identifier; and a password. The value of each input field is bound to a property of a JavaServer Faces managed bean named "<confidence value="8">S</confidence>
+egmentSample". Shown in FIG. <confidence value="5">l</confidence>
+b is the code of ASegmentjsp<confidence value="6">@</confidence>
+ and this code is processed three times each time the JavaServer Faces components &lt;f:view&gt;and &lt;h:form&gt;are encountered. Shown in FIG. <confidence value="25">1c</confidence>
+ is the <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">Application No. 11/217,057</boundary-data>
+      <boundary-data type="header">Filed: 08-31-2005</boundary-data>
+      <boundary-data type="header">Attorney Docket No.: CA920050004US1 (548)</boundary-data>
+JavaServer Faces managed bean named "<confidence value="8">S</confidence>
+egmentSample" that is declared in the faces- config.xml file of the JavaServer Faces application. The managed bean is implemented by a managed bean class named "codebehind.SegmentSampleClass" that contains getter and setter methods for the properties "name", "user<confidence value="5">I</confidence>
+D", and "password"; the managed bean class itself is shown in FIG. 2a.    </p>
+    <p id="p-5" num="5">Please replace paragraph [0044] with the following replacement paragraph:</p>
+    <p id="p-6" num="6">[0044] The inventor herein took advantage of the fact that in dynamic web pages, processing is done in top down order. By assigning a zero based index to each segment inclusion, where the topmost inclusion has an index value of zero, a segment is reset each time. The inventive method and apparatus herein uses hidden fields and a new "manager" class. The Amanager<confidence value="2">@</confidence>
+ class is preferably included with a servlet. Each programmer's managed visual component needs to subclass the manager class.    </p>
+    <p id="p-7" num="7">Please replace paragraph [0045] with the following replacement paragraph:</p>
+    <p id="p-8" num="8">[0045] The manager class contains a method that allows the programmer's managed visual component, such as a bean, to query which segment is active when a property getter or setter method is invoked. The inventor further created a new class called "SegmentManager<confidence value="2">@</confidence>
+ that deduces what segment inclusion is active by managing a segment index. An example of object-oriented code <part-num-ref name="example of object-oriented code">400</part-num-ref>
+ for a SegmentManager class is <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">Application No. 11/217,057</boundary-data>
+      <boundary-data type="header">Filed: 08-31-2005</boundary-data>
+      <boundary-data type="header">Attorney Docket No.: CA920050004US1 (548)</boundary-data>
+shown in FIG. 4. In this class <part-num-ref name="SegmentManager class is shown in FIG. 4. In this class">410,</part-num-ref>
+ subclasses are able to determine what inclusion is active during the invocation of a subclass' property getter or setter method. The class has getter and setter methods for the following properties: (a) segmentEntry; (b) segmentExit;    </p>
+    <p id="p-9" num="9">and (c) componentEntry. The new class also manages a mode state having three values:</p>
+    <p id="p-10" num="10">INIT 420 which indicates that the mode is in initialization state; GET <part-num-ref name="mode is in initialization state; GET">422</part-num-ref>
+ that indicates that the mode is in property get state; and SET <part-num-ref name="mode is in property get state; and SET">424</part-num-ref>
+ that indicates that the mode is in property set state. The class contains two state variables: <part-num-ref name="class contains two state variables:">(1)</part-num-ref>
+ mode indicating the current mode state; and <part-num-ref name="current mode state; and">(2)</part-num-ref>
+ segment<confidence value="5">I</confidence>
+ndex indicating the active segment inclusion. It is suggested that the initial value of the <confidence value="5">_</confidence>
+mode state variable is <confidence value="5">I</confidence>
+NIT as in <part-num-ref name="_mode state variable is INIT as in">426</part-num-ref>
+ and the initial value of the <confidence value="5">_</confidence>
+segment<confidence value="5">I</confidence>
+ndex state variable is zero as in <part-num-ref name="_segmentIndex state variable is zero as in">428,</part-num-ref>
+ although these initial variables and values need not be so limited.    </p>
+    <p id="p-11" num="11">Please replace paragraph [0048] with the following replacement paragraph:</p>
+    <p id="p-12" num="12">[0048] The components of a segment are surrounded with hidden input field (inputHidden) components. FIG. 6 is an example of code that can be used to create the hidden component. An inputHidden component <part-num-ref name="inputHidden component">610</part-num-ref>
+ is placed at the beginning or entry of the segment to in order to track the start of a top to bottom traversal through the segment's components and again at the end or exit <part-num-ref name="end or exit">650</part-num-ref>
+ of the segment to track the completion through the segment's components. The entry inputHidden component has a value binding to the segmentEntry property at line <part-num-ref name="segmentEntry property at line">610</part-num-ref>
+ and a component binding to the property named "componentEntry<confidence value="6">@</confidence>
+ at line <part-num-ref name="property named &quot;componentEntry@ at line">620,</part-num-ref>
+ both of the SegmentManager class. The component binding tracks the start of a top to bottom traversal through the web page's <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">Application No. 11/217,057</boundary-data>
+      <boundary-data type="header">Filed: 08-31-2005</boundary-data>
+      <boundary-data type="header">Attorney Docket No.: CA920050004US1 (548)</boundary-data>
+segments. The exit inputHidden component also has a value binding to the segmentExit property of the SegmentManager class at line <part-num-ref name="SegmentManager class at line">650.</part-num-ref>
+    </p>
+    <boundary-data type="header">
+      <confidence value="8">5</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11265437.xml

@@ -0,0 +1,558 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11265437</doc-number>
+        <date>2005-11-01</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Attorney's Docket No.: 18814-016001 / P3910US1</boundary-data>
+    <heading id="h-1">APPLICATION</heading>
+    <heading id="h-2">FOR</heading>
+    <heading id="h-3">UNITED STATES LETTERS PATENT</heading>
+    <heading id="h-4">TITLE:           PRE-RESAMPLING TO ACHIEVE CONTINUOUSLY</heading>
+    <heading id="h-5">VARIABLE ANALYSIS TIME/FREQUENCY</heading>
+    <heading id="h-6">RESOLUTION</heading>
+    <heading id="h-7">APPLICANT:       KEVIN CHRISTOPHER ROGERS</heading>
+    <heading id="h-8">CERTIFICATE OF MAIL<confidence value="8">I</confidence>
+NG BY EXPRESS MAIL    </heading>
+    <p id="p-1" num="1">Express Mail <confidence value="5">L</confidence>
+abel No.  EV 471534361 US November <part-num-ref name="US November">1<confidence value="5">.</confidence>
+      </part-num-ref>
+ <part-num-ref name="US November 1.">2005</part-num-ref>
+ Date of Deposit <page-break num="2"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="56681">10USl</confidence>
+      </boundary-data>
+    </p>
+    <heading id="h-9">PRE-RESAMPLING TO ACHIEVE CONTINUOUSLY VARIABLE</heading>
+    <heading id="h-10">ANALYSIS <confidence value="22222222222222">TIME/FREQUENCY</confidence>
+ RESOLUTION    </heading>
+    <heading id="h-11">BACKGROUND</heading>
+    <p id="p-2" num="2">[0001]  The present disclosure relates to digital audio signals, and to systems and methods for providing continuously variable time-frequency resolution in digital audio signal processing.</p>
+    <p id="p-3" num="3">[0002]  Digital-based electronic media formats have become widely accepted.</p>
+    <p id="p-4" num="4">The development of faster computer processors, high-density storage media, and efficient compression and encoding algorithms have led to an even more widespread implementation of digital audio media formats in recent years. Digital compact discs (CDs) and digital audio file formats, such as MP3 (MPEG Audio - layer <part-num-ref name="even more widespread implementation of digital audio media formats in recent years. Digital compact discs (CDs) and digital audio file formats, such as MP3 (MPEG Audio - layer">3)</part-num-ref>
+ and WA<confidence value="5">V</confidence>
+, are now commonplace. Some of these formats are configured to store digitized audio information in an uncompressed fashion while others store compressed digitized audio information. The ease with which digital audio files can be generated, duplicated, and disseminated also has helped to increase their popularity.    </p>
+    <p id="p-5" num="5">[0003]  Audio information can be detected as an analog signal and represented using an almost infinite number of electrical signal values. An analog audio signal is subject to electrical signal impairments, however, that can negatively affect the quality of the recorded information. Any change to an analog audio signal value can result in a noticeable defect, such as distortion or noise. Because an analog audio signal can be represented using an almost infinite number of electrical signal values, it is difficult to detect and correct such defects. Moreover, the methods of duplicating analog audio signals cannot approach the speed with which digital audio files can be reproduced. In some instances, the problems associated with analog audio signal processing can be overcome, without a significant loss of information, simply by digitizing the audio signal.</p>
+    <p id="p-6" num="6">[0004]  FIG. 1 presents a portion of an analog audio signal <part-num-ref name="analog audio signal">100.</part-num-ref>
+ The amplitude of the analog audio signal <part-num-ref name="analog audio signal">100</part-num-ref>
+ is shown with respect to the vertical <boundary-data type="header">
+        <confidence value="7">1</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56881">10US1</confidence>
+      </boundary-data>
+axis <part-num-ref name="vertical axis">105</part-num-ref>
+ and the horizontal axis <part-num-ref name="horizontal axis">110</part-num-ref>
+ indicates time. In order to digitize the analog audio signal <part-num-ref name="analog audio signal">100,</part-num-ref>
+ the waveform <part-num-ref name="waveform">115</part-num-ref>
+ is sampled at periodic intervals, such as at a first sample point <part-num-ref name="first sample point">120</part-num-ref>
+ and a second sample point <part-num-ref name="second sample point">125.</part-num-ref>
+ A sample value representing the amplitude of the waveform <part-num-ref name="waveform">115</part-num-ref>
+ is recorded for each sample point. The highest frequency present in the waveform being sampled indicates the bandwidth of the signal. If the sampling rate is less than twice the bandwidth of the signal being sampled, the resulting digital signal will be substantially identical to the result obtained by sampling a waveform of a lower frequency. As such, in order to be adequately represented, the waveform <part-num-ref name="waveform">115</part-num-ref>
+ must be sampled at a rate greater than twice the bandwidth that is to be included in the reconstructed signal. To ensure that the waveform is free of frequencies higher than one-half of the sampling rate, which is also known as the Nyquist frequency, the audio signal <part-num-ref name="audio signal">100</part-num-ref>
+ can be filtered prior to sampling. Therefore, in order to preserve as much audible information as possible, the sampling rate should be sufficient to produce a reconstructed waveform that cannot be differentiated by a human listener from the waveform <part-num-ref name="waveform">115.</part-num-ref>
+    </p>
+    <p id="p-7" num="7">[0005]  The human ear generally cannot detect frequencies greater than 16-20 kHz, so the sampling rate used to create an accurate representation of an acoustic signal should be at least <part-num-ref name="acoustic signal should be at least">32</part-num-ref>
+ kHz. For example, compact disc quality audio signals are generated using a sampling rate of 44.1 kHz. Once the sample value associated with a sample point has been determined, it can be represented using a fixed number of binary digits, or bits. Encoding the almost infinite possible values of an analog audio signal using a finite number of binary digits will almost necessarily result in the loss of some information. Because high- quality audio is encoded using up to 24-bits per sample, however, the digitized sample values closely approximate the corresponding original analog values.    </p>
+    <p id="p-8" num="8">The digitized values of the samples comprising the audio signal can then be stored using a digital-audio file format.</p>
+    <p id="p-9" num="9">[0006]  The acceptance of digital-audio has increased dramatically as the amount of information that is shared electronically has grown. Digital-audio file formats that can be transferred between a wide variety of hardware devices are <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">18814-016001 / P391<confidence value="488">0US</confidence>
+ <confidence value="5">1</confidence>
+      </boundary-data>
+now widely used. In addition to music and soundtracks associated with video information, digital-audio is also being used to store information such as voice- mail messages, audio books, speeches, lectures, and instructions.    </p>
+    <p id="p-10" num="10">[0007]  The characteristics of digital-audio and the associated file formats also can be used to provide greater functionality in manipulating audio signals than was previously available with analog formats. One such type of manipulation is filtering, which can be used for signal processing operations including removing various types of noise, enhancing certain frequencies, or equalizing a digital audio signal. Another type of manipulation is time stretching, in which the playback duration of a digital audio signal is increased or decreased, either with or without altering the pitch. Compression is yet another type of manipulation, by which the amount of data used to represent a digital audio signal is reduced.</p>
+    <p id="p-11" num="11">Through compression, a digital audio signal can be stored using less memory and transmitted using less bandwidth. Digital audio processing strategies include MP3, AAC (MPEG-2 Advanced Audio Codec), and Dolby Digital AC-3.</p>
+    <p id="p-12" num="12">[0008]  Some digital audio processing strategies employ techniques for analyzing and manipulating the digital audio data in the frequency domain. In performing such processing, the digital audio data can be transformed from the time domain into the frequency domain block by block, each block being comprised of multiple discrete audio samples. In order to transform a digital audio signal from the time domain, a processing algorithm can convert the blocks of samples into the frequency domain using a Discrete Fourier Transform (DFT), such as the Fast Fourier Transform (FFT). The number of individual samples included in a block of audio data defines the time resolution and the frequency resolution of the transform. Once transformed into the frequency domain, the digital audio signal can be represented using magnitude and phase information, which describe the spectral characteristics of the block.</p>
+    <p id="p-13" num="13">[0009]  The FFT is frequently used by digital audio processing strategies because it is computationally more efficient than other transforms. For example, the FFT exploits mathematical redundancies in the DFT algorithm to increase its computational efficiency. In order to achieve this efficiency, however, the FFT <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">18814-016001 / P3910U<confidence value="58">S1</confidence>
+      </boundary-data>
+algorithm also is constrained by limitations. One such limitation is the window size, or number of samples, the FFT can be configured to process. The FFT<confidence value="5">.</confidence>
+    </p>
+    <p id="p-14" num="14">algorithm can accept only window sizes defined by the equation windowsize = <confidence value="86">x^</confidence>
+y, where x and y are integers. Because computers are binary machines, the window sizes that can be processed by an FFT are given by the equation windowsize = 2<confidence value="5">^</confidence>
+y, where y is any integer.    </p>
+    <p id="p-15" num="15">[00010] As discussed above, the window size determines the time resolution and frequency resolution of the processing algorithm. As the window size becomes larger, the time resolution decreases and the frequency resolution increases. At larger window sizes, the choice between FFT sizes can become difficult. For example, if an audio processing algorithm requires a frequency resolution of 5,000 samples, the FFT algorithm will be required to use a window size of 8,192 samples. Consequently, the algorithm will sacrifice some time resolution because the window size required to take advantage of the FFT is larger than needed. Further, use of the larger window size will not offset the loss in time resolution with improved frequency resolution because the algorithm only requires a frequency resolution of 5,000 samples.</p>
+    <p id="p-16" num="16">[00011] After the window of digital audio data has been processed and the spectral characteristics associated with the window have been determined, the digital audio data can be converted back into the time domain using an Inverse Discrete Fourier Transform (IDFT), such as the Inverse Fast Fourier Transform </p>
+    <heading id="h-12">(<confidence value="222288">IFFT).</confidence>
+    </heading>
+    <p id="p-17" num="17">[00012] As discussed above, digital audio signals can be manipulated using a variety of techniques and methods. Many of these techniques and methods rely on transforming digital audio signals into the frequency domain and consequently require selecting an FFT size that satisfies specific time and frequency resolution values. Because the window size associated with the FFT is constrained, an alternative means that provides continuously variable time-frequency resolution in digital audio signal processing is required.</p>
+    <boundary-data type="header">
+      <confidence value="8">4</confidence>
+    </boundary-data>
+    <boundary-data type="header">18814-016001 / P39<confidence value="56881">10USI</confidence>
+    </boundary-data>
+    <heading id="h-13">SUMMARY</heading>
+    <p id="p-18" num="18">
+      <page-break num="6"/>
+[00013] The present inventor recognized the need to provide a means for continuously variable time-frequency resolution when processing a digital audio signal. Accordingly, the techniques and apparatus described here implement algorithms for accurate and reliable means of providing continuously variable time-frequency resolution in digital audio signal processing.    </p>
+    <p id="p-19" num="19">[00014] In general, in one aspect, the techniques can be implemented to include selecting a portion of an input digital audio signal; resampling the selected portion of the input digital audio signal; generating a plurality of spectral characteristics associated with the resampled portion of the input digital audio signal; generating a portion of an output digital audio signal from the plurality of spectral characteristics; and resampling the portion of the output digital audio signal.</p>
+    <p id="p-20" num="20">[00015] The techniques also can be implemented to include processing the plurality of spectral characteristics associated with the resampled portion of the input digital audio signal. Further, the techniques can be implemented such that processing includes modifying either or both of a magnitude and a phase associated with one or more of the plurality of spectral characteristics.</p>
+    <p id="p-21" num="21">Additionally, the techniques can be further implemented to include resampling the selected portion of the input digital audio signal by upsampling and resampling the portion of the output digital audio signal by downsampling.</p>
+    <p id="p-22" num="22">Additionally, the techniques can be further implemented to include resampling the selected portion of the input digital audio signal by downsampling and resampling the portion of the output digital audio signal by upsampling.</p>
+    <p id="p-23" num="23">[00016] The techniques also can be implemented such that resampling the selected portion of the input digital audio signal further comprises determining a sampling ratio, and resampling the selected portion of the input digital audio signal in accordance with the determined sampling ratio. Further, the techniques can be implemented to include resampling the portion of the output digital audio signal in accordance with the inverse of the determined sampling ratio. Further, the techniques can be implemented to include determining the sampling ratio <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="56884">10US1</confidence>
+      </boundary-data>
+based on the size of an FFT. Further, the techniques can be implemented to include determining the sampling ratio based on a time-frequency resolution requirement associated with an audio processing algorithm.    </p>
+    <p id="p-24" num="24">[00017] In general, in another aspect, the techniques can be implemented to include machine-readable instructions for processing a digital audio signal using continuously variable time-frequency resolution, the machine-readable instructions being operable to perform operations comprising selecting a portion of an input digital audio signal; resampling the selected portion of the input digital audio signal; generating a plurality of spectral characteristics associated with the resampled portion of the input digital audio signal; generating a portion of an output digital audio signal from the plurality of spectral characteristics; and resampling the portion of the output digital audio signal.</p>
+    <p id="p-25" num="25">[00018] The techniques can also be implemented to include machine-readable instructions further operable to perform operations comprising processing the plurality of spectral characteristics associated with the resampled portion of the input digital audio signal. Further, the techniques can be implemented such that the machine-readable instruction for processing the spectral characteristics are further operable to perform operations comprising modifying either or both of a magnitude and a phase associated with one or more of the plurality of spectral characteristics. Additionally, the techniques can be implemented such that the machine-readable instructions are further operable to resample the selected portion of the input digital audio signal by upsampling and resample the portion of the output digital audio signal by downsampling. Additionally, the techniques can be implemented such that the machine-readable instructions are further operable to resample the selected portion of the input digital audio signal by downsampling and resample the portion of the output digital audio signal by upsampling.</p>
+    <p id="p-26" num="26">[00019] The techniques can also be implemented to include machine-readable instructions further operable to perform operations comprising determining a sampling ratio; and resampling the selected portion of the input digital audio signal in accordance with the determined sampling ratio. Further, the techniques can be implemented such that the machine-readable instructions are further <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56885">10US1</confidence>
+      </boundary-data>
+operable to perform operations comprising resampling the portion of the output digital audio signal in accordance with the inverse of the determined sampling ratio. Further, the techniques also can be implemented such that the machine- readable instructions are further operable to perform operations comprising determining the sampling ratio based on the size of an FFT. Further, the techniques also can be implemented such that the machine-readable instructions are further operable to perform operations comprising determining the sampling ratio based on a time-frequency resolution requirement associated with an audio processing algorithm.    </p>
+    <p id="p-27" num="27">[00020] In general, in another aspect, the techniques can be implemented to include processor electronics configured to perform operations comprising:</p>
+    <p id="p-28" num="28">selecting a portion of an input digital audio signal; resampling the selected portion of the input digital audio signal; generating a plurality of spectral characteristics associated with the resampled portion of the input digital audio signal; generating a portion of an output digital audio signal from the plurality of spectral characteristics; and resampling the portion of the output digital audio signal.</p>
+    <p id="p-29" num="29">[00021] The techniques can also be implemented to include processor electronics further configured to perform operations comprising processing the plurality of spectral characteristics associated with the resampled portion of the input digital audio signal. Additionally, the techniques can also be implemented to include processor electronics further configured to perform operations comprising resampling the selected portion of the input digital audio signal by upsampling and resampling the portion of the output digital audio signal by downsampling. Additionally, the techniques can also be implemented to include processor electronics further configured to perform operations comprising resampling the selected portion of the input digital audio signal by downsampling;</p>
+    <p id="p-30" num="30">and resampling the portion of the output digital audio signal by upsampling.</p>
+    <p id="p-31" num="31">[00022] The techniques can also be implemented to include processor electronics further configured to perform operations comprising determining a sampling ratio and resampling the selected portion of the input digital audio <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56">10</confidence>
+US1      </boundary-data>
+signal in accordance with the determined sampling ratio. Further, the processor electronics can be further configured to resample the portion of the output digital audio signal in accordance with the inverse of the determined sampling ratio.    </p>
+    <p id="p-32" num="32">Further, the processor electronics can be further configured to determine the sampling ratio based on a time-frequency resolution requirement associated with an audio processing algorithm.</p>
+    <p id="p-33" num="33">[00023] The techniques described in this specification can be implemented to realize one or more of the following advantages. For example, the techniques can be implemented to permit discrete portions of a digital audio signal to be processed in the frequency domain utilizing a continuously variable block size.</p>
+    <p id="p-34" num="34">The techniques also can be implemented to permit an algorithm for processing a digital audio signal to utilize the precise time-frequency resolution that is appropriate for a particular block of audio data. Further, the techniques can be implemented such that the efficiencies of the FFT algorithm can be realized without limiting the time-frequency resolution. Additionally, the techniques can be implemented to include downsampling an upsampled signal, which can reduce the transient diffusion that results from some processing algorithms by condensing the disruptions in the frequency domain.</p>
+    <p id="p-35" num="35">[00024] These general and specific techniques can be implemented using an apparatus, a method, a system, or any combination of an apparatus, methods, and systems. The details of one or more implementations are set forth in the accompanying drawings and the description below. Further features, aspects, and advantages will become apparent from the description, the drawings, and the claims.</p>
+    <heading id="h-14">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-36" num="36">[00025] FIG. 1 presents an analog waveform.</p>
+    <p id="p-37" num="37">[00026] FIG. 2 is a diagram of a digital audio signal.</p>
+    <p id="p-38" num="38">[00027] FIG. 3 presents a flowchart for providing continuously variable time- frequency analysis of a digital audio signal.</p>
+    <boundary-data type="header">
+      <confidence value="8">8</confidence>
+    </boundary-data>
+    <boundary-data type="header">18814-016001 / P39<confidence value="54882">1OUS1</confidence>
+    </boundary-data>
+    <p id="p-39" num="39">
+      <page-break num="10"/>
+[00028] FIGS. 4a, 4b, and 4c depict a series of steps for upsampling a digital audio signal.    </p>
+    <p id="p-40" num="40">[00029] FIGS. 5a and 5b depict the alignment of a sliding window for a digital audio signal.</p>
+    <p id="p-41" num="41">[00030] FIGS. 6a, 6b, and 6c depict steps for overlapping and adding two windows of a digital audio signal.</p>
+    <p id="p-42" num="42">[00031] FIGS. 7a, 7b, and 7c depict a series of steps for downsampling a digital audio signal.</p>
+    <p id="p-43" num="43">[00032] FIG. 8 is a block diagram of a computer system.</p>
+    <p id="p-44" num="44">[00033] FIG. 9 describes a method for providing continuously variable time- frequency analysis of a digital audio signal.</p>
+    <p id="p-45" num="45">[00034] Like reference symbols indicate like elements throughout the specification and drawings.</p>
+    <heading id="h-15">DETAILED DESCRIPTION</heading>
+    <p id="p-46" num="46">[00035] A continuously variable time-frequency resolution can be provided during digital audio signal processing through resampling. For example, a digital audio signal can be resampled before it is converted into the frequency domain.</p>
+    <p id="p-47" num="47">After performing frequency domain processing, the digital audio signal can be resampled a second time once it has been converted back into the time domain.</p>
+    <p id="p-48" num="48">[00036] A Fourier transform can be used to convert a representation of an audio signal in the time domain into a representation of the audio signal in the frequency domain. Because an audio signal that is represented using a digital audio file is comprised of discrete samples instead of a continuous waveform, the conversion into the frequency domain can be performed using a Discrete Fourier Transform algorithm, such as the Fast Fourier Transform (FFT). FIG. 2 shows a digitized audio signal <part-num-ref name="digitized audio signal">200,</part-num-ref>
+ in which the waveform <part-num-ref name="waveform">205</part-num-ref>
+ is represented by a plurality o<confidence value="5">f</confidence>
+ discrete samples or points. The digitized audio signal <part-num-ref name="digitized audio signal">200</part-num-ref>
+ can be divided into a plurality of equal-sized blocks, such as a first block <part-num-ref name="first block">210,</part-num-ref>
+ a second block <part-num-ref name="second block">215,</part-num-ref>
+ and a last block <part-num-ref name="last block">220.</part-num-ref>
+ The number of samples included in each block <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56881">10US1</confidence>
+      </boundary-data>
+defines the block width. One or more blocks of the digitized audio signal <part-num-ref name="digitized audio signal">200,</part-num-ref>
+ such as the first block <part-num-ref name="first block">210</part-num-ref>
+ and the second block <part-num-ref name="second block">215,</part-num-ref>
+ can be transformed from the time domain into the frequency domain to permit frequency domain processing.    </p>
+    <p id="p-49" num="49">[00037] Because one or more of the blocks associated with the digitized audio signal <part-num-ref name="digitized audio signal">200</part-num-ref>
+ will be transformed using an FFT, the block width can be set to a power of <part-num-ref name="power of">2</part-num-ref>
+ that corresponds to the size of the FFT, such as <part-num-ref name="FFT, such as">512</part-num-ref>
+ samples, 1,024 samples, 2,048 samples, or 4,096 samples. In an implementation, if the last block <part-num-ref name="last block">220</part-num-ref>
+ includes fewer samples than are required to form a full block, one or more additional zero-value samples can be added to complete that block. For example, if the FFT size is 1,024 and the last block <part-num-ref name="last block">220</part-num-ref>
+ only includes <part-num-ref name="only includes">998</part-num-ref>
+ samples, <part-num-ref name="samples,">26</part-num-ref>
+ zero-value samples can be added to fill in the remainder of the block.    </p>
+    <p id="p-50" num="50">[00038] As discussed previously, the size of the FFT determines the time and frequency resolution. For example, if a digital audio signal with a sampling rate of 44.1kHz is transformed into the frequency domain using a 2,048 sample F<confidence value="588">FT,</confidence>
+ the 2,048 samples represent a portion of the digital audio signal lasting <part-num-ref name="digital audio signal lasting">46</part-num-ref>
+ milliseconds (2,048 samples/44,1000 samples per second). Similarly, a 1,024 sample FFT represents a portion of the digital audio signal lasting <part-num-ref name="digital audio signal lasting">23</part-num-ref>
+ milliseconds, or a period of time half as long. Thus, as the size of the FFT decreases, the duration of the portion of the digital audio signal being processed becomes shorter and the time resolution increases. Additionally, the FFT algorithm assumes that a signal is steady-state across an entire frame.    </p>
+    <p id="p-51" num="51">Therefore, changes in a signal, such as transients, are more easily detected through the use of an FFT that processes a small number samples.</p>
+    <p id="p-52" num="52">[00039] Conversely, the larger the size of the <confidence value="5">F</confidence>
+FT, the greater the frequency resolution. For example, if a digital audio signal produced using a sampling rate of 44.1kHz is transformed into the frequency domain using a 2,048 sample FFT, each frequency component represents 44.1kHz / 2,048 samples = 21.5 Hz.    </p>
+    <p id="p-53" num="53">Similarly, each frequency component of a 1,024 sample FFT represents 42.5 Hz, or twice the frequency range. Thus, the number of frequency components <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="56884">10US1</confidence>
+      </boundary-data>
+increases as the number of samples processed by the FFT grows larger, which results in a finer bandwidth being associated with each frequency component.    </p>
+    <p id="p-54" num="54">Consequently, the frequency resolution increases directly with the size of the FFT. Other methods also can be used to convert a digital audio signal into the frequency domain, such as a filter-bank or the Modified Discrete Cosine Transform (MDCT). Regardless of the transform method used, however, time- resolution and frequency-resolution are inversely aligned.</p>
+    <p id="p-55" num="55">[00040] The time-frequency resolution requirements of an audio processing algorithm can vary between audio signals or even between portions of a single audio signal. In some instances, the time-frequency resolution requirement may not correspond to the sizes available for the FFT algorithm, especially as the window size increases. It is possible, however, to use resampling to provide the time-frequency resolution required for a specific block of samples, thereby achieving continuously variable time-frequency resolution.</p>
+    <p id="p-56" num="56">[00041] FIG. 3 presents a flowchart describing an implementation for processing a portion of a digital audio signal using continuously variable time- frequency resolution. In this implementation, a block of samples is upsampled prior to a signal processing operation and then downsampled after the signal processing operation has been completed. In another implementation, the upsampling and downsampling operations can be reversed. A block of samples is input <part-num-ref name="block of samples is input">(305)</part-num-ref>
+ to the audio processing algorithm and can be designated as an input to the preprocessing resampler. The preprocessing resampler increases the number of samples in the block (310), which is also known as upsampling.    </p>
+    <p id="p-57" num="57">Through upsampling, the number of samples in the block is made to equal or exceed the size of the FFT. The resampled block can then be windowed <part-num-ref name="resampled block can then be windowed">(315)</part-num-ref>
+ using a sliding window and the samples included in the sliding window can be designated as input to an FFT. The width of the sliding window should equal the size of the FFT, so that all of the designated samples can be processed. As described above, the FFT can be used to transform the windowed samples from a time domain representation into a frequency domain representation (320). In performing the transform operation, the audio signal is divided into its component <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="15884">10USl</confidence>
+      </boundary-data>
+frequencies and the amplitude or intensity associated with each of the component frequencies is determined. The frequency resolution, or number of component frequencies that can be distinguished by the FFT, is equal to one-half of the window size. For example, a 1,024 sample FFT has a frequency resolution of <part-num-ref name="frequency resolution of">512</part-num-ref>
+ component frequencies or frequency bands. The <part-num-ref name="">512</part-num-ref>
+ component frequencies represent a linear division of the frequency spectrum of the audio signal, such as <part-num-ref name="audio signal, such as">0</part-num-ref>
+ Hz to half of the Nyquist frequency.    </p>
+    <p id="p-58" num="58">[00042] Once the received samples have been transformed by the FFT (320), the resulting spectral values can be analyzed or processed (325). As described above, the processing can include one or more of: filtering, time stretching, equalization, and compression. After the portion of the digital audio signal has been processed (325), the signal can be transformed back into the time domain using the inverse FFT (<confidence value="6686">IFFT</confidence>
+) algorithm (330). The IF<confidence value="55">FT</confidence>
+ algorithm transforms the processed spectral values from a frequency domain representation into a time domain representation. Through the transform operation, the spectral values are converted into samples that represent amplitudes of the waveform comprising the digital audio signal at various points in time.    </p>
+    <p id="p-59" num="59">[00043] Resampling the input signal and changing the size of the FFT can affect the location of specific frequency information because both the sampling rate and the size of the FFT affect the bandwidth of each frequency component.</p>
+    <p id="p-60" num="60">For example, a 2,048 sample FFT taken of a digital audio signal characterized by a sampling rate of 40kHz has a Nyquist frequency of 20kHz, and thus each spectral value represents <part-num-ref name="Nyquist frequency of 20kHz, and thus each spectral value represents">40</part-num-ref>
+ kHz <confidence value="5">/</confidence>
+ 2,048 sample <confidence value="5">F</confidence>
+FT, or 19.53 Hz per component frequency. Therefore, the spectral value representing <part-num-ref name="spectral value representing">30</part-num-ref>
+ Hz is contained in the second component frequency, assuming that the component frequencies are numbered starting with the lowest frequency. If the same signal was upsampled by 150% and a 4,096 sample FFT was used, the effective sampling rate would increase to 60kHz. Similarly, the Nyquist frequency would be <part-num-ref name="Nyquist frequency would be">30</part-num-ref>
+ kHz and each spectral value would represent <part-num-ref name="kHz and each spectral value would represent">60</part-num-ref>
+ kHz <confidence value="5">/</confidence>
+ 4,096 sample FFT, or 14.65 Hz per component frequency. Consequently, the spectral value representing <part-num-ref name="spectral value representing">30</part-num-ref>
+ Hz would be contained in the third component frequency.    </p>
+    <boundary-data type="header">
+      <confidence value="88">12</confidence>
+    </boundary-data>
+    <boundary-data type="header">18814-016001 / P39<confidence value="56885">10US1</confidence>
+    </boundary-data>
+    <p id="p-61" num="61">
+      <page-break num="14"/>
+[00044] Next, the digital audio signal can be resynthesized (335). The resynthesis operation <part-num-ref name="resynthesis operation">(335)</part-num-ref>
+ can include overlapping and adding successive blocks that are output from the <confidence value="66">IF</confidence>
+FT (330). For example, filtering in the frequency domain is often performed by overlapping and adding adjacent blocks to reduce ripple effects generated during processing. Furthermore, various windowing functions may benefit from overlapping and adding successive blocks output from the <confidence value="66">IF</confidence>
+FT (330). The degree of overlap in the sliding window <part-num-ref name="sliding window">(315)</part-num-ref>
+ may also affect the need to overlap and add the data output from the IFFT (330).    </p>
+    <p id="p-62" num="62">Therefore, the resynthesis operation <part-num-ref name="resynthesis operation">(335)</part-num-ref>
+ can include an overlap and add procedure. In another implementation, the resynthesis operation <part-num-ref name="resynthesis operation">(335)</part-num-ref>
+ can align successive windows output from the <confidence value="66">IF</confidence>
+FT without any overlap, such that they are adjacent to one another.    </p>
+    <p id="p-63" num="63">[00045] As a result of the preprocessing resample (310), the resynthesized digital audio signal has an increased sampling rate. To return the digital audio signal to the sampling rate by which it was characterized when it was input <part-num-ref name="sampling rate by which it was characterized when it was input">(305)</part-num-ref>
+ to the audio processing algorithm, the digital audio signal can be downsampled (340). Downsampling is the process by which the sampling rate of a signal is reduced. Downsampling also can reduce the transient diffusion caused by some processing algorithms, because it condenses the disruptions caused in the frequency domain by some processing algorithms. For example, if a block of a digital audio signal contains a transient, an algorithm that process the block in the frequency domain can spread the energy associated with the transient across other samples included in that block. If the block is downsampled, the number of samples containing energy associate with the transient can be reduced, thereby making the transient less audible.    </p>
+    <p id="p-64" num="64">[00046] Further, the digital audio signal is evaluated <part-num-ref name="digital audio signal is evaluated">(345)</part-num-ref>
+ to determine whether any portion rem<confidence value="8">a</confidence>
+ins to be input <part-num-ref name="to determine whether any portion remains to be input">(305)</part-num-ref>
+ into the audio processing algorithm. The final block can be automatically identified when the end of the digital audio signal has been reached. Alternatively, a final block can be specified by a user or by an audio processing algorithm. If the final block of the digital audio signal has been transformed and analyzed, the audio processing <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="66881">10US1</confidence>
+      </boundary-data>
+algorithm can be terminated (350). If the final block of the digital audio signal has not been transformed, an appropriate number of the remaining samples are provided as input <part-num-ref name="remaining samples are provided as input">(305)</part-num-ref>
+ to the audio processing algorithm.    </p>
+    <p id="p-65" num="65">[00047] FIGS. 4a, 4b, and 4c illustrate steps for upsampling a digital audio signal. As described with respect to FIG. 3, samples are input <part-num-ref name="digital audio signal. As described with respect to FIG. 3, samples are input">(305)</part-num-ref>
+ into the audio processing algorithm from the digital audio signal <part-num-ref name="digital audio signal">200</part-num-ref>
+ and upsampled (310). The digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ represents a portion of the digital audio signal <part-num-ref name="digital audio signal">200</part-num-ref>
+ that has been input <part-num-ref name="that has been input">(305)</part-num-ref>
+ into the audio processing algorithm. In order to upsample a signal, an upsampling factor is selected. The upsampling factor can be any real value greater than or equal to one. For example, the upsampling factor could be 3/2, or 1.5, which corresponds to a 50% increase in the sampling rate. Thus, a digital audio signal with a 44.1 kHz sampling rate that has been upsampled by a factor of 1.5 has an effective sampling rate of 66.15 kHz.    </p>
+    <p id="p-66" num="66">Consequently, the range of valid frequencies that satisfy the Nyquist sampling theorem is increased from 22.05 kHz to 33.075 kHz. In an implementation, the upsampling factor can be determined by the audio processing algorithm.</p>
+    <p id="p-67" num="67">Alternatively, the upsampling factor can be specified by a user.</p>
+    <p id="p-68" num="68">[00048] With respect to FIG. 3, the upsampling factor determines, at least in part, the time-frequency resolution provided to the audio signal processing algorithm (325). As discussed above, the FFT size corresponds to a power of <part-num-ref name="power of">2.</part-num-ref>
+    </p>
+    <p id="p-69" num="69">Because the audio processing algorithm dictates the time-frequency resolution processing requirements, it also dictates the size of the FFT that will be used. An FFT is selected such that it is greater than the time-frequency resolution required by the audio processing algorithm and the input samples can then be upsampled to correspond to the selected FFT. For example, if the audio processing algorithm requires a time resolution of 2,730 samples, which corresponds to a frequency resolution of 1,345 component frequencies, the smallest FFT capable of processing that number of samples, a 4,096 sample FFT, is selected. As a result, the selected portion of the digital audio signal is <confidence value="222222222">upsampled</confidence>
+ accordingly.    </p>
+    <p id="p-70" num="70">In order for the selected portion of the digital audio signal to be processed by a <boundary-data type="header">
+        <confidence value="88">14</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="54885">1OUS1</confidence>
+      </boundary-data>
+4,096 sample FFT, the 2,730 samples must be upsampled by a factor of approximately 3/2 (4,096/2,730 equals 1.5004).    </p>
+    <p id="p-71" num="71">[00049] After the upsampling factor has been selected, band-limited interpolation can be used to perform the upsampling operation. Band-limited interpolation provides very good results, but can be computationally intensive. In another implementation, a simpler method, such as a first order approximation, can be used to upsample the signal. A first order approximation copies samples from the original signal at a rate approximating the inverse of the upsampling factor. For example, if the upsampling factor is 3/2, samples are copied from the original signal at a relative rate of every 2/3 sample.</p>
+    <p id="p-72" num="72">[00050] FIG. 4a shows a digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ contained in a window <part-num-ref name="window">405</part-num-ref>
+ prior to upsampling. The digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ can be represented by sample points spaced along a time axis <part-num-ref name="time axis">410.</part-num-ref>
+ A first original sample <part-num-ref name="first original sample">420</part-num-ref>
+ is aligned on the time axis <part-num-ref name="time axis">410</part-num-ref>
+ with a first hash mark <part-num-ref name="first hash mark">425.</part-num-ref>
+ Likewise, a second original sample <part-num-ref name="second original sample">430</part-num-ref>
+ is aligned on the time axis <part-num-ref name="time axis">410</part-num-ref>
+ with a second hash mark <part-num-ref name="second hash mark">435,</part-num-ref>
+ and a third original sample <part-num-ref name="third original sample">440</part-num-ref>
+ is aligned with the time axis <part-num-ref name="time axis">410</part-num-ref>
+ at a third hash mark <part-num-ref name="third hash mark">445.</part-num-ref>
+ In this implementation, the hash marks, including the first, second and third hash marks <part-num-ref name="first, second and third hash marks">425,</part-num-ref>
+ <part-num-ref name="first, second and third hash marks 425,">435,</part-num-ref>
+ and <part-num-ref name="first, second and third hash marks 425, 435, and">445,</part-num-ref>
+ are evenly spaced, indicating that the samples, including the first, second and third samples <part-num-ref name="first, second and third samples">420,</part-num-ref>
+ <part-num-ref name="first, second and third samples 420,">430,</part-num-ref>
+ and <part-num-ref name="first, second and third samples 420, 430, and">440</part-num-ref>
+ respectively, are separated by equal periods of time.    </p>
+    <p id="p-73" num="73">[00051] Because the upsampling factor is a ratio of the sampling frequencies of the original signal and the upsampled signal, the inverse of the upsampling factor represents the ratio of the periods between samples of the original signal and the upsampled signal. As discussed above, a first order approximation can be used to copy samples from the digital audio signal every 1/upsampling factor period.</p>
+    <p id="p-74" num="74">For example, assuming an upsampling factor of 3/2, a first order approximation copies samples at multiples of 2/3 of the original signal. If an original sample is located at a point representing a multiple of 2/3 of the original signal time index, the original sample is copied, otherwise the closest in time sample point is copied.</p>
+    <boundary-data type="header">
+      <confidence value="88">15</confidence>
+    </boundary-data>
+    <boundary-data type="header">18814-0<confidence value="5">1</confidence>
+600<confidence value="5">1</confidence>
+ <confidence value="8">/</confidence>
+ P39<confidence value="54882">1OUS1</confidence>
+    </boundary-data>
+    <p id="p-75" num="75">
+      <page-break num="17"/>
+[00052] Referring to FIG. 4b, the digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ can be upsampled at a rate of 3/2 to produce an upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450.</part-num-ref>
+ Samples located on the time axis at multiples of 2/3 (e.g., <part-num-ref name="">0,</part-num-ref>
+ 2/3, 4/3, <part-num-ref name="0, 2/3, 4/3,">
+        <confidence value="88">2,</confidence>
+      </part-num-ref>
+ 8/3, etc.) are copied. If no sample is located at the position of a multiple along the time axis, the closest in time sample is copied. Diamond symbols, such as the second copied sample <part-num-ref name="second copied sample">480,</part-num-ref>
+ denote copied samples, which represent the upsampled signal. The first original sample <part-num-ref name="first original sample">420,</part-num-ref>
+ aligned on the first hash mark <part-num-ref name="first hash mark">425,</part-num-ref>
+ is the zero multiple of 2/3, so the first original sample <part-num-ref name="first original sample">420</part-num-ref>
+ is copied. The second copied sample <part-num-ref name="second copied sample">480,</part-num-ref>
+ aligned on the 2/3 hash mark <part-num-ref name="2/3 hash mark">485</part-num-ref>
+ is closest in time to the second original sample <part-num-ref name="second original sample">430,</part-num-ref>
+ <confidence value="66">so</confidence>
+ the amplitude value associated with the second original sample <part-num-ref name="second original sample">430</part-num-ref>
+ is copied to the second copied sample <part-num-ref name="second copied sample">480.</part-num-ref>
+ Similarly, the fourth copied sample <part-num-ref name="fourth copied sample">490,</part-num-ref>
+ aligned on the 4/3 hash mark <part-num-ref name="4/3 hash mark">495</part-num-ref>
+ is also closest in time to the second original sample <part-num-ref name="second original sample">430,</part-num-ref>
+ so the amplitude value associated with the second original sample <part-num-ref name="second original sample">430</part-num-ref>
+ is also copied to the fourth copied sample <part-num-ref name="fourth copied sample">490.</part-num-ref>
+ This process can be repeated to derive the remaining copied samples.    </p>
+    <p id="p-76" num="76">[00053] FIG. 4c represents the upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450.</part-num-ref>
+ The second copied sample <part-num-ref name="second copied sample">480</part-num-ref>
+ and the fourth copied sample <part-num-ref name="fourth copied sample">490</part-num-ref>
+ represent two of the samples comprising the upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450.</part-num-ref>
+ Note that the upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450</part-num-ref>
+ has more samples over the same period of time than the digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ from which it was produced. As presented, the digital audio signal <part-num-ref name="digital audio signal">400</part-num-ref>
+ has 2/3 the number of samples as the upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450,</part-num-ref>
+ which corresponds to the upsampling ratio. The shape of the upsampled digital audio signal <part-num-ref name="upsampled digital audio signal">450,</part-num-ref>
+ through the inclusion of additional samples, does not perfectly match the shape of the digital audio signal <part-num-ref name="digital audio signal">400.</part-num-ref>
+    </p>
+    <p id="p-77" num="77">Consequently, some distortion has been created by the upsampling process. A smoothing, low-pass filter can be applied to digital audio signal <part-num-ref name="smoothing, low-pass filter can be applied to digital audio signal">450</part-num-ref>
+ to reduce this distortion.    </p>
+    <p id="p-78" num="78">[00054] FIGS. 5a and <confidence value="5">5</confidence>
+b depict the alignment of a sliding window for a digital audio signal <part-num-ref name="digital audio signal">500.</part-num-ref>
+ FIG. <confidence value="5">5</confidence>
+a depicts the alignment of a sliding window for a previous iteration of the process illustrated in FIG. 3. FIG. <confidence value="5">5</confidence>
+b depicts the alignment of a sliding window associated with the current iteration of the process <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56881">10USl</confidence>
+      </boundary-data>
+illustrated in FIG. 3. The digital audio signal <part-num-ref name="digital audio signal">500</part-num-ref>
+ depicts a portion of the digital audio signal <part-num-ref name="digital audio signal">200</part-num-ref>
+ that has been upsampled. A start time <part-num-ref name="start time">505</part-num-ref>
+ is associated with the digital audio signal <part-num-ref name="digital audio signal">500.</part-num-ref>
+ With respect to FIG. 5a, a sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ can be positioned along the digital audio signal <part-num-ref name="digital audio signal">500</part-num-ref>
+ at a first position <part-num-ref name="first position">520,</part-num-ref>
+ such that the start of the sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ is aligned with the start time <part-num-ref name="start time">505</part-num-ref>
+ of the digital audio signal <part-num-ref name="digital audio signal">500.</part-num-ref>
+ As described with respect to FIG. 3, the portion of the digital audio signal <part-num-ref name="digital audio signal">500</part-num-ref>
+ that occurs in the sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ at the first position <part-num-ref name="first position">520</part-num-ref>
+ can be transformed into the frequency domain using an FFT (310). Before the digital audio signal <part-num-ref name="digital audio signal">500</part-num-ref>
+ is transformed into the frequency domain, however, the sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ at the first position <part-num-ref name="first position">520</part-num-ref>
+ is applied to the samples to reduce any high frequency edge effects. The width of the window <part-num-ref name="window">515</part-num-ref>
+ is selected to correspond to the size of the FFT. For example, if the FFT size is 4,096 samples, the window size is also set to 4,096 samples. Further, the shape of the window can be tailored to suit the audio processing algorithm (32<confidence value="588">5).</confidence>
+    </p>
+    <p id="p-79" num="79">[00055] FIG. <confidence value="5">5</confidence>
+b depicts the alignment of a sliding window associated with the current iteration of the process illustrated in FIG. 3. The sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ can be positioned along the digital audio signal <part-num-ref name="digital audio signal">
+        <confidence value="666">500</confidence>
+      </part-num-ref>
+ at a second position <part-num-ref name="second position">
+        <confidence value="5">5</confidence>
+25.      </part-num-ref>
+ The sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ at the first position <part-num-ref name="first position">
+        <confidence value="5">5</confidence>
+20      </part-num-ref>
+ and the sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ at the second position <part-num-ref name="second position">
+        <confidence value="686">525</confidence>
+      </part-num-ref>
+ can have a degree of overlap. As described with respect to FIG. 3, the portion of the digital audio signal <part-num-ref name="digital audio signal">
+        <confidence value="666">500</confidence>
+      </part-num-ref>
+ in the sliding window <part-num-ref name="sliding window">515</part-num-ref>
+ at the second position <part-num-ref name="second position">
+        <confidence value="686">525</confidence>
+      </part-num-ref>
+ can be transformed into the frequency domain using an FFT (310).    </p>
+    <p id="p-80" num="80">[00056] FIGS. 6a, 6b and 6c depict overlapping and adding two windows of a digital audio signal. FIG 6a depicts a block <part-num-ref name="block">615</part-num-ref>
+ of a digital audio signal <part-num-ref name="digital audio signal">620</part-num-ref>
+ that has been output from an IFFT <part-num-ref name="IFFT">(330)</part-num-ref>
+ algorithm during a previous iteration of the process illustrated in FIG. 3. A start time <part-num-ref name="start time">60<confidence value="5">5</confidence>
+      </part-num-ref>
+ and a stop time <part-num-ref name="stop time">610</part-num-ref>
+ are associated with the digital audio signal <part-num-ref name="digital audio signal">620.</part-num-ref>
+ Similarly, FIG. 6b depicts a block <part-num-ref name="block">64<confidence value="5">5</confidence>
+      </part-num-ref>
+ of a digital audio signal <part-num-ref name="digital audio signal">6<confidence value="5">5</confidence>
+0      </part-num-ref>
+ output from an IFFT <part-num-ref name="IFFT">(330)</part-num-ref>
+ algorithm during the current iteration of the process illustrated in FIG. 3. A start time <part-num-ref name="start time">635</part-num-ref>
+ and a stop time <part-num-ref name="stop time">640</part-num-ref>
+ are associated with the digital audio signal <part-num-ref name="digital audio signal">650.</part-num-ref>
+ The block <part-num-ref name="block">615</part-num-ref>
+ of the digital audio signal <part-num-ref name="digital audio signal">620</part-num-ref>
+ and the block <part-num-ref name="block">64<confidence value="5">5</confidence>
+      </part-num-ref>
+ of the digital audio signal <part-num-ref name="digital audio signal">6<confidence value="5">5</confidence>
+0      </part-num-ref>
+ can be added <boundary-data type="header">
+        <confidence value="88">17</confidence>
+      </boundary-data>
+      <page-break num="19"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="56884">10US1</confidence>
+      </boundary-data>
+together using superposition to compensate for a tail created from processing a digital audio signal in the frequency domain, and from the overlapping input windows (315). Through the addition, the block <part-num-ref name="block">615</part-num-ref>
+ and the block <part-num-ref name="block">645</part-num-ref>
+ are resynthesized <part-num-ref name="are resynthesized">(335)</part-num-ref>
+ into a continuous digital audio signal <part-num-ref name="continuous digital audio signal">675,</part-num-ref>
+ as shown in FIG.    </p>
+    <p id="p-81" num="81">6c.</p>
+    <p id="p-82" num="82">[00057] With respect to FIG. 3, after the signal has been resynthesized (355), the signal can be downsampled (340). To return a digital audio signal to its original sampling rate, the downsampling factor representing the inverse of the upsampling factor used in the preprocessing resampling <part-num-ref name="preprocessing resampling">(310)</part-num-ref>
+ can be selected.    </p>
+    <p id="p-83" num="83">For example, if the upsampling factor used in the preprocessing resampling <part-num-ref name="preprocessing resampling">(310)</part-num-ref>
+ was 3/2, a downsampling factor of 2/3 can be selected. If a digital audio signal contains frequencies higher than the Nyquist frequency of the downsampling rate, the downsampled digital audio signal can contain aliasing artifacts. To prevent aliasing, a <confidence value="885">low</confidence>
+-pass filter can be applied to the digital audio signal prior to downsampling.    </p>
+    <p id="p-84" num="84">[00058] Band-limited interpolation also can be used to downsample the signal in accordance with <confidence value="222222222222">the.selected</confidence>
+ downsampling factor. If band-limited interpolation is used, an additional low-pass filter need not be included because band-limited interpolation inherently filters the digital audio signal. In another implementation, a simpler resampling method, such as a first order approximation, can be used to downsample the signal.    </p>
+    <p id="p-85" num="85">[00059] FIG. 7a shows a digital audio signal <part-num-ref name="digital audio signal">700</part-num-ref>
+ contained in a window <part-num-ref name="window">705</part-num-ref>
+ prior to downsampling. The digital audio signal <part-num-ref name="digital audio signal">700</part-num-ref>
+ can be represented by sa<confidence value="8">m</confidence>
+ple points spaced along a time axis <part-num-ref name="time axis">710.</part-num-ref>
+ A first original sample <part-num-ref name="first original sample">720</part-num-ref>
+ is aligned on the time axis <part-num-ref name="time axis">710</part-num-ref>
+ at a first hash mark <part-num-ref name="first hash mark">725.</part-num-ref>
+ Likewise, a second original sample <part-num-ref name="second original sample">730</part-num-ref>
+ is aligned on the time axis <part-num-ref name="time axis">710</part-num-ref>
+ at a second hash mark <part-num-ref name="second hash mark">735.</part-num-ref>
+ The hash marks on the time axis <part-num-ref name="time axis">710,</part-num-ref>
+ including the first and second hash marks <part-num-ref name="first and second hash marks">725</part-num-ref>
+ and <part-num-ref name="and">735,</part-num-ref>
+ are evenly spaced, indicating that the samples, including the first and second original samples <part-num-ref name="first and second original samples">720</part-num-ref>
+ and <part-num-ref name="and">730,</part-num-ref>
+ respectively, are separated by equal periods of time. As discussed above, because the downsampling factor is a ratio of the sampling frequencies of the original signal and the downsampled signal, <boundary-data type="header">
+        <confidence value="88">18</confidence>
+      </boundary-data>
+      <page-break num="20"/>
+      <boundary-data type="header">18814-016001 / P39<confidence value="54888">1OUS1</confidence>
+      </boundary-data>
+the inverse of the downsampling factor represents the ratio of the periods between samples of the original signal and the downsampled signal.    </p>
+    <p id="p-86" num="86">[00060] Referring to FIG. 7b, the digital audio signal <part-num-ref name="digital audio signal">700</part-num-ref>
+ can be downsampled <confidence value="6">'</confidence>
+ at a rate of 2/3 to produce a downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750.</part-num-ref>
+ Samples located on the time axis <part-num-ref name="time axis">710</part-num-ref>
+ at multiples of 3/2 (e.g., <part-num-ref name="">0,</part-num-ref>
+ 3/2, <part-num-ref name="0, 3/2,">3,</part-num-ref>
+ 9/2, <part-num-ref name="0, 3/2, 3, 9/2,">6,</part-num-ref>
+ etc.) are copied. If a sample is located at the position of a multiple of the inverse downsampling rate along the time axis <part-num-ref name="time axis">710,</part-num-ref>
+ the sample is copied, otherwise the closest in time sample is copied. A default rule can be specified for the circumstance in which the position corresponding to a multiple falls evenly between two samples. For example, the previous sample always can be copied in such a case. Diamond symbols, such as the second copied sample <part-num-ref name="second copied sample">740,</part-num-ref>
+ denote copied samples, which correspond to the downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750.</part-num-ref>
+ The first original sample <part-num-ref name="first original sample">720,</part-num-ref>
+ aligned on the first hash mark <part-num-ref name="first hash mark">725,</part-num-ref>
+ is the zero multiple of 3/2, and is therefore copied. The second copied sample <part-num-ref name="second copied sample">740,</part-num-ref>
+ representing the first multiple of 3/2, is aligned on the 3/2 hash mark <part-num-ref name="3/2 hash mark">745</part-num-ref>
+ and is equidistant from the second original sample <part-num-ref name="second original sample">730</part-num-ref>
+ and the third original sample <part-num-ref name="third original sample">760.</part-num-ref>
+ Thus, the amplitude value associated with the second original sample <part-num-ref name="second original sample">730</part-num-ref>
+ is copied to the location of the second copied sample <part-num-ref name="second copied sample">740.</part-num-ref>
+ This process is can be repeated for the remaining samples to derive the remaining copied samples.    </p>
+    <p id="p-87" num="87">[00061] FIG. 7c represents the downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750.</part-num-ref>
+ The second copied sample <part-num-ref name="second copied sample">740</part-num-ref>
+ and the third copied sample <part-num-ref name="third copied sample">750</part-num-ref>
+ represent two of the samples comprising the downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750.</part-num-ref>
+ Note that the downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750</part-num-ref>
+ has fewer samples over the same period of time than the digital audio signal <part-num-ref name="digital audio signal">700</part-num-ref>
+ from which it was derived. The digital audio signal <part-num-ref name="digital audio signal">700</part-num-ref>
+ has 3/2 the number of samples as the downsampled digital audio signal <part-num-ref name="downsampled digital audio signal">750,</part-num-ref>
+ which corresponds to the downsampling ratio.    </p>
+    <p id="p-88" num="88">[00062] In another implementation, the preprocessing resample <part-num-ref name="preprocessing resample">(310)</part-num-ref>
+ can be a downsampling process as depicted in FIGS. 7a, 7b, and 7c and described above.    </p>
+    <p id="p-89" num="89">If the preprocessing resample <part-num-ref name="preprocessing resample">(310)</part-num-ref>
+ is a downsampling process, then the postprocessing resample <part-num-ref name="postprocessing resample">(340)</part-num-ref>
+ can be an upsampling process as depicted in FIGS. 4a and 4b and described above. Performing downsampling during the <boundary-data type="header">
+        <confidence value="88">19</confidence>
+      </boundary-data>
+      <page-break num="21"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="56884">10US1</confidence>
+      </boundary-data>
+preprocessing resample <part-num-ref name="preprocessing resample">(310)</part-num-ref>
+ can be used to increase the frequency resolution while reducing the time resolution of a block of samples. For example, a block of 5,000 samples can be downsampled to produce a block of 4,096 samples, which can then be input into a standard sized FFT (320). Because larger FFTs require greater processing power, downsampling during the preprocessing resample (310), and thereby using a smaller FFT (320), can reduce the computational costs of an audio processing algorithm.    </p>
+    <p id="p-90" num="90">[00063] FIG. 8 presents a computer system <part-num-ref name="computer system">800</part-num-ref>
+ that can be used to implement the techniques described above for processing and playing back a digital audio signal. The computer system <part-num-ref name="computer system">800</part-num-ref>
+ includes a microphone <part-num-ref name="microphone">840</part-num-ref>
+ for receiving an audio signal. The microphone <part-num-ref name="microphone">840</part-num-ref>
+ is coupled to a bus <part-num-ref name="bus">805</part-num-ref>
+ that can be used to transfer the audio signal to one or more additional components. The bus <part-num-ref name="bus">805</part-num-ref>
+ can be comprised of one or more physical busses and permits communication between all of the components included in the computer system <part-num-ref name="computer system">800.</part-num-ref>
+ A processor <part-num-ref name="processor">810</part-num-ref>
+ can be used to digitize the received audio signal and the resulting digitized audio signal can be transferred to storage <part-num-ref name="resulting digitized audio signal can be transferred to storage">825,</part-num-ref>
+ such as a hard drive, flash drive, or other readable and writeable medium. Alternately, the digitized audio signal can be stored in a random access memory (RAM) <part-num-ref name="random access memory (RAM)">815.</part-num-ref>
+    </p>
+    <p id="p-91" num="91">[00064] The digitized audio signals available in the computer system <part-num-ref name="computer system">800</part-num-ref>
+ can be displayed along with operations involving the digital audio signals via an output/display device <part-num-ref name="output/display device">830,</part-num-ref>
+ such as a monitor, liquid crystal display panel, printer, or other such output device. An input <part-num-ref name="input">835</part-num-ref>
+ comprising one or more input devices also can be included to receive instructions and information. For example, the input <part-num-ref name="input">835</part-num-ref>
+ can include one or more of a mouse, a keyboard, a touch pad, a touch screen, a joystick, a cable interface, and any other such input devices known in the art. Further, audio signals also can be received by the computer system <part-num-ref name="computer system">800</part-num-ref>
+ through the input <part-num-ref name="input">835.</part-num-ref>
+ Additionally, a read only memory (ROM) <part-num-ref name="read only memory (ROM)">820</part-num-ref>
+ can be included in the computer system <part-num-ref name="computer system">800</part-num-ref>
+ for storing information, such as sound processing parameters and instructions.    </p>
+    <p id="p-92" num="92">[00065] An audio signal, or any portion thereof, can be processed in the computer system <part-num-ref name="computer system">800</part-num-ref>
+ using the processor <part-num-ref name="processor">810.</part-num-ref>
+ In addition to digitizing received <boundary-data type="header">
+        <confidence value="88">20</confidence>
+      </boundary-data>
+      <page-break num="22"/>
+      <boundary-data type="header">
+        <confidence value="5">1</confidence>
+8814-016001 / P39<confidence value="66885">10US1</confidence>
+      </boundary-data>
+audio signals, the processor <part-num-ref name="processor">810</part-num-ref>
+ also can be used to perform analysis, editing and playback functions, including the transient detection techniques described above. Further, the audio signal processing functions, including a function that requires continuously variable time-frequency resolution, also can be performed by a signal processor <part-num-ref name="signal processor">850.</part-num-ref>
+ Thus, the processor <part-num-ref name="processor">810</part-num-ref>
+ and the signal processor <part-num-ref name="signal processor">850</part-num-ref>
+ can perform any portion of the audio signal processing functions independently or cooperatively. Additionally, the computer system <part-num-ref name="computer system">800</part-num-ref>
+ includes an output <part-num-ref name="output">845,</part-num-ref>
+ such as a speaker or an audio interface, through which audio signals can be played back.    </p>
+    <p id="p-93" num="93">[00066] FIG. 9 describes a method of providing continuously variable time- frequency resolution in an audio processing algorithm. In a first step <part-num-ref name="first step">900,</part-num-ref>
+ a portion of an input digital audio signal is selected. In a second step <part-num-ref name="second step">905,</part-num-ref>
+ the selected portion of the input digital audio signal can be resampled. In a third step <part-num-ref name="third step">910,</part-num-ref>
+ a plurality of spectral characteristics associated with the resampled portion of the input digital audio signal can be generated. Once the plurality of spectral characteristics have been generated, the fourth step <part-num-ref name="fourth step">915</part-num-ref>
+ is to generate a portion of an output digital audio signal from the plurality of spectral characteristics. In a fifth step <part-num-ref name="fifth step">920,</part-num-ref>
+ the portion of the output digital audio signal can be resampled.    </p>
+    <p id="p-94" num="94">[00067] A number of implementations have been disclosed herein.</p>
+    <p id="p-95" num="95">Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the claims. Accordingly, other implementations are within the scope of the following claims.</p>
+    <boundary-data type="header">
+      <confidence value="88">21</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11266990.xml

@@ -0,0 +1 @@
+<?xml version="1.0" encoding="utf-8"?><pat:SpecificationDocument xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:pat="urn:us:gov:doc:uspto:patent" xmlns:ent="urn:us:gov:doc:uspto:enterprise" xmlns="urn:us:gov:doc:uspto:patent" xmlns:tbl="http://www.oasis-open.org/tables/exchange/1.0" xmlns:com="http://www.wipo.int/standards/XMLSchema/Common/1" xsi:schemaLocation="urn:us:gov:doc:uspto:patent XML_SCHEMAS/V1_3/SpecificationDocument_1_0.xsd" pat:instanceFileName="11266990.08-05-2013.HK2P1N9YPXXIFW2.SPEC.XML" pat:id="HK2P1N9YPXXIFW2"><pat:DocumentCode>SPEC</pat:DocumentCode><pat:DocumentHeaderDetails pat:id="ID-00001"><pat:ApplicationHeaderDetails><pat:ApplicationNumber>11266990</pat:ApplicationNumber></pat:ApplicationHeaderDetails><pat:PageTotalQuantity>2</pat:PageTotalQuantity><pat:ParagraphTotalQuantity>8</pat:ParagraphTotalQuantity></pat:DocumentHeaderDetails><pat:MailRoomDate>2013-08-05</pat:MailRoomDate><pat:DocumentCreateDateText>2014-01-11</pat:DocumentCreateDateText><pat:DocumentTitle>SPECIFICATION DOCUMENT</pat:DocumentTitle><pat:Specification><?PageStart number='1'?><pat:P pat:pNumber="1" pat:id="p-1"><pat:BoundaryData><pat:HeaderText>App<pat:OCRConfidenceData pat:levelNumber='66'>li</pat:OCRConfidenceData>cation No.: 11/266,990</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber='86'>Fi</pat:OCRConfidenceData>led: 11/4/2005</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Attorney Docket No.: L<pat:OCRConfidenceData pat:levelNumber='5'>O</pat:OCRConfidenceData>T920050109US1 (7501-020U)</pat:HeaderText></pat:BoundaryData></pat:P><pat:Heading pat:id="h-1">AMENDMENTS TO THE SPECIFICATION</pat:Heading><pat:P pat:pNumber="2" pat:id="p-2">Please amend paragraph [0019] as follows: </pat:P><pat:P pat:pNumber="3" pat:id="p-3">[0019][[.]] Turning now to Figure 3, a flow chart is shown which illustrates a process for moving static elements for a document between an external file and the document in a document editor in the system of Figure 1. <pat:PartName pat:idref='PN-00001'>Beginning in block</pat:PartName> <pat:PartNumber pat:id='PN-00001'>305</pat:PartNumber>, an instruction can be received which can include an automated de-externalize or an automated re-externalize instruction. <pat:PartName pat:idref='PN-00002'>In decision block</pat:PartName> <pat:PartNumber pat:id='PN-00002'>310</pat:PartNumber>, if the instruction is one to perform automated [[re]]<pat:OCRConfidenceData pat:levelNumber='66'>de</pat:OCRConfidenceData>-externalization, the <pat:PartName pat:idref='PN-00003'>process can continue through block</pat:PartName> <pat:PartNumber pat:id='PN-00003'>315</pat:PartNumber>. <pat:PartName pat:idref='PN-00004'>In decision block</pat:PartName> <pat:PartNumber pat:id='PN-00004'>355</pat:PartNumber>, if the instruction is one to perform automated [[de]<pat:OCRConfidenceData pat:levelNumber='665'>]re</pat:OCRConfidenceData>-externalization, the <pat:PartName pat:idref='PN-00005'>process can continue through block</pat:PartName> <pat:PartNumber pat:id='PN-00005'>360</pat:PartNumber>. Otherwise, the <pat:PartName pat:idref='PN-00006'>process can end in block</pat:PartName> <pat:PartNumber pat:id='PN-00006'>390</pat:PartNumber>. </pat:P><pat:P pat:pNumber="4" pat:id="p-4">Please amend paragraph [0022] as follows: </pat:P><pat:P pat:pNumber="5" pat:id="p-5">[0022]   Now considering the automated re-externalization process of Figure 3, <pat:PartName pat:idref='PN-00007'>beginning in block</pat:PartName> <pat:PartNumber pat:id='PN-00007'>360</pat:PartNumber>, static elements, such as text strings, can be located within the subject document. <pat:PartName pat:idref='PN-00008'>In decision block</pat:PartName> <pat:PartNumber pat:id='PN-00008'>365</pat:PartNumber>, if a static element is located, <pat:PartName pat:idref='PN-00009'>in block</pat:PartName> <pat:PartNumber pat:id='PN-00009'>370</pat:PartNumber>, an entry for the static element can be added to an external file. The entry can include the static element in addition to a reference to the static element. In this regard, <pat:PartName pat:idref='PN-00010'>in decision block</pat:PartName> <pat:PartNumber pat:id='PN-00010'>375</pat:PartNumber> it can be <pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber='8'>3</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData><?PageStart number='2'?><pat:BoundaryData><pat:HeaderText>App<pat:OCRConfidenceData pat:levelNumber='66'>li</pat:OCRConfidenceData>cation No.: 11/266,990</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber='86'>Fi</pat:OCRConfidenceData>led: 11/4/2005</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Attorney Docket No.: L<pat:OCRConfidenceData pat:levelNumber='5'>O</pat:OCRConfidenceData>T920050109US1 (7501-020U)</pat:HeaderText></pat:BoundaryData>determined whether a commented tag can be located in proximity to the static element. If so, the commented tag can be ret<pat:OCRConfidenceData pat:levelNumber='68'>ri</pat:OCRConfidenceData>eved and a static element reference can be extracted in block and used as the reference in the entry in the external file. Otherwise, a <pat:PartName pat:idref='PN-00011'>static element reference can be generated in block</pat:PartName> <pat:PartNumber pat:id='PN-00011'>380</pat:PartNumber> and used in the entry in the external file. Finally, <pat:PartName pat:idref='PN-00012'>in block</pat:PartName> <pat:PartNumber pat:id='PN-00012'>385</pat:PartNumber> the static element in the document can be replaced with the static element reference. Subsequently, the <pat:PartName pat:idref='PN-00013'>process can end in block</pat:PartName> <pat:PartNumber pat:id='PN-00013'>390</pat:PartNumber>. </pat:P><pat:P pat:pNumber="6" pat:id="p-6">Please amend paragraph [0024] as follows: </pat:P><pat:P pat:pNumber="7" pat:id="p-7">[0024] For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, or semiconductor system (or apparatus or device). Examples of a computer[[-]]readable storage medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk read only memory (CD-ROM), compact disk - read/write (CD-R/W) and DVD. </pat:P><pat:P pat:pNumber="8" pat:id="p-8"><pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber='8'>4</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData></pat:P></pat:Specification></pat:SpecificationDocument>

applicant/11278582.xml

@@ -0,0 +1,931 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11278582</doc-number>
+        <date>2006-04-04</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">
+      <confidence value="888">PAT</confidence>
+ENT    </boundary-data>
+    <boundary-data type="header">Docket No. P<confidence value="55">S0</confidence>
+5 0731<confidence value="664">US1</confidence>
+    </boundary-data>
+    <heading id="h-1">COMMUNICATION IDENTIFIER LIST CONFIGURATION</heading>
+    <heading id="h-2">TECHNICAL <confidence value="8">F</confidence>
+IELD O<confidence value="8">F</confidence>
+ THE INVENTION    </heading>
+    <p id="p-1" num="1">
+      <confidence value="5">[</confidence>
+0001<confidence value="5">]</confidence>
+   Implementations described herein relate generally to electronic devices, and more particularly, to operations that may be associated with communication devices.    </p>
+    <heading id="h-3">DESCRIPTION OF RELAT<confidence value="8">E</confidence>
+D ART    </heading>
+    <p id="p-2" num="2">[0002<confidence value="5">]</confidence>
+ Communication devices, such as mobile terminals, may be used by individuals f<confidence value="68">or</confidence>
+ com<confidence value="8">m</confidence>
+un<confidence value="8">i</confidence>
+cating with users of other communication devices. For example, a communication device may be used to place/receive calls and <confidence value="222222222222">send/receive</confidence>
+ text messages <confidence value="2222222">to/from</confidence>
+ other communication devices having unique identifiers, e.g., phone numbers. The communication device may generate and maintain a log of the phone numbers identifying the communication devices with which the communication device co<confidence value="8">m</confidence>
+municates.    </p>
+    <p id="p-3" num="3">[0003<confidence value="5">]</confidence>
+   The phone number l<confidence value="8">o</confidence>
+gs may be used to form displayable call lists such as "recent calls," "missed calls," "dialed calls," and "received calls." A displayed phone number <confidence value="5">m</confidence>
+ay be dialed from the communication device, f<confidence value="5">o</confidence>
+r instance, by scrolling the call list to the desired pho<confidence value="8">n</confidence>
+e number, and then activating a single "call" or "send" key. Thus, the call list functions as a phone number directory, and the send key offers a simplified alternative to individually entering the digits of the phone number of the recipient.    </p>
+    <p id="p-4" num="4">[0004] A user-friendly feature of communication device typically includes providing a list of recent calls as either the default display or the most readily displayable call list which is accessible from a standby mode of the communication device. However, recency is not necessarily the <confidence value="8">b</confidence>
+est single predictor of the particular phone number that an individual is most likely to call at any given time from the co<confidence value="8">m</confidence>
+munication device.    </p>
+    <heading id="h-4">SUMMARY</heading>
+    <p id="p-5" num="5">
+      <confidence value="5">[</confidence>
+0005]   According to one aspect, a communication device may comprise a memory to store a first call l<confidence value="5">o</confidence>
+g; logic configured to generate a f<confidence value="8">i</confidence>
+rst call list based on the first call log, the first call <confidence value="868">-l-</confidence>
+ <page-break num="2"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. P<confidence value="5">S</confidence>
+05 073 <confidence value="6885">lUS1</confidence>
+      </boundary-data>
+list including a first set of party identifiers that are arranged in an order based on call frequency information respectively associated with the party identifiers; and a display to display at least a portion of the first call list.    </p>
+    <p id="p-6" num="6">[0006]    Additionally, t<confidence value="5">h</confidence>
+e call frequency information may correspond to at least one of time of day information or day of week <confidence value="22222222222">infonnation</confidence>
+.    </p>
+    <p id="p-7" num="7">[0007<confidence value="5">]</confidence>
+    Additionally, the communication device may also comprise a calendar to store calendar information, the order being further based on the stored calendar information.    </p>
+    <p id="p-8" num="8">[0008<confidence value="4">]</confidence>
+    Additionally, the communication device may also comprise a user interface, the displayed party identifiers being selectable via the user interface, the logic being further configured to generate a second call list based on a first selected one of the party identifiers.    </p>
+    <p id="p-9" num="9">[0009]    Additionally, the second call list may comprise a second set of party identifiers associated with the f<confidence value="8">i</confidence>
+rst selected party identifier<confidence value="5">.</confidence>
+    </p>
+    <p id="p-10" num="10">
+      <confidence value="866666">[0010]</confidence>
+    Additionally, the second set <confidence value="68">of</confidence>
+ party identifiers <confidence value="5">m</confidence>
+ay be ordered based on a degree of association with the first selected party identifier.    </p>
+    <p id="p-11" num="11">[0011<confidence value="5">]</confidence>
+    Additionally, when a second on<confidence value="5">e</confidence>
+ of the party identifiers is selected from the second set of party identifiers, the logic may be further configured to place a multi-party call to the first selected party identifier and the second selected party identifier.    </p>
+    <p id="p-12" num="12">[0012<confidence value="5">]</confidence>
+    Additionally, the first call l<confidence value="5">o</confidence>
+g and the first call list may correspond to a first user of the co<confidence value="8">m</confidence>
+munication device, the memory to store a second call <confidence value="6">l</confidence>
+og, the logic further configured to generate a second call list based <confidence value="5">o</confidence>
+n the second call log, the second call log and the second call list corresponding to a second user of the communication device.    </p>
+    <p id="p-13" num="13">[0013]    Additionally, the first call log and the first call list may correspond to a first communication identifier associated with the communication device, the memory to store a second call log, the logic further configured to generate a second call list based on the second call log, the second call log and the second call list corresponding to a second communication identifier associated the communication device.</p>
+    <boundary-data type="header">
+      <confidence value="666">-2-</confidence>
+    </boundary-data>
+    <boundary-data type="header">PATENT</boundary-data>
+    <boundary-data type="header">Docket No. PS<confidence value="56">OS</confidence>
+ 073<confidence value="5">1</confidence>
+ <confidence value="882">US1</confidence>
+    </boundary-data>
+    <p id="p-14" num="14">
+      <page-break num="3"/>
+[0014]   Additionally, the call frequency information <confidence value="5">m</confidence>
+ay comprise weighted call frequency information based on call recency information.    </p>
+    <p id="p-15" num="15">[0015<confidence value="2">]</confidence>
+   According to another aspect, a method may <confidence value="5">b</confidence>
+e provided. The method may comprise storing communication identifiers associated with respective signals transmitted from a communication device; configuring a list of the stored communication identifiers based on a relative frequency of signal transmission to the respective stored communication identifiers; and displaying at least a portion of the list.    </p>
+    <p id="p-16" num="16">[0016<confidence value="5">]</confidence>
+   Additionally, the configuring the list may also <confidence value="5">b</confidence>
+e based on a time of day of the configuring.    </p>
+    <p id="p-17" num="17">[0017]   Additionally, the configuring the list may also <confidence value="5">b</confidence>
+e based on a day of wee<confidence value="8">k</confidence>
+ on which the list is configured.    </p>
+    <p id="p-18" num="18">[0018<confidence value="5">]</confidence>
+   Additionally, the method may also comprise calendaring information for a date, wherein the configuring the list is further based on the calendared information associated with the date when the configuring occurs on the date.    </p>
+    <p id="p-19" num="19">
+      <confidence value="86">[0</confidence>
+019<confidence value="5">]</confidence>
+   Additionally, the method may also comprise receiving a first selection of a displayed co<confidence value="8">m</confidence>
+munication identif<confidence value="8">i</confidence>
+er from the list; reconfiguring the list based on the first selection; and displaying at least a portion of the reconfigured list.    </p>
+    <p id="p-20" num="20">[0020]   Additionally, the method may also comprise receiving a second selection of a displayed communication identifier from the reconfigured list; and transmitting a signal based <confidence value="5">o</confidence>
+n the first selection of the displayed communication identifier and the second selection of the displayed communication identifier.    </p>
+    <p id="p-21" num="21">[002<confidence value="5">1</confidence>
+]   Additionally, the method may also comprise determining a frequency with which the first selection is included in respective multi-party signal transmissions with two or more of the stored communication identifiers.    </p>
+    <boundary-data type="header">-3-</boundary-data>
+    <boundary-data type="header">PATENT</boundary-data>
+    <boundary-data type="header">Docket N<confidence value="55">o.</confidence>
+ PS<confidence value="4">0</confidence>
+5 073<confidence value="4884">1US1</confidence>
+    </boundary-data>
+    <p id="p-22" num="22">
+      <page-break num="4"/>
+[0022<confidence value="5">]</confidence>
+   Additionally, the configuring the list of the stored communication identifiers may also be based on a relative recency of the signal transmission to the respective st<confidence value="8">o</confidence>
+red communication identifiers.    </p>
+    <p id="p-23" num="23">[0023]   According to yet another aspect, a computer readable medium that stores instructions executable by a processing device operating in a communications terminal may be provided.</p>
+    <p id="p-24" num="24">The computer readable medium may comprise instructions to determine a probability that a communication identifier of a plurality of stored communication identifiers will be selected from the stored communication identifiers for calling; and instructions to order at least two of the stored communication identifiers based on the respective probabilities associated with the at least two communication identif<confidence value="7">i</confidence>
+ers.    </p>
+    <p id="p-25" num="25">[0024]   Additionally, the computer readable medium may also comprise the instructions to display the ordered communication identifiers as a list.</p>
+    <p id="p-26" num="26">[0025]   Additionally, the computer readable medium may also comprise instructions to receive a selection of at least one displayed communication identifier; instr<confidence value="8">u</confidence>
+cti<confidence value="8">o</confidence>
+ns to determine a respective probability that an unselected communicati<confidence value="8">o</confidence>
+n identifier will be selected to be called together with the at least one displayed communication identifier; instructions to order the unsele<confidence value="8">c</confidence>
+ted communication identifiers based on the respective probabilities associated with respective unselected communication identifiers; and instructions to display the ordered unselected com<confidence value="8">m</confidence>
+uni<confidence value="8">c</confidence>
+ation identifiers as another list.    </p>
+    <p id="p-27" num="27">[002<confidence value="5">6</confidence>
+]   According to still another aspect, a device is provided. The device may comprise means for initiating a communication with a communication device; means for logging the communications initiated with <confidence value="8">r</confidence>
+espective communication devices; means f<confidence value="5">o</confidence>
+r determining a likelihood that any one of the communication devices will be a next communication device with which communication will be initiated based on the logged information; and means for ordering, in a displayable list based on the determined likelihoods, identifiers associated with at least two of the communication devices.    </p>
+    <boundary-data type="header">-4-</boundary-data>
+    <boundary-data type="header">PATENT</boundary-data>
+    <boundary-data type="header">Docket No. PS<confidence value="44">O5</confidence>
+ <confidence value="888">073</confidence>
+ <confidence value="2885">1US1</confidence>
+    </boundary-data>
+    <heading id="h-5">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-28" num="28">
+      <page-break num="5"/>
+      <confidence value="5">[</confidence>
+0027<confidence value="5">]</confidence>
+   The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate an embodiment of the invention and, together with the description, explain the invention. In the drawings, [0028]   Fig. <confidence value="5">1</confidence>
+ is a diagram of an exemplary implementation of a communication device consistent with the principles of the invention;    </p>
+    <p id="p-29" num="29">[0029]   Fig. 2 illustrates an exemplary functional diagram of the communication device of Fig. 1 consistent with the principles of the invention;</p>
+    <p id="p-30" num="30">
+      <confidence value="55">[0</confidence>
+030]   Fig. 3 illustrates an exemplary data structure consistent with the principles of the invention;    </p>
+    <p id="p-31" num="31">[0031<confidence value="5">]</confidence>
+   Fig. <confidence value="5">4</confidence>
+ illustrates an exemplary flow diagra<confidence value="8">m</confidence>
+ of a call list configuration consistent with the principles of the invention; and [0032]   Figs. <confidence value="5">5</confidence>
+A-G illustrate exemplary displayable call lists consistent with the principles of the invention.    </p>
+    <heading id="h-6">DETAILED DESCRIPTION OF THE <confidence value="8">I</confidence>
+NVENTION    </heading>
+    <p id="p-32" num="32">
+      <confidence value="86">[0</confidence>
+033]   The following detailed description of the invention refers to the acco<confidence value="8">m</confidence>
+panying drawings. The same reference numbers in different drawings may identify the same or similar elements. Also, the following detailed description does not limit the invention.    </p>
+    <p id="p-33" num="33">[0034]   T<confidence value="5">h</confidence>
+e description to follow refers to a "call." As used herein, the term, call, is to be interpreted broadly, to include any type of communication, such as a voice call, a text message, a page, a fax transmission, an e-mail, an instant message, and the like, which may include a one- way, a two-way, or another type of communication among any number of pa<confidence value="8">r</confidence>
+ties.    </p>
+    <p id="p-34" num="34">
+      <confidence value="5">[</confidence>
+0035]   Implementations described herein may be used to configure displayable call lists for easy number selection via a user interface, such as a keypad, on a device, such as a handheld communication device. Implementations described herein may use a call activity history, such as a "dialed calls" l<confidence value="5">o</confidence>
+g, to effectively predict the numbers most likely to be called from the <boundary-data type="header">
+        <confidence value="266">-5-</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. <confidence value="6868">PSOS</confidence>
+ 0731US<confidence value="8">1</confidence>
+      </boundary-data>
+communication device. <confidence value="6">I</confidence>
+mplementations described herein may use log information, such as call frequency, time of day, day of the week, and combinations thereof to order a displayable call list corresponding to any given point in time. <confidence value="6">I</confidence>
+mplementations described herein may re<confidence value="8">c</confidence>
+onf<confidence value="8">i</confidence>
+gure the ordered call list when a first number is selected from the list according to the likelihood that any particular number may be also selected for pairing with the first selected number, for example, for conference calling or multi-recipient messaging.    </p>
+    <heading id="h-7">EXEM<confidence value="8">P</confidence>
+LARY C<confidence value="8">O</confidence>
+MMUN<confidence value="8">I</confidence>
+CAT<confidence value="8">I</confidence>
+ON DEVICE    </heading>
+    <p id="p-35" num="35">[003<confidence value="5">6</confidence>
+]   Fig. 1 is a diagram of an exemplary implementation of a communication device consistent with the principles of the invention. Communication device <part-num-ref name="invention. Communication device">100</part-num-ref>
+ (hereinafter communication device <part-num-ref name="(hereinafter communication device">100)</part-num-ref>
+ may be a mobile communication device. As used herein, a <confidence value="5">"</confidence>
+communication device" and/or "co<confidence value="8">m</confidence>
+munication terminal" may include a radiotelephone; a personal commu<confidence value="8">n</confidence>
+ications system (<confidence value="5">P</confidence>
+CS) terminal that may combine a cellular radiotelephone with data processing, a facsimile, and data communications capabilities; a personal digital assistant <confidence value="5">(</confidence>
+PDA<confidence value="5">)</confidence>
+ that can include a radiotelephone, pager, Internet/intranet access, web browser, organizer, calendar, and/or global positioning system (GPS<confidence value="5">)</confidence>
+ receiver; a laptop; a palmtop receiver <confidence value="222222">and/or</confidence>
+ another type of communication device.    </p>
+    <p id="p-36" num="36">
+      <confidence value="5">[</confidence>
+0037]   Communication device 100 may include housing <part-num-ref name="may include housing">1<confidence value="5">0</confidence>
+1,      </part-num-ref>
+ keypad <part-num-ref name="may include housing 101, keypad">110,</part-num-ref>
+ control keys <part-num-ref name="may include housing 101, keypad 110, control keys">120,</part-num-ref>
+ speaker <part-num-ref name="may include housing 101, keypad 110, control keys 120, speaker">130,</part-num-ref>
+ display <part-num-ref name="may include housing 101, keypad 110, control keys 120, speaker 130, display">140,</part-num-ref>
+ and microphone <part-num-ref name="may include housing 101, keypad 110, control keys 120, speaker 130, display 140, and microphone">150.</part-num-ref>
+ Housi<confidence value="8">n</confidence>
+g <part-num-ref name="may include housing 101, keypad 110, control keys 120, speaker 130, display 140, and microphone 150. Housing">101</part-num-ref>
+ may include a structure configured to hold devices and components used in communication device <part-num-ref name="structure configured to hold devices and components used in communication device">100.</part-num-ref>
+ <confidence value="5">F</confidence>
+or example, housing <part-num-ref name="structure configured to hold devices and components used in communication device 100. For example, housing">101</part-num-ref>
+ may be formed fr<confidence value="8">o</confidence>
+m plastic, metal, or composite and may be configured to support keypad <part-num-ref name="may be formed from plastic, metal, or composite and may be configured to support keypad">110,</part-num-ref>
+ control keys <part-num-ref name="may be formed from plastic, metal, or composite and may be configured to support keypad 110, control keys">120,</part-num-ref>
+ speaker <part-num-ref name="may be formed from plastic, metal, or composite and may be configured to support keypad 110, control keys 120, speaker">130,</part-num-ref>
+ display <part-num-ref name="may be formed from plastic, metal, or composite and may be configured to support keypad 110, control keys 120, speaker 130, display">140</part-num-ref>
+ and microphone <part-num-ref name="and microphone">150.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">
+      <confidence value="5">[</confidence>
+0038<confidence value="4">]</confidence>
+   Keypad <confidence value="5">1</confidence>
+10 may include devices and/or logic that can be used to operate communication device <part-num-ref name="may include devices and/or logic that can be used to operate communication device">100.</part-num-ref>
+ Keypad <part-num-ref name="may include devices and/or logic that can be used to operate communication device 100. Keypad">110</part-num-ref>
+ may further be adapted to receive user inputs, directly or via other devices, s<confidence value="8">u</confidence>
+ch as a stylus for entering information into communication device <part-num-ref name="stylus for entering information into communication device">100.</part-num-ref>
+    </p>
+    <p id="p-38" num="38">
+      <confidence value="5">I</confidence>
+n one implementation, communication functions of communication device 100 may be controlled by activating keys <part-num-ref name="may be controlled by activating keys">112.</part-num-ref>
+ <confidence value="7">I</confidence>
+mplementations of keys <part-num-ref name="may be controlled by activating keys 112. Implementations of keys">112</part-num-ref>
+ may have key information <boundary-data type="header">
+        <confidence value="666">-6-</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">D</confidence>
+ocket No. PS<confidence value="56">05</confidence>
+ <confidence value="6885885">0731US1</confidence>
+      </boundary-data>
+associated therewith, such as numbers, letters, symbols, etc. A user may interact with keys <part-num-ref name="user may interact with keys">112</part-num-ref>
+ to input key information into communication device <part-num-ref name="to input key information into communication device">100.</part-num-ref>
+ For example, a user may operate keys <part-num-ref name="user may operate keys">112</part-num-ref>
+ to enter digits, comma<confidence value="8">n</confidence>
+ds, and/or text, into communication device <part-num-ref name="to enter digits, commands, and/or text, into communication device">100.</part-num-ref>
+ Designated functions of keys <part-num-ref name="to enter digits, commands, and/or text, into communication device 100. Designated functions of keys">112</part-num-ref>
+ <confidence value="5">m</confidence>
+ay form and/or manipulate images that may be displayed on display <part-num-ref name="may form and/or manipulate images that may be displayed on display">140.</part-num-ref>
+    </p>
+    <p id="p-39" num="39">[0039]   Control keys 120 <confidence value="5">m</confidence>
+ay include buttons that permit a user to interact with communication device <part-num-ref name="user to interact with communication device">100</part-num-ref>
+ to cause communication device <part-num-ref name="to cause communication device">100</part-num-ref>
+ to perform specified actions, such as to display a call list via display <part-num-ref name="call list via display">140,</part-num-ref>
+ scroll through the call list, select one or mor<confidence value="8">e</confidence>
+ of the displayed numbers on the list, place a call to the selected nu<confidence value="8">m</confidence>
+ber, etc.    </p>
+    <p id="p-40" num="40">[0040<confidence value="5">]</confidence>
+   Speaker 130 may include a device that provides audible information to a user of communication device <part-num-ref name="user of communication device">100.</part-num-ref>
+ Speaker <part-num-ref name="user of communication device 100. Speaker">130</part-num-ref>
+ may be located anywhere on communication device <part-num-ref name="may be located anywhere on communication device">100</part-num-ref>
+ and may f<confidence value="8">u</confidence>
+nction, for example, as an earpiece when a user communicates using communication device <part-num-ref name="user communicates using communication device">100.</part-num-ref>
+ Speaker <part-num-ref name="user communicates using communication device 100. Speaker">130</part-num-ref>
+ may also function as an output device for music and/or audio information associated with games and/or video images played on communication device <part-num-ref name="output device for music and/or audio information associated with games and/or video images played on communication device">100.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">[004<confidence value="5">1</confidence>
+]   Display 140 may include a device that provides visual images to a user. For example, display <part-num-ref name="user. For example, display">140</part-num-ref>
+ may provide graphic info<confidence value="77">rm</confidence>
+ati<confidence value="7">o</confidence>
+n regarding incoming/outgoing calls, text messages, games, <confidence value="2222222222">phonebooks</confidence>
+, the current <confidence value="222222222">date/time</confidence>
+, volume settings, etc., to a user of communication device <part-num-ref name="user of communication device">100.</part-num-ref>
+ Implementations of display <part-num-ref name="user of communication device 100. Implementations of display">140</part-num-ref>
+ <confidence value="5">m</confidence>
+ay be implemented as black and white or color flat panel displays.    </p>
+    <p id="p-42" num="42">
+      <confidence value="5">[</confidence>
+0042]   Microphone 150 may include a device that converts speech or other acoustic signals into electrical signals for use by communication device <part-num-ref name="device that converts speech or other acoustic signals into electrical signals for use by communication device">100.</part-num-ref>
+ Microphone <part-num-ref name="device that converts speech or other acoustic signals into electrical signals for use by communication device 100. Microphone">1<confidence value="5">5</confidence>
+0      </part-num-ref>
+ may be located anywhere on communication device <part-num-ref name="may be located anywhere on communication device">100</part-num-ref>
+ and may be configured, for example, to convert spoken words or phrases into electrical signals for use by communication device <part-num-ref name="and may be configured, for example, to convert spoken words or phrases into electrical signals for use by communication device">100.</part-num-ref>
+    </p>
+    <p id="p-43" num="43">[0043]   Fig. 2 illustrates an exemplary functional diagram of a communication device, such as communication device <part-num-ref name="communication device, such as communication device">100,</part-num-ref>
+ consistent with the principles of the inventi<confidence value="8">o</confidence>
+n. As shown in Fig.    </p>
+    <p id="p-44" num="44">2, communication device 100 may include processing logic <part-num-ref name="may include processing logic">210,</part-num-ref>
+ storage logic <part-num-ref name="may include processing logic 210, storage logic">220,</part-num-ref>
+ user <boundary-data type="header">
+        <confidence value="112">-7-</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket <confidence value="86">No</confidence>
+. P<confidence value="566">S05</confidence>
+ 073<confidence value="5884">1US1</confidence>
+      </boundary-data>
+interface logic <part-num-ref name="may include processing logic 210, storage logic 220, user interface logic">230,</part-num-ref>
+ communication interface <part-num-ref name="may include processing logic 210, storage logic 220, user interface logic 230, communication interface">240,</part-num-ref>
+ antenna assembly <part-num-ref name="may include processing logic 210, storage logic 220, user interface logic 230, communication interface 240, antenna assembly">250,</part-num-ref>
+ and power supply logic <part-num-ref name="may include processing logic 210, storage logic 220, user interface logic 230, communication interface 240, antenna assembly 250, and power supply logic">240.</part-num-ref>
+    </p>
+    <p id="p-45" num="45">
+      <confidence value="5">[</confidence>
+0044<confidence value="4">]</confidence>
+   Processing logic 210 may include a processor, microprocessor, an application specific integrated circuit <confidence value="5">(</confidence>
+ASIC), field programmable gate array (<confidence value="2222">FPGA</confidence>
+), or the like.    </p>
+    <p id="p-46" num="46">Processing logic 210 may include data structures or software programs to control operation of communication device <part-num-ref name="may include data structures or software programs to control operation of communication device">100</part-num-ref>
+ and its components. <confidence value="7">I</confidence>
+mple<confidence value="7">m</confidence>
+entations of communication device <part-num-ref name="and its components. Implementations of communication device">100</part-num-ref>
+ may use an individual processing logic component or multiple processing logic components, such as processing logic components operating in parallel.    </p>
+    <p id="p-47" num="47">[0045<confidence value="5">]</confidence>
+   Storage logic 220 may include a random access memory (RAM), a read only memory (ROM), and/or another type of memory to store data and instructions that <confidence value="5">m</confidence>
+ay be used by processing logic <part-num-ref name="read only memory (ROM), and/or another type of memory to store data and instructions that may be used by processing logic">210.</part-num-ref>
+    </p>
+    <p id="p-48" num="48">
+      <confidence value="2">[</confidence>
+0046<confidence value="2">]</confidence>
+   User interface logic 230 <confidence value="5">m</confidence>
+ay include mechanisms, such as hardware and/or software, for inputting information to communication device <part-num-ref name="may include mechanisms, such as hardware and/or software, for inputting information to communication device">100</part-num-ref>
+ and/or f<confidence value="5">o</confidence>
+r outputting information from co<confidence value="8">m</confidence>
+municati<confidence value="8">o</confidence>
+n device <part-num-ref name="and/or for outputting information from communication device">100.</part-num-ref>
+    </p>
+    <p id="p-49" num="49">[0047<confidence value="5">]</confidence>
+   Co<confidence value="5">m</confidence>
+municati<confidence value="5">o</confidence>
+n interface 240 may include, for example, a transmitter that may convert base band signals from processing logic <part-num-ref name="transmitter that may convert base band signals from processing logic">210</part-num-ref>
+ to radio frequency (R<confidence value="5">F</confidence>
+) signals <confidence value="222222">and/or</confidence>
+ <confidence value="8">a</confidence>
+ receiver that <confidence value="5">m</confidence>
+ay convert R<confidence value="5">F</confidence>
+ signals to base band signals. Alternatively, communication interface <part-num-ref name="receiver that may convert RF signals to base band signals. Alternatively, communication interface">240</part-num-ref>
+ may include a transceiver to perform functions of both a transmitter and a receiver.    </p>
+    <p id="p-50" num="50">Communication interface 240 may connect to antenna assembly <part-num-ref name="may connect to antenna assembly">250</part-num-ref>
+ for transmission and reception of the R<confidence value="5">F</confidence>
+ signals. Antenna assembly <part-num-ref name="RF signals. Antenna assembly">250</part-num-ref>
+ <confidence value="5">m</confidence>
+ay include one <confidence value="5">o</confidence>
+r mo<confidence value="8">r</confidence>
+e antennas to transmit and receive R<confidence value="5">F</confidence>
+ signals over the air. Antenna assembly <part-num-ref name="air. Antenna assembly">250</part-num-ref>
+ may receive R<confidence value="5">F</confidence>
+ signals from communication interface <part-num-ref name="may receive RF signals from communication interface">240</part-num-ref>
+ f<confidence value="5">o</confidence>
+r transmitting over the air, and receive R<confidence value="5">F</confidence>
+ signals over the air for conveying to communication interface <part-num-ref name="air for conveying to communication interface">240.</part-num-ref>
+    </p>
+    <p id="p-51" num="51">[004<confidence value="66">8]</confidence>
+   Power supply logic 260 may include hardware and/or software to provide power to components of communication device <part-num-ref name="may include hardware and/or software to provide power to components of communication device">100.</part-num-ref>
+ For example, power supply log<confidence value="8">i</confidence>
+c <part-num-ref name="may include hardware and/or software to provide power to components of communication device 100. For example, power supply logic">260</part-num-ref>
+ may include one or more batteries and/or connections to receive power from other devices, such as an <boundary-data type="header">
+        <confidence value="666">-8-</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. P<confidence value="555">SO5</confidence>
+ 073<confidence value="4884">1US1</confidence>
+      </boundary-data>
+accessory outlet in an automobile, an external battery, <confidence value="5">o</confidence>
+r a wall outlet. Power supply <confidence value="8">l</confidence>
+ogic <part-num-ref name="wall outlet. Power supply logic">2<confidence value="68">60</confidence>
+      </part-num-ref>
+ may include metering <confidence value="8">l</confidence>
+ogic to provide the user and components of communication device <part-num-ref name="user and components of communication device">100</part-num-ref>
+ with information about battery charge levels, output levels, power faults, etc.    </p>
+    <p id="p-52" num="52">
+      <confidence value="5">[</confidence>
+004<confidence value="5">9</confidence>
+]   As will be described in detail below, communication device 100, consistent with the principles of the invention, may perform certain operations relating to dynamically configuring a displayable call list in response to user inputs and/or in response to instructions associated with processing logic <part-num-ref name="displayable call list in response to user inputs and/or in response to instructions associated with processing logic">21<confidence value="5">0</confidence>
+.      </part-num-ref>
+ Communicati<confidence value="8">o</confidence>
+n device <part-num-ref name="displayable call list in response to user inputs and/or in response to instructions associated with processing logic 210. Communication device">100</part-num-ref>
+ may perform such operations in response to processing logic <part-num-ref name="may perform such operations in response to processing logic">210</part-num-ref>
+ executing software instructions of a call list configuration application contained in a computer-readable medium, such as storage <confidence value="8">l</confidence>
+ogic <part-num-ref name="computer-readable medium, such as storage logic">220.</part-num-ref>
+ A computer-readable medium may be defined as a physical or logical memory device and/or carrier wave.    </p>
+    <p id="p-53" num="53">
+      <confidence value="5">[</confidence>
+0050<confidence value="5">]</confidence>
+   The software instructions <confidence value="5">m</confidence>
+ay be read into storage logic <part-num-ref name="software instructions may be read into storage logic">220</part-num-ref>
+ from another c<confidence value="5">o</confidence>
+mputer- readable <confidence value="8">m</confidence>
+edium or from another device via communication interface <part-num-ref name="from another computer- readable medium or from another device via communication interface">240.</part-num-ref>
+ The software instructions contained in storage logic <part-num-ref name="software instructions contained in storage logic">220</part-num-ref>
+ may cause processing logic <part-num-ref name="may cause processing logic">210</part-num-ref>
+ to perform processes that will be described later. Alternatively, hardwired circuitry may be used in place of or in combination with software instructions to implement processes consistent with the principles of the invention. Thus, implementations consistent with the principles of the invention are not limited to any specific combination of hardware circuitry and software.    </p>
+    <heading id="h-8">EXEM<confidence value="8">P</confidence>
+LARY DATA STRUCTURE    </heading>
+    <p id="p-54" num="54">
+      <confidence value="5">[</confidence>
+0051]   Fig. 3 illustrates an exemplary call log <part-num-ref name="exemplary call log">300</part-num-ref>
+ consistent with the principles of the invention. Call log <part-num-ref name="invention. Call log">300</part-num-ref>
+ <confidence value="5">m</confidence>
+ay include a computer-readable medium that can be used to store information in a machine-readable format. In an exemplary i<confidence value="8">m</confidence>
+plementati<confidence value="8">o</confidence>
+n, call log <part-num-ref name="exemplary implementation, call log">300</part-num-ref>
+ may st<confidence value="8">o</confidence>
+re information that is used to form a displayable call list on display <part-num-ref name="displayable call list on display">140.</part-num-ref>
+ In one implementation, call log <part-num-ref name="displayable call list on display 140. In one implementation, call log">300</part-num-ref>
+ may be st<confidence value="8">o</confidence>
+red in storage logic <part-num-ref name="may be stored in storage logic">220.</part-num-ref>
+    </p>
+    <p id="p-55" num="55">
+      <confidence value="5">[</confidence>
+0052<confidence value="2">1</confidence>
+   Call l<confidence value="5">o</confidence>
+g 300 may include a record of calls that are placed and received by communication device <part-num-ref name="record of calls that are placed and received by communication device">100.</part-num-ref>
+ The recorded information may be arranged in individual log entries <confidence value="5">(</confidence>
+shown here as rows<confidence value="5">)</confidence>
+ in fields (shown here in columns), such as a date/time stamp field <part-num-ref name="date/time stamp field">310,</part-num-ref>
+ a <boundary-data type="header">
+        <confidence value="588">-9-</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. PS<confidence value="55">O5</confidence>
+ 073<confidence value="5884">1US1</confidence>
+      </boundary-data>
+communication identifier field <part-num-ref name="communication identifier field">320,</part-num-ref>
+ an alias field <part-num-ref name="alias field">330,</part-num-ref>
+ and a call type field <part-num-ref name="call type field">340.</part-num-ref>
+ Call log <part-num-ref name="call type field 340. Call log">300</part-num-ref>
+ may include other fields, such as a call duration field, a location information field, a billing information field, and the like. Call log information in call log <part-num-ref name="like. Call log information in call log">300</part-num-ref>
+ <confidence value="5">m</confidence>
+ay be arranged in any format.    </p>
+    <p id="p-56" num="56">[0053]   Date/time stamp field 310 may include informatio<confidence value="8">n</confidence>
+ that identifies a date associated with a call placed or received by co<confidence value="8">m</confidence>
+munication device <part-num-ref name="call placed or received by communication device">100.</part-num-ref>
+ Date/time stamp field <part-num-ref name="call placed or received by communication device 100. Date/time stamp field">310</part-num-ref>
+ <confidence value="588">may</confidence>
+ include information that identifies a time of day associated with a call placed or received by communication device <part-num-ref name="call placed or received by communication device">100.</part-num-ref>
+ Date and time information used for stamping calls may be generated by storage logic <part-num-ref name="call placed or received by communication device 100. Date and time information used for stamping calls may be generated by storage logic">220,</part-num-ref>
+ processing logic <part-num-ref name="call placed or received by communication device 100. Date and time information used for stamping calls may be generated by storage logic 220, processing logic">210,</part-num-ref>
+ or another component in communication device <part-num-ref name="call placed or received by communication device 100. Date and time information used for stamping calls may be generated by storage logic 220, processing logic 210, or another component in communication device">100.</part-num-ref>
+    </p>
+    <p id="p-57" num="57">
+      <confidence value="5">[</confidence>
+0054]   Communication identifier field 320 <confidence value="5">m</confidence>
+ay include information that identifies a communication device associated with a destination or a source of a call respectively placed or received by com<confidence value="8">m</confidence>
+unication device <part-num-ref name="call respectively placed or received by communication device">
+        <confidence value="5">1</confidence>
+00.      </part-num-ref>
+ For, example, identifier field <part-num-ref name="call respectively placed or received by communication device 100. For, example, identifier field">320</part-num-ref>
+ may include information, such as a phone number, an e-mail address, etc., that uniquely identifies a communication device. In one implementation, communication interface <part-num-ref name="communication device. In one implementation, communication interface">240,</part-num-ref>
+ processing logic <part-num-ref name="communication device. In one implementation, communication interface 240, processing logic">210,</part-num-ref>
+ or another component in communication device <part-num-ref name="communication device. In one implementation, communication interface 240, processing logic 210, or another component in communication device">100</part-num-ref>
+ may determine from an incoming call signal an identifier associated with a source communication device. For example, the identif<confidence value="8">i</confidence>
+er may be determined using automated number identification (AN<confidence value="66">I)</confidence>
+ or caller identity display (caller <confidence value="5">I</confidence>
+D or C<confidence value="5">I</confidence>
+D) information associated with the received call.    </p>
+    <p id="p-58" num="58">[0055]   Alias field 340 may include information that identifies a name of a pa<confidence value="8">r</confidence>
+ty that <confidence value="5">m</confidence>
+ay be associated with a communication identifier. <confidence value="5">I</confidence>
+n one implementation, the alias field may be automatically determined using CID information associated with a received call. In one implementation, a user may designate the name to be associated with the communication identifier, for example, in a <confidence value="222222222">phonebook</confidence>
+, a contact list, or the like, for instance, using keys <part-num-ref name="like, for instance, using keys">112</part-num-ref>
+ and/or control keys <part-num-ref name="and/or control keys">120.</part-num-ref>
+ The entered information may be processed and/or st<confidence value="8">o</confidence>
+red by user interface logic <part-num-ref name="entered information may be processed and/or stored by user interface logic">230,</part-num-ref>
+ processing logic <part-num-ref name="entered information may be processed and/or stored by user interface logic 230, processing logic">210,</part-num-ref>
+ storage logic <part-num-ref name="entered information may be processed and/or stored by user interface logic 230, processing logic 210, storage logic">220,</part-num-ref>
+ or another component in <boundary-data type="header">
+        <confidence value="5885">-10-</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">
+        <confidence value="88">PA</confidence>
+TENT      </boundary-data>
+      <boundary-data type="header">Doc<confidence value="8">k</confidence>
+et No. PS<confidence value="45">O5</confidence>
+ 073<confidence value="5885">1USt</confidence>
+      </boundary-data>
+communication device <part-num-ref name="entered information may be processed and/or stored by user interface logic 230, processing logic 210, storage logic 220, or another component in communication device">
+        <confidence value="666">100</confidence>
+.      </part-num-ref>
+ In one implementatio<confidence value="8">n</confidence>
+, a single alias may be associated with more than one communication identifier, in which case the communication identifier may <confidence value="88">be</confidence>
+ associated with a further designation, such as a cell phone, a work phone, a home phone, an e- mail address, etc.    </p>
+    <p id="p-59" num="59">
+      <confidence value="86666">[0056</confidence>
+]   Call type field 350 may include information that identif<confidence value="8">i</confidence>
+es an aspect of the call, such as whether the call originated with communication device <part-num-ref name="call originated with communication device">100</part-num-ref>
+ (e.g., "dialed") or was terminated by communication device <part-num-ref name="&quot;dialed&quot;) or was terminated by communication device">100</part-num-ref>
+ (e.g., <confidence value="5">"</confidence>
+received"), whether an incoming call was answered (e.g., "missed"<confidence value="5">)</confidence>
+, and the li<confidence value="8">k</confidence>
+e. Communication interface <part-num-ref name="like. Communication interface">240,</part-num-ref>
+ processing logic <part-num-ref name="like. Communication interface 240, processing logic">210,</part-num-ref>
+ or another component in co<confidence value="8">m</confidence>
+munication device <part-num-ref name="like. Communication interface 240, processing logic 210, or another component in communication device">100</part-num-ref>
+ may identify the various aspects ass<confidence value="8">o</confidence>
+ciated with a call.    </p>
+    <heading id="h-9">EXEMPLARY PROCESSING</heading>
+    <p id="p-60" num="60">
+      <confidence value="5">[</confidence>
+0057]   Fig. 4 is a flowchart of an exe<confidence value="8">m</confidence>
+pla<confidence value="8">r</confidence>
+y process consistent with the principles of the invention for implementing a call list configuration application. In one imple<confidence value="8">m</confidence>
+entation, the call list configuration application may be operative in any <confidence value="8">m</confidence>
+ode of operation of communication device <part-num-ref name="call list configuration application may be operative in any mode of operation of communication device">100,</part-num-ref>
+ for example, while "off," in "standby," during a call, etc.    </p>
+    <p id="p-61" num="61">[0058]   Call log information may be obtained (act 410<confidence value="5">)</confidence>
+. A explained above, a log entry in call log <part-num-ref name="log entry in call log">300</part-num-ref>
+ may be automatically generated and stored for an outgoing and/or incoming call, whether or not a communication line is established, i.e., the call is "answered." Logging of call activity may com<confidence value="8">m</confidence>
+en<confidence value="8">c</confidence>
+e with initial operation of communication device <part-num-ref name="call is &quot;answered.&quot; Logging of call activity may commence with initial operation of communication device">100</part-num-ref>
+ and be continuous thereafter. L<confidence value="8">o</confidence>
+gging of call activity may alternatively span any predetermined period. In one alternative implementation, call log info<confidence value="7">r</confidence>
+mation corresponding to call activity associated with communication device <part-num-ref name="and be continuous thereafter. Logging of call activity may alternatively span any predetermined period. In one alternative implementation, call log information corresponding to call activity associated with communication device">100</part-num-ref>
+ may be maintained by a communications service provider ass<confidence value="8">o</confidence>
+ciated with operation of communication device <part-num-ref name="communications service provider associated with operation of communication device">100.</part-num-ref>
+ Accordingly, call list configuration, as described below, <confidence value="5">m</confidence>
+ay be accomplished, for example, at a server, and then provided to communication device <part-num-ref name="server, and then provided to communication device">100.</part-num-ref>
+    </p>
+    <p id="p-62" num="62">[0059]   Call list configuration, as described below, <confidence value="5">m</confidence>
+ay be accomplished with at least one entry in call log 300. Call list conf<confidence value="8">i</confidence>
+gurati<confidence value="8">o</confidence>
+n may begin with an analysis of one or more entries <boundary-data type="header">-11-</boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">
+        <confidence value="88">PA</confidence>
+TENT      </boundary-data>
+      <boundary-data type="header">Docket No<confidence value="5">.</confidence>
+ <confidence value="6855">PSO5</confidence>
+ 073 <confidence value="1885">IUS1</confidence>
+      </boundary-data>
+in call l<confidence value="5">o</confidence>
+g <part-num-ref name="analysis of one or more entries in call log">300</part-num-ref>
+ (act 420). In one implementation, the analysis may include a statistical analysis.    </p>
+    <p id="p-63" num="63">The analysis may identify calling patterns associated with one or more of the communication identif<confidence value="7">i</confidence>
+ers in communication identifier field <part-num-ref name="communication identifiers in communication identifier field">320.</part-num-ref>
+ In one implementation, the analysis may identify calling patterns associated with one or more of the aliases in aliases field <part-num-ref name="aliases in aliases field">330,</part-num-ref>
+ such that two or more communication identif<confidence value="7">i</confidence>
+ers associated with a single alias <confidence value="5">(</confidence>
+e.g., cell, home, work, <confidence value="5">e</confidence>
+tc.) may be treated as a single communication identifier for purposes of the analysis.    </p>
+    <p id="p-64" num="64">[0060]   In one implementation, the analysis may include all or any number of the entries in call log <part-num-ref name="entries in call log">300.</part-num-ref>
+ For example, the analysis may be based on the type of call, as identified in call type field <part-num-ref name="type of call, as identified in call type field">340.</part-num-ref>
+ In one implementation, the analysis may be based only on dialed calls<confidence value="8">.</confidence>
+    </p>
+    <p id="p-65" num="65">Alternatively, the analysis may include dialed calls, missed calls, and/or received calls. In one implementation, the analysis may be based only on calls during a predetermined period. That is, calls in call log <part-num-ref name="predetermined period. That is, calls in call log">300</part-num-ref>
+ that are older than a predetermined amount of time may be discounted for purposes of the analysis. In one implementation, entries in call log <part-num-ref name="analysis. In one implementation, entries in call log">300</part-num-ref>
+ may be flushed from call log <part-num-ref name="may be flushed from call log">300</part-num-ref>
+ based on a predetermined "age." Alternatively, the age of a call in call log <part-num-ref name="call in call log">300</part-num-ref>
+ may be used as a weighting factor for purposes of the analysis. In another implementation, entries in call log <part-num-ref name="analysis. In another implementation, entries in call log">300</part-num-ref>
+ may be flushed from call log <part-num-ref name="may be flushed from call log">300</part-num-ref>
+ based on a capacity of storage logic <part-num-ref name="capacity of storage logic">220,</part-num-ref>
+ for example, according to a first-in first-out practice or another technique.    </p>
+    <p id="p-66" num="66">
+      <confidence value="5">[</confidence>
+0061<confidence value="5">]</confidence>
+   Individual entries may be ordered in a call list based on the analysis <confidence value="5">(</confidence>
+act 430). The order of the entries may be based <confidence value="5">o</confidence>
+n any number of criteria. In one implementation, the order may be based on frequency information associated with respective entries in call log <part-num-ref name="order may be based on frequency information associated with respective entries in call log">300,</part-num-ref>
+ as determined by the analysis. For example, the call list order may be based on the number of entries in call log <part-num-ref name="number of entries in call log">300</part-num-ref>
+ corresponding to respective communication identifiers. A simplif<confidence value="8">i</confidence>
+ed example would be that the communication identifier that has been called the most from communication device <part-num-ref name="most from communication device">100</part-num-ref>
+ may be the first communication identifier listed on t<confidence value="5">h</confidence>
+e call list, the communication identifier that has been called the next most from communication device <part-num-ref name="next most from communication device">100</part-num-ref>
+ may be the next communication identifier listed on the call list, and so on. In one <boundary-data type="header">
+        <confidence value="5885">-12-</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">
+        <confidence value="88">PA</confidence>
+TENT      </boundary-data>
+      <boundary-data type="header">Docket No. PS<confidence value="55">O5</confidence>
+ 073 <confidence value="5884">lUS1</confidence>
+      </boundary-data>
+implementation, frequency ordering <confidence value="5">m</confidence>
+ay <confidence value="5">b</confidence>
+e based on an absolute frequency, independent of recency. That is, the most frequently called communication identifier may be listed as first in the call list even when calls to any number of other communication identifiers have been made since the last call to the most frequently called communication identifier. Alternatively, ordering may be based on a combination of frequency and recency. <confidence value="5">F</confidence>
+or example, entries in call log <part-num-ref name="combination of frequency and recency. For example, entries in call log">300</part-num-ref>
+ <confidence value="5">m</confidence>
+ay be weighted according to any predetermined formula based on the recency in time associated therewith and frequency of the associated entries. In this manner, vintage calls, although frequent, may f<confidence value="8">i</confidence>
+gure less prominently than recent calls, although fewer in number, in determining an order of the call list.    </p>
+    <p id="p-67" num="67">
+      <confidence value="266685">[0062]</confidence>
+     In one implementation, the configured call list order may be based on a time associated with the generation of the call list. <confidence value="5">F</confidence>
+or example, the ordering may be based on the analysis of call log information as it <confidence value="5">m</confidence>
+ay relate to, f<confidence value="5">o</confidence>
+r example, a ti<confidence value="8">m</confidence>
+e of day, a day of the week, a day of the month, etc. <confidence value="5">F</confidence>
+or example, the ordering <confidence value="5">m</confidence>
+ay be dynamic throughout the course of a day, irrespective of <confidence value="8">c</confidence>
+al<confidence value="8">l</confidence>
+ activity/inactivity occurring during that time. In one implementation, the analysis may identify a calling pattern associated with particular times of the day, days of the week, etc.    </p>
+    <p id="p-68" num="68">[0063]   In one implementation, the conf<confidence value="8">i</confidence>
+gured call list order may be based on calendar information stored in communicatio<confidence value="8">n</confidence>
+ device <part-num-ref name="configured call list order may be based on calendar information stored in communication device">100.</part-num-ref>
+ That is, when a user has calendared information in a calendar application contained in co<confidence value="8">m</confidence>
+municati<confidence value="8">o</confidence>
+n device <part-num-ref name="calendar application contained in communication device">100,</part-num-ref>
+ the calendared information may automatically be considered as part of the analysis in cal<confidence value="8">l</confidence>
+ list configuration.    </p>
+    <p id="p-69" num="69">
+      <confidence value="5">F</confidence>
+or example, for calendar information such as a reminder, a birthday, a conference call, et<confidence value="68">c,</confidence>
+ having an alias <confidence value="222222">and/or</confidence>
+ a communication identifier associated therewith, the associated alias <confidence value="222222">and/or</confidence>
+ communication identif<confidence value="8">i</confidence>
+er may be prioritized in ordering, irrespective of other applied ordering criteria, such as frequency and/or recency<confidence value="5">,</confidence>
+ In one implementation, ordering based on calendared information may be used independently of, or, alter<confidence value="8">n</confidence>
+atively, in conjunction with ordering based recency information and/or frequency information.    </p>
+    <boundary-data type="header">-13-</boundary-data>
+    <boundary-data type="header">PATENT</boundary-data>
+    <boundary-data type="header">Docket N<confidence value="5">o</confidence>
+. P<confidence value="466">S05</confidence>
+ 0731 <confidence value="86">US</confidence>
+ <confidence value="5">1</confidence>
+    </boundary-data>
+    <p id="p-70" num="70">
+      <page-break num="14"/>
+      <confidence value="885">[00</confidence>
+64]   The ordered call list may be displayed on display <part-num-ref name="ordered call list may be displayed on display">140</part-num-ref>
+ (act 440). In one implementation, the call list may be passively displayed, f<confidence value="5">o</confidence>
+r example, in a standby mode of communication device <part-num-ref name="standby mode of communication device">100.</part-num-ref>
+ In another implementation, the call list may be displayed when a user activates a designated key <part-num-ref name="designated key">1<confidence value="4">1</confidence>
+2,      </part-num-ref>
+ control key <part-num-ref name="designated key 112, control key">120,</part-num-ref>
+ and/or another component in communication device <part-num-ref name="designated key 112, control key 120, and/or another component in communication device">100.</part-num-ref>
+ For example, the call list may be displayed when the user activates a send key during a standby mode. In one implementation, the call list is the "default" display.    </p>
+    <p id="p-71" num="71">
+      <confidence value="5">[</confidence>
+0065]   The ordered entries in the call list may include any information. In one implementation, an ordered entry <confidence value="5">m</confidence>
+ay include an alias, a communication identifier, a type of call associated with the entry (e.g., indicating whether the communication identifier was last called <confidence value="5">o</confidence>
+r last received), a communication ident<confidence value="8">i</confidence>
+fier designat<confidence value="8">i</confidence>
+on, such a<confidence value="5">s</confidence>
+ <confidence value="88">"c</confidence>
+ell," "home," "work," etc.    </p>
+    <p id="p-72" num="72">In one imple<confidence value="8">m</confidence>
+entation, the ordered entries are displayed in respective lines. The call list may be displayed in other formats. The call list may be displayed a portion at time on display <part-num-ref name="portion at time on display">140.</part-num-ref>
+ That is, a limited number of entry lines may be displayed at once. <confidence value="5">I</confidence>
+n one implementation, a user may use keys <part-num-ref name="user may use keys">112,</part-num-ref>
+ control keys <part-num-ref name="user may use keys 112, control keys">12<confidence value="5">0</confidence>
+,      </part-num-ref>
+ and/or another component in communication device <part-num-ref name="user may use keys 112, control keys 120, and/or another component in communication device">100</part-num-ref>
+ to display further portions of the call list. For example, the displayed call list <confidence value="5">m</confidence>
+ay be scrolled or otherwise navigated using keys <part-num-ref name="displayed call list may be scrolled or otherwise navigated using keys">112,</part-num-ref>
+ control keys <part-num-ref name="displayed call list may be scrolled or otherwise navigated using keys 112, control keys">120,</part-num-ref>
+ and/or another component in communi<confidence value="8">c</confidence>
+ati<confidence value="8">o</confidence>
+n device <part-num-ref name="displayed call list may be scrolled or otherwise navigated using keys 112, control keys 120, and/or another component in communication device">100</part-num-ref>
+ an<confidence value="5">d</confidence>
+ processed by user interface logic <part-num-ref name="and processed by user interface logic">230.</part-num-ref>
+    </p>
+    <p id="p-73" num="73">[0066]   <confidence value="5">I</confidence>
+n one implementation, a user may interact with the call list using keys <part-num-ref name="call list using keys">112,</part-num-ref>
+ control keys <part-num-ref name="call list using keys 112, control keys">120,</part-num-ref>
+ or another component, f<confidence value="5">o</confidence>
+r example, to scroll to a call list entry, and select the desired (e.g., highlighted) entry for calling (act 450). In one implementation, the selection of an entry of a displayed call list may cause a reconfiguration of the call list that includes the balance of the remaining <confidence value="5">(</confidence>
+i.e., unselected) entries (act 460). For example, information from the analysis of the call log information may be used to determine an association between the communication identifier corresponding to the selected entry and one or more of the unselected communi<confidence value="8">c</confidence>
+ation identifiers. For example, the analysis may uncover instances when one or more of the unselected communication identifiers have previously been joint recipients of a multi-recipient <boundary-data type="header">-14-</boundary-data>
+      <page-break num="15"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. PS<confidence value="66">05</confidence>
+ 073<confidence value="5885">1US1</confidence>
+      </boundary-data>
+text message or co-parties to a conference call. In one implementation, entries in the re- configured call list are ordered based on a degree of association <confidence value="6">(</confidence>
+e.g., occurrences as joint recipients<confidence value="5">)</confidence>
+ with the selected entry.    </p>
+    <p id="p-74" num="74">
+      <confidence value="5">[</confidence>
+006<confidence value="52">7]</confidence>
+    A user may select an additional entry or discontinue the selection process (act 470).    </p>
+    <p id="p-75" num="75">When a user makes a selection from the re-configured call list <confidence value="5">(</confidence>
+i.e., selects a second communication identifier f<confidence value="5">o</confidence>
+r communication<confidence value="5">)</confidence>
+, the re-configured call list itself can be re- configured based o<confidence value="5">n</confidence>
+ an association between the communication identifier corresponding to the second selected entry and one or more of the unselected communication identifiers <confidence value="5">(</confidence>
+act 460<confidence value="68">).</confidence>
+    </p>
+    <p id="p-76" num="76">The re-configuration process can be repeated in like manner f<confidence value="5">o</confidence>
+r subsequently selected entries for a particular call.    </p>
+    <p id="p-77" num="77">
+      <confidence value="666682">[00681</confidence>
+    When a user completes the selection process, a call may be placed to the communication identifiers associated with the selected entry or entries (and any communication identifiers, for example, entered manually), for example, by the user activating a send <confidence value="5">k</confidence>
+ey <confidence value="5">(</confidence>
+act 480)<confidence value="6">.</confidence>
+ <confidence value="6">I</confidence>
+f a call includes a text message, the addressee list may be compiled in the manner discussed above (acts 410-470), before, during, or after the text message is composed, f<confidence value="68">or</confidence>
+ example, using keys <part-num-ref name="text message is composed, for example, using keys">
+        <confidence value="5">1</confidence>
+12,      </part-num-ref>
+ control keys <part-num-ref name="text message is composed, for example, using keys 112, control keys">120,</part-num-ref>
+ <confidence value="222222">and/or</confidence>
+ another component in communication device <part-num-ref name="text message is composed, for example, using keys 112, control keys 120, and/or another component in communication device">100.</part-num-ref>
+    </p>
+    <p id="p-78" num="78">
+      <confidence value="86">[0</confidence>
+069<confidence value="4">]</confidence>
+    Any of the above ordering criteria may be applied to any degree, individually or in combination with one or more other criteria. In one implementation, the ordering criteria are programmable by a user of communication device <part-num-ref name="user of communication device">100,</part-num-ref>
+ and may be changed accordingly. <confidence value="68">In</confidence>
+ another implementation, the ordering criteria, the call log information, <confidence value="222222">and/or</confidence>
+ the call list configurations may be specific to a pa<confidence value="8">r</confidence>
+ticular user of communication device <part-num-ref name="particular user of communication device">100,</part-num-ref>
+ <confidence value="222222">and/or</confidence>
+ a particular communication identifier associated with communication device <part-num-ref name="particular communication identifier associated with communication device">100.</part-num-ref>
+ For example, two or m<confidence value="8">o</confidence>
+re individual users of communication device <part-num-ref name="particular communication identifier associated with communication device 100. For example, two or more individual users of communication device">100</part-num-ref>
+ may be "logged in" as a distinct "current user" of communication device <part-num-ref name="distinct &quot;current user&quot; of communication device">100.</part-num-ref>
+ As another example, calls may be placed from <confidence value="222222">and/or</confidence>
+ received by communication device <part-num-ref name="distinct &quot;current user&quot; of communication device 100. As another example, calls may be placed from and/or received by communication device">100</part-num-ref>
+ via multiple assigned distinct communication <boundary-data type="header">-15-</boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. PS<confidence value="55">OS</confidence>
+ 073<confidence value="4884">1US1</confidence>
+      </boundary-data>
+identifiers. In <confidence value="8">e</confidence>
+ither case, a call <confidence value="8">l</confidence>
+ist configuration application consistent with principles of the invention, may be applied separately and associated with a specific user and/or a specific communication identifier<confidence value="5">.</confidence>
+    </p>
+    <heading id="h-10">EXAMPLES</heading>
+    <p id="p-79" num="79">[0070]   Figs. <confidence value="5885">SA-S</confidence>
+G illustrate exemplary call list configurations generated from recorded call activity fo<confidence value="5">r</confidence>
+ communication device 100 for the period 03/07/06 - 03/15/06 as reflected in call log <part-num-ref name="period 03/07/06 - 03/15/06 as reflected in call log">300,</part-num-ref>
+ which are displayed, in part, on display <part-num-ref name="period 03/07/06 - 03/15/06 as reflected in call log 300, which are displayed, in part, on display">140</part-num-ref>
+ of communication device <part-num-ref name="of communication device">100,</part-num-ref>
+ consistent with the <confidence value="8">p</confidence>
+rincipl<confidence value="8">e</confidence>
+s of the invention. As discussed above, the balance of the call list may be displayed corresponding to an input received from the user of communication device <part-num-ref name="user of communication device">100.</part-num-ref>
+ The exemplary call <confidence value="8">l</confidence>
+ist configurations may be generated, for example, by a statistical analysis of the logged call information performed by communication device <part-num-ref name="logged call information performed by communication device">100.</part-num-ref>
+ The statistical analysis may be used to determine, for example, a probability that respective communication identifiers in the call list <confidence value="668">are</confidence>
+ li<confidence value="8">k</confidence>
+ely to be the next communication identifier to be called using communication device <part-num-ref name="next communication identifier to be called using communication device">100.</part-num-ref>
+    </p>
+    <p id="p-80" num="80">[0071]   Fig. <confidence value="5">S</confidence>
+A shows a display of a portion of a call list generated from call log <part-num-ref name="call list generated from call log">300,</part-num-ref>
+ consistent with principles of the invention. The displayed call list in Fig. <confidence value="5">S</confidence>
+A may order "JULIE," "HOME<confidence value="5">,</confidence>
+" and "KIM," as entries <part-num-ref name="displayed call list in Fig. SA may order &quot;JULIE,&quot; &quot;HOME,&quot; and &quot;KIM,&quot; as entries">1,</part-num-ref>
+ <part-num-ref name="displayed call list in Fig. SA may order &quot;JULIE,&quot; &quot;HOME,&quot; and &quot;KIM,&quot; as entries 1,">2,</part-num-ref>
+ and <part-num-ref name="displayed call list in Fig. SA may order &quot;JULIE,&quot; &quot;HOME,&quot; and &quot;KIM,&quot; as entries 1, 2, and">3,</part-num-ref>
+ respectively, for example, based on the number of times (i.e., relative frequency) a numbers associated with an alias has been called during the period of recorded call activity for com<confidence value="8">m</confidence>
+unicati<confidence value="8">o</confidence>
+n device <part-num-ref name="period of recorded call activity for communication device">100.</part-num-ref>
+ As shown in Fig<confidence value="6">.</confidence>
+ <confidence value="588">5A,</confidence>
+ two <confidence value="5">o</confidence>
+r m<confidence value="8">o</confidence>
+re of the <confidence value="8">m</confidence>
+ultiple communication identifiers associated with "JULIE" (i.e., 555-555- <part-num-ref name="555-555-">1234,</part-num-ref>
+ 555-555-8901, 555<confidence value="5">-</confidence>
+555<confidence value="5">-</confidence>
+9012, etc.) may be considered as a single communication identifier for purposes of ordering the entries.    </p>
+    <p id="p-81" num="81">
+      <confidence value="2">[</confidence>
+0072]   <confidence value="5">F</confidence>
+ig. <confidence value="5">5</confidence>
+B shows another display of a portion of a call list generated from call l<confidence value="5">o</confidence>
+g <part-num-ref name="call list generated from call log">300,</part-num-ref>
+ consistent with principles of the invention. The displayed call list in Fig. <confidence value="5">5</confidence>
+B may order "BETH," "JULIE," and "HOME," as entries <part-num-ref name="displayed call list in Fig. 5B may order &quot;BETH,&quot; &quot;JULIE,&quot; and &quot;HOME,&quot; as entries">1,</part-num-ref>
+ <part-num-ref name="displayed call list in Fig. 5B may order &quot;BETH,&quot; &quot;JULIE,&quot; and &quot;HOME,&quot; as entries 1,">2,</part-num-ref>
+ and <part-num-ref name="displayed call list in Fig. 5B may order &quot;BETH,&quot; &quot;JULIE,&quot; and &quot;HOME,&quot; as entries 1, 2, and">3,</part-num-ref>
+ respectively, f<confidence value="5">o</confidence>
+r example, based on relative frequency, and on BETH being a "MISSED" call, which may accorded priority (here, vis-<confidence value="5">a</confidence>
+-vis all other entries shown in Fig. <confidence value="4">S</confidence>
+B) for purposes of ordering. In one implementation, <boundary-data type="header">-16-</boundary-data>
+      <page-break num="17"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Doc<confidence value="8">k</confidence>
+et No. PS<confidence value="65">OS</confidence>
+ 073<confidence value="5">1</confidence>
+ <confidence value="882">US1</confidence>
+      </boundary-data>
+priority accorded to a MISSED call may be removed once a call has been placed (i.e., returned) to the MISSED call, and/or based on an input received from a user of communication device <part-num-ref name="user of communication device">100.</part-num-ref>
+    </p>
+    <p id="p-82" num="82">
+      <confidence value="5">[</confidence>
+0073]    Fig. <confidence value="5">5</confidence>
+C shows another display of a portion of a call list generated from call log <part-num-ref name="call list generated from call log">300,</part-num-ref>
+ consistent with principles of the invention. The displayed call list in Fig. 5C may order "HEIDI," "JULIE," and "<confidence value="66885">I-OME</confidence>
+," as entries <part-num-ref name="displayed call list in Fig. 5C may order &quot;HEIDI,&quot; &quot;JULIE,&quot; and &quot;I-OME,&quot; as entries">
+        <confidence value="5">1</confidence>
+,      </part-num-ref>
+ <part-num-ref name="displayed call list in Fig. 5C may order &quot;HEIDI,&quot; &quot;JULIE,&quot; and &quot;I-OME,&quot; as entries 1,">2,</part-num-ref>
+ and <part-num-ref name="displayed call list in Fig. 5C may order &quot;HEIDI,&quot; &quot;JULIE,&quot; and &quot;I-OME,&quot; as entries 1, 2, and">3,</part-num-ref>
+ respectively, for example, based on relative frequency, and on HEIDI being <confidence value="2222222222">calendared</confidence>
+ information (e.g., birthday), which <confidence value="5">m</confidence>
+ay be accorded priority (here, vis-<confidence value="5">a</confidence>
+-vis all other entries shown in Fig. 5C) for purposes of ordering. In <confidence value="885">one</confidence>
+ implementation, priority accorded to <confidence value="2222222222">calendared</confidence>
+ information may b<confidence value="5">e</confidence>
+ removed once a call has been placed to the communication identifier associated with the <confidence value="2222222222">calendared</confidence>
+ information, <confidence value="222222">and/or</confidence>
+ based on an input received from a user of communication device <part-num-ref name="user of communication device">100.</part-num-ref>
+    </p>
+    <p id="p-83" num="83">[0074<confidence value="4">]</confidence>
+    Fig. <confidence value="5">S</confidence>
+D shows another display of a portion of a call list generated fro<confidence value="8">m</confidence>
+ call log <part-num-ref name="call list generated from call log">300,</part-num-ref>
+ consistent with principles of the invention<confidence value="5">.</confidence>
+ The displayed call list in Fig. <confidence value="58">5D</confidence>
+ <confidence value="5">m</confidence>
+ay order <confidence value="8">"</confidence>
+HOM<confidence value="8">E</confidence>
+," "JILL," and "SUSAN," as entries <part-num-ref name="displayed call list in Fig. 5D may order &quot;HOME,&quot; &quot;JILL,&quot; and &quot;SUSAN,&quot; as entries">1,</part-num-ref>
+ <part-num-ref name="displayed call list in Fig. 5D may order &quot;HOME,&quot; &quot;JILL,&quot; and &quot;SUSAN,&quot; as entries 1,">2,</part-num-ref>
+ and <part-num-ref name="displayed call list in Fig. 5D may order &quot;HOME,&quot; &quot;JILL,&quot; and &quot;SUSAN,&quot; as entries 1, 2, and">3,</part-num-ref>
+ respectively, for example, based on relative frequency, and the recency of the entries, such that the "age" of a call is weighting factor for pu<confidence value="8">r</confidence>
+poses of ordering.    </p>
+    <p id="p-84" num="84">
+      <confidence value="5">[</confidence>
+0075]   Fig. <confidence value="45">SE</confidence>
+ shows another display of a portion of a call list generated from call log <part-num-ref name="call list generated from call log">300,</part-num-ref>
+ consistent with principles of the in<confidence value="8">v</confidence>
+ention. The displayed call list in Fig. <confidence value="5">S</confidence>
+E may order "HOME," "JULIE," and "JILL," as entries <part-num-ref name="displayed call list in Fig. SE may order &quot;HOME,&quot; &quot;JULIE,&quot; and &quot;JILL,&quot; as entries">1,</part-num-ref>
+ <part-num-ref name="displayed call list in Fig. SE may order &quot;HOME,&quot; &quot;JULIE,&quot; and &quot;JILL,&quot; as entries 1,">2,</part-num-ref>
+ and <part-num-ref name="displayed call list in Fig. SE may order &quot;HOME,&quot; &quot;JULIE,&quot; and &quot;JILL,&quot; as entries 1, 2, and">3,</part-num-ref>
+ respectively, f<confidence value="5">o</confidence>
+r example, based <confidence value="66">on</confidence>
+ relative frequency, and the time of day, i.e., "<confidence value="6866">8:00</confidence>
+AM." That is, an analysis of call log <part-num-ref name="analysis of call log">300</part-num-ref>
+ <confidence value="588">may</confidence>
+ have identified a pattern whereby a call is recurringly placed to HOME at approximately <confidence value="6866">8:00</confidence>
+AM day, such that <confidence value="6686">HOME</confidence>
+ may b<confidence value="5">e</confidence>
+ disproportionately counted (here, vis-<confidence value="4">a</confidence>
+-vis JILL) for purposes of ordering. In one implementation, priority weighting based on t<confidence value="86">im</confidence>
+e-of<confidence value="5">-</confidence>
+day may <confidence value="66">be</confidence>
+ removed once a call has been placed to the corresponding communication identifier, or the window of time passes. The window of time for applying the time-of<confidence value="5">-</confidence>
+day priority weighting <confidence value="5">m</confidence>
+ay be any predetermined period and need not be bounded by the extreme times (shown as 7:59 <boundary-data type="header">-17-</boundary-data>
+      <page-break num="18"/>
+      <boundary-data type="header">
+        <confidence value="8">P</confidence>
+AT<confidence value="8">E</confidence>
+NT      </boundary-data>
+      <boundary-data type="header">Docket No. P<confidence value="5">S</confidence>
+05 073<confidence value="5885">1US1</confidence>
+      </boundary-data>
+and 8:05AM in Fig. <confidence value="5">5</confidence>
+E) in the identified pattern. F<confidence value="5">o</confidence>
+r example, the window here may extend between 7:00 and 9:<confidence value="66">00</confidence>
+AM, during which HOME may be accorded priority in ordering entries in the configured call list.    </p>
+    <p id="p-85" num="85">
+      <confidence value="2">1</confidence>
+0076]   Fig. <confidence value="5">5</confidence>
+F shows the call list of Fig. <confidence value="5">5</confidence>
+A in which entry <part-num-ref name="call list of Fig. 5A in which entry">(3)</part-num-ref>
+ "KIM" may have been highlighted for selection by a user of communication device <part-num-ref name="user of communication device">
+        <confidence value="666">100</confidence>
+,      </part-num-ref>
+ for example, after scrolling "down" the call list via entries <part-num-ref name="call list via entries">
+        <confidence value="686">(1)</confidence>
+      </part-num-ref>
+ and <confidence value="5">(</confidence>
+2). In one implementation, once highlighted, KIM may be selected by receiving an input from the user, f<confidence value="5">o</confidence>
+r example, via the keys <part-num-ref name="keys">
+        <confidence value="66">11</confidence>
+2      </part-num-ref>
+ and/or control keys <part-num-ref name="and/or control keys">1<confidence value="5">2</confidence>
+0.      </part-num-ref>
+ Fig. <confidence value="5">5</confidence>
+G shows a secondary call list that may be generated based <confidence value="5">o</confidence>
+n the selection of KIM from the call list of Fig. <confidence value="5">S</confidence>
+F. The derivative call list shown in Fig. <confidence value="55">5G</confidence>
+ may be based on relative frequency, and an identified degree of association with the previously selected entry, i.e., KIM, for example, corresponding to multi-recipient text messages sent <confidence value="5">o</confidence>
+n 3<confidence value="5">/</confidence>
+10 and 3/7/06.    </p>
+    <heading id="h-11">CONCLUSION</heading>
+    <p id="p-86" num="86">
+      <confidence value="2">1</confidence>
+007<confidence value="86">7]</confidence>
+    Implementations consistent with principles of the invention may provide smart call list config<confidence value="8">u</confidence>
+ration that produces a displayable call list to a user of a communication device t<confidence value="8">h</confidence>
+at may optimally order entries based on a determined likelihood that any particular number will be the next to be called.    </p>
+    <p id="p-87" num="87">[0078<confidence value="5">]</confidence>
+   The foregoing description of preferred embodiments of the invention provides illustration and description, but is not intended to be exhaustive or to limit the invention to the precise f<confidence value="8">o</confidence>
+rm disclosed. Modifications and variations are possible in light of the above teachings <confidence value="5">o</confidence>
+r may be acquired from practice of the invention.    </p>
+    <p id="p-88" num="88">
+      <confidence value="588885">[0079]</confidence>
+   While a series of acts has been described with regard to Fig. 4, the <confidence value="8">o</confidence>
+rd<confidence value="8">e</confidence>
+r of the acts may be modified in other implementations consiste<confidence value="8">n</confidence>
+t with the principles of the invention.    </p>
+    <p id="p-89" num="89">Further, non-dependent acts may be performed in parallel.</p>
+    <p id="p-90" num="90">[0080]   It will be apparent to one of ord<confidence value="8">i</confidence>
+nary skill in the art that aspects of the invention, as described above, <confidence value="5">m</confidence>
+ay be implemented in many different forms of software, firmware, and hardware in the implementations illustrated in the figures. The actual software code <confidence value="68">or</confidence>
+ <boundary-data type="header">-18-</boundary-data>
+      <page-break num="19"/>
+      <boundary-data type="header">PATENT</boundary-data>
+      <boundary-data type="header">Docket No. PS<confidence value="55">O5</confidence>
+ 0731 <confidence value="88">US</confidence>
+ <confidence value="6">I</confidence>
+      </boundary-data>
+specialized control hardware used to implement aspects consistent with the principles of the invention is not limiting of the invention. Thus, the operation and behavior of the aspects were described without reference to the specific sof<confidence value="8">t</confidence>
+ware code-<confidence value="5">i</confidence>
+t being understood that one of ordinary skill in the art would be able to design software and control hardware to implement the aspects based on the description herein.    </p>
+    <p id="p-91" num="91">[0081<confidence value="5">]</confidence>
+   It should be emphasized that the term "<confidence value="22222222222222222222">comprises/comprising</confidence>
+" when used in this specification and/or claims is taken to specify the presence of stated features, integers, steps or components but does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof<confidence value="5">.</confidence>
+    </p>
+    <p id="p-92" num="92">
+      <confidence value="666685">[0082]</confidence>
+    No element, act, or instruction used in the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article "a" is intended to include one or more items. Where only one item is intended, the term "one" <confidence value="5">o</confidence>
+r similar language i<confidence value="6">s</confidence>
+ used. Further, the ph<confidence value="8">r</confidence>
+ase "based <confidence value="5">o</confidence>
+n" is intended to mean "based, at least in part, on" unless explicitly stated otherwise.    </p>
+    <boundary-data type="header">
+      <confidence value="6666">-19-</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11289095.xml

@@ -0,0 +1,349 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11289095</doc-number>
+        <date>2005-11-29</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">SPACE-SHIFTING MEDIA STREAMING SYSTEM</heading>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">1.   Field of the Invention:</p>
+    <p id="p-2" num="2">[0001]    The present invention relates generally to media broadcasts and, in particular, to a method, system, and computer program product for space-shifting media.</p>
+    <p id="p-3" num="3">2.   Description of the Related Art:</p>
+    <p id="p-4" num="4">[0002<confidence value="5">]</confidence>
+    Two lucrative and ubiquitous entertainment technologies are time-shifting and space-shifting features. Time-shifting means changing when someone will watch a media broadcast. TiVo and VCRs are popular time-shifting devices. Space-shifting means changing where someone will watch a media broadcast. Media center devices that stream media from a computer to a television in another room, or which copy audio/video to a hand-held device are examples of space-shifting. Time-shifting and space-shifting can be used in combination or in exclusion of each other. Media encompasses many forms of broadcast material including, television and high-definition television broadcasts, radio and audio broadcasts, web casts, streaming video, etc.    </p>
+    <p id="p-5" num="5">[0003]   One challenge with technologies that employ real-time space-shifting, such as, for example, streaming from one device to another, is moving locations. With current technology, if a person is watching a movie streamed over his/her home network from the upstairs computer to the downstairs television, via a media center hub, and another, second, person wants him/her to watch the movie on the television in an upstairs bedroom, there are inconvenient steps that have to be performed. The steps comprise: <part-num-ref name="steps comprise:">1)</part-num-ref>
+ changing the downstairs television to <boundary-data type="header">
+        <confidence value="8">1</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS92005<confidence value="11">OG</confidence>
+81US<confidence value="1">l</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+whatever media the second person desires to watch, <part-num-ref name="second person desires to watch,">2)</part-num-ref>
+ either the first person or another person needs go to the other device location, turn everything on and go through the media center menus to select the movie that the first person was watching, <part-num-ref name="first person was watching,">3)</part-num-ref>
+ and then fast forward or skip to wherever the first person left off watching the movie, or close to it at least. There are additional steps if the second person had been watching something on another device that he/she now wants to switch to the downstairs television.    </p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS920050681US<confidence value="4">1</confidence>
+    </boundary-data>
+    <heading id="h-3">SUMMARY OF THE INVENTION</heading>
+    <p id="p-6" num="6">
+      <page-break num="3"/>
+[0004]   The present invention provides a method, system, and computer program product for space-shifting media broadcasts. A request to space-shift a media broadcast is received. A device, out of a network of devices is selected to space-shift the media broadcast to. The media broadcast is then space-shifted to the selected device.    </p>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS920050681US1</boundary-data>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-7" num="7">
+      <page-break num="4"/>
+[0005]   The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment wh<confidence value="8">e</confidence>
+n read in conjunction with the accompanying drawings, wherein:    </p>
+    <p id="p-8" num="8">[0006]   Figure 1 is a pictorial representation of a network of data processing systems in which exemplary aspects of the present invention may be implemented;</p>
+    <p id="p-9" num="9">[0007]   Figure 2 is a block diagram of a data processing system in which exemplary aspects of the present invention may be implemented;</p>
+    <p id="p-10" num="10">[0008]   Figure 3 is a block diagram depicting a system for space-shifting media in accordance with an exemplary embodiment of the present invention; and [0009]   Figure 4 is flowchart illustrating the operation of space-shifting of media, in accordance with an exemplary embodiment of the present invention.</p>
+    <boundary-data type="header">
+      <confidence value="5">4</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS92005<confidence value="1161771">OG81US1</confidence>
+    </boundary-data>
+    <heading id="h-5">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT</heading>
+    <p id="p-11" num="11">
+      <page-break num="5"/>
+      <confidence value="5">[</confidence>
+0010] Figures 1-2 are provided as exemplary diagrams of data processing environments in which embodiments of the present invention may be implemented. It should be appreciated that Figures 1-2 are only exemplary and are not intended to assert or imply any limitation with regard to the environments in which aspects or embodiments of the present invention may be implemented.    </p>
+    <p id="p-12" num="12">Many modifications to the depicted environments may be made without departing from the spirit and scope of the present invention.</p>
+    <p id="p-13" num="13">[0011] With reference now to the figures, Figure 1 depicts a pictorial representation of a network of data processing systems in which aspects of the present invention may be implemented. Network data processing system <part-num-ref name="present invention may be implemented. Network data processing system">100</part-num-ref>
+ is a network of computers in which embodiments of the present invention may be implemented. Network data processing system <part-num-ref name="present invention may be implemented. Network data processing system">100</part-num-ref>
+ contains network <part-num-ref name="contains network">102,</part-num-ref>
+ which is the medium used to provide communications links between various devices and computers connected together within network data processing system <part-num-ref name="medium used to provide communications links between various devices and computers connected together within network data processing system">100.</part-num-ref>
+ Network <part-num-ref name="medium used to provide communications links between various devices and computers connected together within network data processing system 100. Network">102</part-num-ref>
+ may include connections, such as wire, wireless communication links, or fiber optic cables.    </p>
+    <p id="p-14" num="14">
+      <confidence value="5">[</confidence>
+0012] In the depicted example, server <part-num-ref name="depicted example, server">104</part-num-ref>
+ and server <part-num-ref name="and server">106</part-num-ref>
+ connect to network <part-num-ref name="connect to network">102</part-num-ref>
+ along with storage unit <part-num-ref name="along with storage unit">108.</part-num-ref>
+ In addition, clients <part-num-ref name="along with storage unit 108. In addition, clients">110,</part-num-ref>
+ <part-num-ref name="along with storage unit 108. In addition, clients 110,">112,</part-num-ref>
+ and <part-num-ref name="along with storage unit 108. In addition, clients 110, 112, and">114</part-num-ref>
+ connect to network <part-num-ref name="connect to network">102.</part-num-ref>
+ These clients <part-num-ref name="connect to network 102. These clients">110,</part-num-ref>
+ <part-num-ref name="connect to network 102. These clients 110,">112,</part-num-ref>
+ and <part-num-ref name="connect to network 102. These clients 110, 112, and">114</part-num-ref>
+ may be, for example, personal computers or network computers. In the depicted example, server <part-num-ref name="depicted example, server">104</part-num-ref>
+ provides data, such as boot files, operating system images, and applications to clients <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients">110,</part-num-ref>
+ <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients 110,">112,</part-num-ref>
+ and <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients 110, 112, and">114.</part-num-ref>
+ Clients <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients 110, 112, and 114. Clients">110,</part-num-ref>
+ <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients 110, 112, and 114. Clients 110,">112,</part-num-ref>
+ and <part-num-ref name="provides data, such as boot files, operating system images, and applications to clients 110, 112, and 114. Clients 110, 112, and">114</part-num-ref>
+ are clients to server <part-num-ref name="are clients to server">104</part-num-ref>
+ in this example. Network data.processing <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS920050681US<confidence value="4">1</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+system <part-num-ref name="in this example. Network data.processing system">100</part-num-ref>
+ may include additional servers, clients, and other devices not shown.    </p>
+    <p id="p-15" num="15">[0013] In the depicted example, network data processing system <part-num-ref name="depicted example, network data processing system">100</part-num-ref>
+ is the Internet with network <part-num-ref name="Internet with network">102</part-num-ref>
+ representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, government, educational and other computer systems that route data and messages. Of course, network data processing system <part-num-ref name="backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, government, educational and other computer systems that route data and messages. Of course, network data processing system">100</part-num-ref>
+ also may be implemented as a number of different types of networks, such as for example, an intranet, a local area network (LAN), or a w<confidence value="8">i</confidence>
+de area network (WAN). Figure 1 is intended as an example, and not as an architectural limitation for different embodiments of the present invention.    </p>
+    <p id="p-16" num="16">[0014] With reference now to Figure 2, a block diagram of a data processing system is shown in which aspects of the present invention may be implemented. Data processing system <part-num-ref name="present invention may be implemented. Data processing system">200</part-num-ref>
+ is an example of a computer, such as server <part-num-ref name="computer, such as server">104</part-num-ref>
+ or client <part-num-ref name="or client">110</part-num-ref>
+ in Figure 1, in which computer usable code or instructions implementing the processes for embodiments of the present invention may be located.    </p>
+    <p id="p-17" num="17">[0015] In the depicted example, data processing system <part-num-ref name="depicted example, data processing system">200</part-num-ref>
+ employs a hub architecture including north bridge and memory controller hub (MCH) <part-num-ref name="hub architecture including north bridge and memory controller hub (MCH)">202</part-num-ref>
+ and south bridge and input/output (I/O) controller hub (ICH) <part-num-ref name="and south bridge and input/output (I/O) controller hub (ICH)">204.</part-num-ref>
+ Processing unit <part-num-ref name="and south bridge and input/output (I/O) controller hub (ICH) 204. Processing unit">206,</part-num-ref>
+ main memory <part-num-ref name="and south bridge and input/output (I/O) controller hub (ICH) 204. Processing unit 206, main memory">208,</part-num-ref>
+ and graphics processor <part-num-ref name="and south bridge and input/output (I/O) controller hub (ICH) 204. Processing unit 206, main memory 208, and graphics processor">210</part-num-ref>
+ are connected to north bridge and memory controller hub <part-num-ref name="are connected to north bridge and memory controller hub">202.</part-num-ref>
+    </p>
+    <p id="p-18" num="18">Graphics processor 210 may be connected to north bridge and memory controller hub <part-num-ref name="may be connected to north bridge and memory controller hub">202</part-num-ref>
+ through an accelerated graphics port (AGP)<confidence value="5">.</confidence>
+    </p>
+    <boundary-data type="header">
+      <confidence value="8">6</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS920050681US<confidence value="4">1</confidence>
+    </boundary-data>
+    <p id="p-19" num="19">
+      <page-break num="7"/>
+[0016] <confidence value="5">I</confidence>
+n the depicted example, local area network (LAN) adapter <part-num-ref name="depicted example, local area network (LAN) adapter">212</part-num-ref>
+ connects to south bridge and I/O controller hub <part-num-ref name="connects to south bridge and I/O controller hub">204.</part-num-ref>
+ Audio adapter <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter">216,</part-num-ref>
+ keyboard and mouse adapter <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter">220,</part-num-ref>
+ modem <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem">222,</part-num-ref>
+ read only memory (ROM) <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM)">224,</part-num-ref>
+ hard disk drive (HDD) <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224, hard disk drive (HDD)">226,</part-num-ref>
+ CD-ROM drive <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive">230,</part-num-ref>
+ universal serial bus (USB) ports and other communications ports <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive 230, universal serial bus (USB) ports and other communications ports">232,</part-num-ref>
+ and PCI/PCIe devices <part-num-ref name="connects to south bridge and I/O controller hub 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive 230, universal serial bus (USB) ports and other communications ports 232, and PCI/PCIe devices">234</part-num-ref>
+ connect to south bridge and I/O controller hub <part-num-ref name="connect to south bridge and I/O controller hub">204</part-num-ref>
+ through bus <part-num-ref name="through bus">238</part-num-ref>
+ and bus <part-num-ref name="and bus">240.</part-num-ref>
+ PCI/PCIe devices may include, for example, Ethernet adapters, add- in cards and PC cards for notebook computers. PCI uses a card bus controller, while PCIe does not. RO<confidence value="5">M</confidence>
+ <part-num-ref name="card bus controller, while PCIe does not. ROM">224</part-num-ref>
+ may be, for example, a flash binary input/output system (BIOS)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-20" num="20">[0017] Hard disk drive 226 and CD-ROM drive <part-num-ref name="and CD-ROM drive">230</part-num-ref>
+ connect to south bridge and I/O controller hub <part-num-ref name="connect to south bridge and I/O controller hub">204</part-num-ref>
+ through bus <part-num-ref name="through bus">240.</part-num-ref>
+    </p>
+    <p id="p-21" num="21">Hard disk drive 226 and CD-ROM drive <part-num-ref name="and CD-ROM drive">230</part-num-ref>
+ may use, for example, an integrated drive electronics (IDE) or serial advanced technology attachment (SATA) interface. Super I/O (SIO) device <part-num-ref name="integrated drive electronics (IDE) or serial advanced technology attachment (SATA) interface. Super I/O (SIO) device">236</part-num-ref>
+ may be connected to south bridge and I/O controller hub <part-num-ref name="may be connected to south bridge and I/O controller hub">204.</part-num-ref>
+    </p>
+    <p id="p-22" num="22">[0018] An operating system runs on processing unit <part-num-ref name="operating system runs on processing unit">206</part-num-ref>
+ and coordinates and provides control of various components within data processing system <part-num-ref name="and coordinates and provides control of various components within data processing system">200</part-num-ref>
+ in Figure 2. As a client, the operating system may be a commercially available operating system such as Microsoft<confidence value="2">®</confidence>
+ Windows<confidence value="2">®</confidence>
+ XP (Microsoft and Windows are trademarks of Microsoft Corporation in the United States, other countries, or both). An object-oriented programming system, such as the Java programming system, may run in conjunction with the operating system and provides calls to the operating system from Java programs or applications executing on data processing system <part-num-ref name="operating system from Java programs or applications executing on data processing system">200</part-num-ref>
+ (Java is a trademark of Sun Microsystems, Inc. in the United States, other countries, or both)<confidence value="5">.</confidence>
+    </p>
+    <boundary-data type="header">
+      <confidence value="8">7</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AU<confidence value="5">S</confidence>
+920050681U<confidence value="68">S1</confidence>
+    </boundary-data>
+    <p id="p-23" num="23">
+      <page-break num="8"/>
+[0019] As a server, data processing system <part-num-ref name="server, data processing system">200</part-num-ref>
+ may be, for example, an IBM eServer<confidence value="4">"</confidence>
+ pSeries<confidence value="5">®</confidence>
+ computer system, running the Advanced Interactive Executive (<confidence value="22228">AIX®)</confidence>
+ operating system or LINUX operating system (eServer, pSeries and AIX are trademarks of International Business Machines Corporation in the United States, other countries, or both while Linux is a trademark of Linus Torvalds in the United States, other countries, or both)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-24" num="24">Data processing system 200 may be a symmetric multiprocessor (SMP) system including a plurality of processors in processing unit <part-num-ref name="plurality of processors in processing unit">206.</part-num-ref>
+ Alternatively, a single processor system may be employed.    </p>
+    <p id="p-25" num="25">[0020] Instructions for the operating system, the object- oriented programming system, and applications or programs are located on storage devices, such as hard disk drive <part-num-ref name="object- oriented programming system, and applications or programs are located on storage devices, such as hard disk drive">226,</part-num-ref>
+ and may be loaded into main memory <part-num-ref name="object- oriented programming system, and applications or programs are located on storage devices, such as hard disk drive 226, and may be loaded into main memory">208</part-num-ref>
+ for execution by processing unit <part-num-ref name="for execution by processing unit">206.</part-num-ref>
+ The processes for embodiments of the present invention are performed by processing unit <part-num-ref name="present invention are performed by processing unit">206</part-num-ref>
+ using computer usable program code, which may be located in a memory such as, for example, main memory <part-num-ref name="memory such as, for example, main memory">208,</part-num-ref>
+ read only memory <part-num-ref name="memory such as, for example, main memory 208, read only memory">224,</part-num-ref>
+ or in one or more peripheral devices <part-num-ref name="memory such as, for example, main memory 208, read only memory 224, or in one or more peripheral devices">226</part-num-ref>
+ and <part-num-ref name="and">230.</part-num-ref>
+    </p>
+    <p id="p-26" num="26">[0021] Those of ordinary skill in the art will appreciate that the hardware in Figures 1-2 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash memory, equivalent non- volatile memory, or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in Figures 1-2. Also, the processes of the present invention may be applied to a multiprocessor data processing system.</p>
+    <p id="p-27" num="27">
+      <confidence value="5">[</confidence>
+0022] In some illustrative examples, data processing system 200 may be a personal digital assistant (PDA), which is configured with flash memory to provide non- <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS92005<confidence value="6686884">0681US1</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+volatile memory for storing operating system files and/or user-generated data.    </p>
+    <p id="p-28" num="28">[0023]   A bus system may be comprised of one or more buses, such as bus <part-num-ref name="bus system may be comprised of one or more buses, such as bus">238</part-num-ref>
+ or bus <part-num-ref name="or bus">240</part-num-ref>
+ as shown in Figure 2.    </p>
+    <p id="p-29" num="29">Of course the bus system may be implemented using any type of communications fabric or architecture that provides for a transfer of data between different components or devices attached to the fabric or architecture. A communications unit may include one or more devices used to transmit and receive data, such as modem <part-num-ref name="communications unit may include one or more devices used to transmit and receive data, such as modem">222</part-num-ref>
+ or network adapter <part-num-ref name="or network adapter">212</part-num-ref>
+ of Figure 2. A memory may be, for example, main memory <part-num-ref name="memory may be, for example, main memory">208,</part-num-ref>
+ read only memory <part-num-ref name="memory may be, for example, main memory 208, read only memory">224,</part-num-ref>
+ or a cache such as found in north bridge and memory controller hub <part-num-ref name="cache such as found in north bridge and memory controller hub">202</part-num-ref>
+ in Figure 2. The depicted examples in Figures 1-2 and above-described examples are not meant to imply architectural limitations. For example, data processing system <part-num-ref name="depicted examples in Figures 1-2 and above-described examples are not meant to imply architectural limitations. For example, data processing system">200</part-num-ref>
+ also may be a tablet computer, laptop computer, or telephone device in addition to taking the form of a PDA.    </p>
+    <p id="p-30" num="30">[0024]    In an exemplary embodiment, the present invention remembers what media and devices various individuals are currently viewing or hearing and allows the various individuals to space-shift that media and its settings to any other device such that an individual may pick up where the individual left off, in terms of viewing or hearing, with the minimum of effort. A device means any tangible device capable of creating, broadcasting, receiving, transmitting, or reproducing a media signal, such as, for example, but not limited to, televisions, radios, compact disk players, data processing systems, DVD players, etc.</p>
+    <p id="p-31" num="31">[0025]    In another exemplary embodiment the present invention provides a remote control device that has individual buttons that can be mapped to individuals in <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS920050681US<confidence value="4">1</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+the family or other group who share devices, such as, for example, <part-num-ref name="family or other group who share devices, such as, for example,">4</part-num-ref>
+ buttons for a family of four, or other such mechanism where family members can quickly identify themselves to a device. So when an individual presses their button, the current device commences with the media that individual was last viewing or hearing. In a further exemplary embodiment, each individual may have multiple profiles so that the individual may store a set of current settings for multiple media streams. This would allow the individual to very quickly queue up to where the individual left off viewing or hearing in the middle of any number of video and audio streams. A remote control may be various devices and implementations, including, but not limited to, virtual remote control device, controls embedded in the device, or any other controlling mechanism.    </p>
+    <p id="p-32" num="32">[0026]   The present invention provides convenience in media changing, which becomes especially valuable where there are multiple individuals using the system, such as a family, and where there are multiple devices individuals can choose to space-shift to. Space-shifting is moving a media broadcast from one device to another device. For example, a user may be watching a broadcast on his/her television and then space-shift the broadcast to his/her laptop computer. Or, for example, a broadcast may be space-shifted from a television or computer in one part of the house to a television or computer in another part of the house, such as from the family room to bedroom. Therefore, when an individual is viewing or listening to a media broadcast, that broad<confidence value="7">c</confidence>
+ast is already being recorded, so that the if the individual decides to space-shift the media broadcast, the media broadcast may be picked up on the new device from the point where the individual last left off.    </p>
+    <boundary-data type="header">
+      <confidence value="88">10</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AU<confidence value="5">S</confidence>
+920050681U<confidence value="68">S1</confidence>
+    </boundary-data>
+    <p id="p-33" num="33">
+      <page-break num="11"/>
+[0027]   The present invention still has value for a single individual using a single device in that the individual may resume his/her media experience right where he/she left off. And if the individual has multiple profiles, the individual can resume any number of different media experiences.    </p>
+    <p id="p-34" num="34">[0028]   Turning to Figure 3, Figure 3 is a block diagram depicting a system, generally designated by reference number <part-num-ref name="system, generally designated by reference number">300,</part-num-ref>
+ for space-shifting media in accordance with an exemplary embodiment of the present invention. System <part-num-ref name="present invention. System">300</part-num-ref>
+ comprises four components, media server <part-num-ref name="comprises four components, media server">302,</part-num-ref>
+ user manager <part-num-ref name="comprises four components, media server 302, user manager">304,</part-num-ref>
+ device manager <part-num-ref name="comprises four components, media server 302, user manager 304, device manager">306</part-num-ref>
+ and user identifier <part-num-ref name="and user identifier">308.</part-num-ref>
+ In an exemplary embodiment, the present invention is implemented in a local network. However, those skilled in the art will recognize that the present invention could be implemented as a remote network or in combination with a remote network or using peer-to-peer technology.    </p>
+    <p id="p-35" num="35">[0029]   Media server 302 is either a server where all the media resides, or media server <part-num-ref name="media resides, or media server">302</part-num-ref>
+ is connected to and has the ability to control the devices where the media does reside. Media server <part-num-ref name="media does reside. Media server">302</part-num-ref>
+ may be implemented as a new server added to an existing system or as additional functions on top of existing media servers. Media server <part-num-ref name="existing system or as additional functions on top of existing media servers. Media server">302</part-num-ref>
+ records all media for all users as the media is being broadcast. If a user does not desire to save a particular media broadcast, the media is discarded once the broadcast has ceased. In an exemplary embodiment, media server <part-num-ref name="exemplary embodiment, media server">302</part-num-ref>
+ resides on a data processing system with a large amount of storage space. In other exemplary embodiments, media server <part-num-ref name="large amount of storage space. In other exemplary embodiments, media server">302</part-num-ref>
+ may be implemented as either a dedicated or distributed device. Media server <part-num-ref name="dedicated or distributed device. Media server">302</part-num-ref>
+ is networked to all the devices in the system and <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS92005<confidence value="6666884">0681US1</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+receives instructions over the network whenever a user identifies himself/herself at a device.    </p>
+    <p id="p-36" num="36">[0030]   User manager 304 allows individual users to create profiles. The profiles are attached to unique identifiers, or user names, that media server <part-num-ref name="profiles are attached to unique identifiers, or user names, that media server">302</part-num-ref>
+ and user identifier <part-num-ref name="and user identifier">308</part-num-ref>
+ use to maintain information and serve media for each individual user. The profile may include custom name information for display on devices, such as the "display" button on some television remotes, showing whose identity is currently being used. User manager <part-num-ref name="&quot;display&quot; button on some television remotes, showing whose identity is currently being used. User manager">304</part-num-ref>
+ also stores the media information for each individual user, including media type, location/file name, time where left off, and media settings, such as volume, brightness, playback options, etc.    </p>
+    <p id="p-37" num="37">[0031]    <confidence value="5">I</confidence>
+n an exemplary embodiment of the present invention, the profiles enable user manager <part-num-ref name="profiles enable user manager">304</part-num-ref>
+ to maintain settings for multiple media streams for each user. This is especially beneficial to those individuals who like to go back and forth at various times watching a movie, a television show, listening to music, etc. For example, if a user were to pause a movie for the evening, that user might watch television and listen to music before going back to the movie because the user prefers to watch movies late at night.    </p>
+    <p id="p-38" num="38">[0032]    In another exemplary embodiment, user manager 304 includes passwords associated with the profiles. This functionality requires an authentication mechanism in user identifier <part-num-ref name="authentication mechanism in user identifier">308</part-num-ref>
+ for each device. This may be useful in a family to prevent unwanted alteration of allowed viewing material.    </p>
+    <p id="p-39" num="39">[0033]    In an exemplary embodiment, user manager <part-num-ref name="exemplary embodiment, user manager">304</part-num-ref>
+ comprises a user interface and a database. The interface may be anything such as an application graphical user interface running on a computer<confidence value="8">,</confidence>
+ <confidence value="24">-a</confidence>
+r a<confidence value="82">..</confidence>
+web page, <confidence value="288">-a.</confidence>
+    </p>
+    <boundary-data type="header">
+      <confidence value="882">12-</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS92005<confidence value="6686885">0681US1</confidence>
+    </boundary-data>
+    <p id="p-40" num="40">
+      <page-break num="13"/>
+clickable menu on a television, or a combination thereof.    </p>
+    <p id="p-41" num="41">The database may be implemented as part of media server 302 or on a completely different data processing system.</p>
+    <p id="p-42" num="42">[0034]   Device manager 306 controls which devices may participate in the system. Since the system will receive commands over the network from these devices, identification of each device is required. In an exemplary embodiment of the present invention, device manager <part-num-ref name="present invention, device manager">306</part-num-ref>
+ contains a mapping of commands for various devices that implement commands differently. Since media is being streamed, settings may be included in the stream. In an exemplary embodiment, device manager <part-num-ref name="exemplary embodiment, device manager">306</part-num-ref>
+ includes controls for each device to adjust things like volume on the device itself.    </p>
+    <p id="p-43" num="43">[0035]    In an exemplary embodiment of the present invention, device manager <part-num-ref name="present invention, device manager">306</part-num-ref>
+ is able to queue up requested media, adjust volume for an individual user's settings, and turn on required devices such as the television, sound system, and so forth, with the push of a single button. This implementation may require integration with devices similar to remote controls that can program control of multiple devices. The device manager would receive volume, brightness, and other settings information from the device to be controlled and be able to control it or compensate for it by adjusting the media stream. Some settings may have a modifier depending on which device the media is being space- shifted to. For example, a user may want the brightness automatically increased by a set amount if media is space-shifted from a user's television to a user's notebook computer.    </p>
+    <p id="p-44" num="44">[0036]    In an exemplary embodiment, device manager <part-num-ref name="exemplary embodiment, device manager">306</part-num-ref>
+ comprises a user interface and a database. The interface may be an application graphical user interface running on <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AU<confidence value="5">S</confidence>
+920050681U<confidence value="68">S1</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+a computer, a web page, a clickable menu on a television, or a combination thereof. The database may be implemented as part of media server <part-num-ref name="database may be implemented as part of media server">302</part-num-ref>
+ or on a completely different data processing system.    </p>
+    <p id="p-45" num="45">[0037]   User identifier 308 is a mechanism through which users identify themselves and the profile they wish to use to the system. User identifier <part-num-ref name="system. User identifier">308</part-num-ref>
+ should function with all devices in the network. In an exemplary embodiment, user identifier <part-num-ref name="exemplary embodiment, user identifier">308</part-num-ref>
+ may be implemented at each device as a change to the device itself, such as the features included in the device's remote control or in the device's display and setup settings. In another exemplary embodiment, user identifier <part-num-ref name="device's display and setup settings. In another exemplary embodiment, user identifier">308</part-num-ref>
+ may be implemented as a proxy device that sits between the device and media server <part-num-ref name="device and media server">302,</part-num-ref>
+ near the device so that the device may be remotely controlled. In an exemplary embodiment, user identifier <part-num-ref name="exemplary embodiment, user identifier">308</part-num-ref>
+ is implemented in a universal remote control with buttons for each individual user. In another exemplary embodiment, user identifier <part-num-ref name="universal remote control with buttons for each individual user. In another exemplary embodiment, user identifier">308</part-num-ref>
+ may also include an authentication mechanism for some degree of protection for profiles, such as an integrated fingerprint scanner.    </p>
+    <p id="p-46" num="46">[0038]   Figure 4 is a flowchart illustrating the operation of space-shifting of media, in accordance with an exemplary embodiment of the present invention. The operation begins when a media server receives user input (step 402). The operation determines if the input is a user logging on (step 404). If a user is not logging on (a no output to step 404), the operation goes directly to step <part-num-ref name="operation goes directly to step">408.</part-num-ref>
+ If a user is logging on (a yes output to step 404), the operation retrieves the user profile associated with the user identification (step <part-num-ref name="user identification (step">406)</part-num-ref>
+ and then the operation goes to step <part-num-ref name="operation goes to step">408.</part-num-ref>
+ The operation then determines if there is currently any media broadcasts stored. for the <boundary-data type="header">
+        <confidence value="88">14</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS92005<confidence value="6686885">0681US1</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+user (step 408). If there is a media broadcast stored for the user (a yes output to step <part-num-ref name="yes output to step">408)</part-num-ref>
+ the operation asks the user if the user wants to resume broadcasting of the stored media broadcast (step 410). In another exemplary embodiment, all media broadcasts currently saved for the user are listed and the user can select what, if any, media broadcasts to resume broadcasting.    </p>
+    <p id="p-47" num="47">[0039]   If the user does wish to resume broadcasting a stored media broadcast (a yes output to step 410), the media server determines if the user wants to resume broadcasting at the current device (step 412). If the user does not want to resume broadcasting at the current device (a no output to step 412), the user selects a device,from a list of devices, provided by the media server, on the network on which to resume broadcasting of the stored media broadcast (step 416). If the user does want to resume broadcasting at the current device (a yes output to step 412), the operation resumes broadcasting the stored media broadcast at the current device from the point where the user left off, and any saved media settings, such as volume, brightness and playback options are applied (step 418), and the operation ends. If the user does not want to resume broadcasting a stored media broadcast (a no output to step 410), the normal operation of the current device is resumed (step <part-num-ref name="current device is resumed (step">414)</part-num-ref>
+ and the operation ends.    </p>
+    <p id="p-48" num="48">[0040]    If there is not a media broadcast stored for the user (a no output to step 408), the operation determines if there is media currently playing for the user (step 420). If there is not current media playing for the user (a no output to step 420), the normal operation of the current device is resumed (step <part-num-ref name="current device is resumed (step">414)</part-num-ref>
+ and the operation ends. If there is media playing for the user (a yes output to step 420), the operation determines <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <boundary-data type="header">Docket No. AUS920050681<confidence value="884">US1</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+if the user wants to space-shift, or transfer, the media broadcast (step 422). If the user does not wish to space- shift the media broadcast (a no output to step 422), the operation determines if the user wants to save the media broadcast(step 424). If the user does not want to save the media broadcast (a no output to step 424), the media broadcast is not saved, the normal operation of the current device is resumed (step <part-num-ref name="current device is resumed (step">414)</part-num-ref>
+ and the operation ends. If the user wants to save the media broadcast (a yes output to step 424), the media broadcast and media settings are saved (step <part-num-ref name="media broadcast and media settings are saved (step">426)</part-num-ref>
+ and the operation ends.    </p>
+    <p id="p-49" num="49">[0041]    If the user does want to transfer the media broadcast (a yes output to step 422), the user selects which device to transfer the media broadcast to from a list of devices on the network provided by the media server (step 428). The media broadcast is transferred to the selected device, including any media settings (step <part-num-ref name="selected device, including any media settings (step">430)</part-num-ref>
+ and the operation ends.    </p>
+    <p id="p-50" num="50">[0042]   The present invention provides convenience in media space-shifting, which becomes especially valuable wh<confidence value="8">e</confidence>
+re there are multiple individuals using the system, such as a family, and where there are multiple devices individuals can choose to space-shift to. The present invention allows an individual to resume hid/her media experience right where he/she had previously left off.    </p>
+    <p id="p-51" num="51">Additionally, if the individual has multiple profiles, the individual may resume any number of different media experiences.</p>
+    <p id="p-52" num="52">[0043]   The invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.</p>
+    <boundary-data type="header">
+      <confidence value="88">16</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS92005<confidence value="6686885">0681US1</confidence>
+    </boundary-data>
+    <p id="p-53" num="53">
+      <page-break num="17"/>
+[0044]    Furthermore, the invention can take the form of a computer program product accessible from a computer- usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any tangible apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.    </p>
+    <p id="p-54" num="54">[0045]    The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium.</p>
+    <p id="p-55" num="55">Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory <confidence value="8858">(RAM</confidence>
+), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk - read only memory (CD-ROM), compact disk - read/write (CD-R/W) and DVD.    </p>
+    <p id="p-56" num="56">
+      <confidence value="5">[</confidence>
+0046]   A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.    </p>
+    <p id="p-57" num="57">[0047]    Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.</p>
+    <boundary-data type="header">
+      <confidence value="88">17</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. AUS920050681US1</boundary-data>
+    <p id="p-58" num="58">
+      <page-break num="18"/>
+[0048]   Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.    </p>
+    <p id="p-59" num="59">[0049]   The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.</p>
+    <boundary-data type="header">
+      <confidence value="88">18</confidence>
+    </boundary-data>
+    <boundary-data type="header">Docket No. A<confidence value="5">U</confidence>
+S92005<confidence value="6686884">0681US1</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11316280.xml

@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11316280</doc-number>
+        <date>2007-12-07</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">App<confidence value="7">l</confidence>
+e. No. 11/316,280                                 Docket No.: 1070.P4203 Response D<confidence value="5">a</confidence>
+ted December 4, 2007                      Examiner: Le, Quang V.    </p>
+    <p id="p-2" num="2">Reply to Office Action of September 4, 2007                   TC/A.U. <part-num-ref name="TC/A.U.">2109</part-num-ref>
+ Amendments to the Specification:    </p>
+    <p id="p-3" num="3">Please replace paragraphs [0025<confidence value="5">]</confidence>
+ and [0034] with the following amended paragraphs:    </p>
+    <p id="p-4" num="4">
+      <confidence value="5">[</confidence>
+0025]   In various embodiments, multiplexer 304 may be connected to power amplifiers 306-1, 306-2. Power amplifiers 306-1, 306-2 may be used to amplify any signals to be transmitted over wireless shared media 122-1. Power amplifiers 306-1, 306- <part-num-ref name="may be connected to power amplifiers 306-1, 306-2. Power amplifiers 306-1, 306-2 may be used to amplify any signals to be transmitted over wireless shared media 122-1. Power amplifiers 306-1, 306-">2</part-num-ref>
+ may work in all assigned frequency bands, such as <part-num-ref name="may work in all assigned frequency bands, such as">4</part-num-ref>
+ frequency bands in a quad-band system. Power amplifiers 306-1, 306-2 may also operate in various modulation modes, such as Gaussian Minimum Shift Keying (GS<confidence value="555">MK)</confidence>
+ <confidence value="68">(G</confidence>
+MSK) modulation suitable for GSM systems and 8-ary Phase Shift Keying (8-PSK) modulation suitable for EDGE systems. The embodiments are not limited in this context.    </p>
+    <p id="p-5" num="5">
+      <confidence value="5">[</confidence>
+0034]   In various embodiments, processing sub-system 206 of mobile computing device <part-num-ref name="of mobile computing device">110</part-num-ref>
+ may be capable of executing various types of system programs, such as different OS. In computing, an OS is the system software responsible for the direct control and management of hardware and basic system operations. Additionally, it provides a foundation upon which to run application software such as word processing programs and web browsers. Mobile computing device <part-num-ref name="foundation upon which to run application software such as word processing programs and web browsers. Mobile computing device">110</part-num-ref>
+ may utilize any OS suitable for smaller form factor devices, such as a Palm OS<confidence value="4">®</confidence>
+, Palm OS<confidence value="5">®</confidence>
+ Cobalt, Microsoft Windows<confidence value="5">@</confidence>
+ CE, Microsoft Pocket PC, Symbian <confidence value="66">OS</confidence>
+TM, Embedix OS<confidence value="45">®,</confidence>
+ and others. The embodiments are not limited in this context.    </p>
+    <p id="p-6" num="6">
+      <confidence value="8">2</confidence>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11322443.xml

@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11322443</doc-number>
+        <date>2007-06-29</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">JUN 29 <part-num-ref name="">2007</part-num-ref>
+ 14<confidence value="5">:</confidence>
+07 FR K<confidence value="5">C</confidence>
+ LEG<confidence value="5">A</confidence>
+L            <part-num-ref name="14:07 FR KC LEGAL">920</part-num-ref>
+ <part-num-ref name="">721</part-num-ref>
+ <part-num-ref name="">0225</part-num-ref>
+ TO <part-num-ref name="TO">91571273<confidence value="5">8</confidence>
+300      </part-num-ref>
+    P.03/14 App<confidence value="7">l</confidence>
+e. No. <confidence value="5">1</confidence>
+1/322,443                                                      RECEIVED Amdt<confidence value="5">,</confidence>
+ dated June <part-num-ref name="P.03/14 Apple. No. 11/322,443                                                      RECEIVED Amdt, dated June">29,</part-num-ref>
+ <part-num-ref name="P.03/14 Apple. No. 11/322,443                                                      RECEIVED Amdt, dated June 29,">2007</part-num-ref>
+                                             CENTRAL FAX CENTER Reply to Office Action of May <part-num-ref name="CENTRAL FAX CENTER Reply to Office Action of May">23,</part-num-ref>
+ <part-num-ref name="CENTRAL FAX CENTER Reply to Office Action of May 23,">2007</part-num-ref>
+ JUN <part-num-ref name="JUN">
+        <confidence value="8">2</confidence>
+      </part-num-ref>
+ <part-num-ref name="">9</part-num-ref>
+ <part-num-ref name="">200<confidence value="5">7</confidence>
+      </part-num-ref>
+ Amendments to the Specification:    </p>
+    <p id="p-2" num="2">At the Examiner's request, please change the title of this patent application from Tampon Applicator to <confidence value="5">"</confidence>
+TAMPON APPLICATOR WITH RIDGES AND MULTIPLE PETALS." PAGE 3114<confidence value="5">'</confidence>
+ RCVD AT <part-num-ref name="title of this patent application from Tampon Applicator to &quot;TAMPON APPLICATOR WITH RIDGES AND MULTIPLE PETALS.&quot; PAGE 3114' RCVD AT">6<confidence value="5">1</confidence>
+2912007      </part-num-ref>
+ 2<confidence value="5">:</confidence>
+39:46 PM [Easte<confidence value="66">rn</confidence>
+ Daylight Time]<confidence value="4">'</confidence>
+ SVR:USPT<confidence value="42">O-</confidence>
+EFXRF<confidence value="2855">.311</confidence>
+  DNIS:2738300<confidence value="4">'</confidence>
+ CSI<confidence value="5">D</confidence>
+:920 <part-num-ref name="2:39:46 PM [Eastern Daylight Time]' SVR:USPTO-EFXRF.311  DNIS:2738300' CSID:920">721<confidence value="5">0</confidence>
+225      </part-num-ref>
+ DURAT<confidence value="66">IO</confidence>
+N (m<confidence value="55">m.</confidence>
+ss):03<confidence value="88">48</confidence>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11323665.xml

@@ -0,0 +1,781 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11323665</doc-number>
+        <date>2005-12-30</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Attorney's Docket No.: 15609-087001 <confidence value="5">/</confidence>
+ 2005P00932 US    </boundary-data>
+    <heading id="h-1">APPLICATION</heading>
+    <heading id="h-2">FOR</heading>
+    <heading id="h-3">UNITED STATES LETTERS PATENT</heading>
+    <heading id="h-4">TITLE:        TEMPLATE FOR GENERATING PHYSICAL-OPERATION</heading>
+    <heading id="h-5">OBJECTS</heading>
+    <heading id="h-6">APPLICANT:    STEFANIE RUNDE, SERGIO ROZENSZAJN, AMIT</heading>
+    <heading id="h-7">YANIV, ROBERT MEYER, HENNING SCHMITZ, MARTIN</heading>
+    <heading id="h-8">SCHMIDT, IRENA KULL AND THOMAS FRIEDRICH</heading>
+    <heading id="h-9">CERTIFICATE OF MAILING BY EXPRESS MAIL</heading>
+    <p id="p-1" num="1">Express Mail <confidence value="5">L</confidence>
+abel No.  EV7<confidence value="5">1</confidence>
+020385<confidence value="488">0US</confidence>
+ December 30<confidence value="5">,</confidence>
+ 2005 Date of Deposit <page-break num="2"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+Template for Generating Physical-Operation Objects Technical Field The description relates to use of at least one template for generating objects to be used in physical operations.    </p>
+    <p id="p-2" num="2">
+      <boundary-data type="line-number">5                            </boundary-data>
+Background There exists systems for computerized automation of operations and processes in industrial or other commercial enterprises. Examples of such existing systems are those available from SAP AG in Walldor<confidence value="4">f</confidence>
+ (Baden) Germany.    </p>
+    <p id="p-3" num="3">Some of the existing systems are intended for use with the logistic procedures <boundary-data type="line-number">10  </boundary-data>
+and operations that are common in manufacturing processes and they are therefore typically used in production plants. Other systems, or components of systems, are intended for use in the logistic management of products that have already been manufactured. They are therefore typically used in warehouses, distribution centers and other facilities where goods may be inspected, repacked <boundary-data type="line-number">15  </boundary-data>
+and moved to particular storage locations while awaiting shipment.    </p>
+    <p id="p-4" num="4">The distribution of responsibilities and functionality between these two categories of systems is based on the way that these industries have emerged and developed historically. That is, over decades in the past, production plants and similar facilities have carried out their operations according to well- <boundary-data type="line-number">20  </boundary-data>
+established routines that involve the basic steps of making the product.    </p>
+    <p id="p-5" num="5">Improvements in technology have changed the way certain tasks are performed, but the general logistic view of how the core constituents of the manufacturing process is carried out has not changed as significantly. Similarly, warehouses <boundary-data type="header">
+        <confidence value="5">1</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+have traditionally been viewed as facilities mainly for logistic management of goods without significant modification and, thus, essentially non-manufacturing in nature.    </p>
+    <p id="p-6" num="6">This view is reflected in the existing systems for controlling manufacturing <boundary-data type="line-number">5   </boundary-data>
+processes. Such systems may perform similar function within their respective domains, but they rarely share information. The computer model they use for the different components of the process are typically specialized and heavily flavored by the traditional manufacturing view. Systems for warehouse management, in contrast, have other computer models that are targeted toward managing the <boundary-data type="line-number">10  </boundary-data>
+logistics of storing and eventually delivering goods. A disadvantage of existing systems, then, is that they are designed and configured for only their type of process and lack flexibility in adapting to new demands in the industry and the marketplace that challenge the traditional views.    </p>
+    <p id="p-7" num="7">This shortcoming is accentuated because the respective worlds of <boundary-data type="line-number">15  </boundary-data>
+manufacturing and warehouse management are beginning to merge so that there may no longer exist a distinct point where one of them ends and the other begins. Also, companies increasingly need to gather more real-time information about their operations for purposes of planning and execution, information that should be used across applications in real time to optimize manufacturing and <boundary-data type="line-number">20  </boundary-data>
+distribution processes.    </p>
+    <p id="p-8" num="8">Summary The invention relates to generating objects for physical operations using a template.</p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-9" num="9">
+      <page-break num="4"/>
+In a first general aspect, a method to be performed in a computer system in association with initiating a physical operation includes receiving a request in a computer system for a physical operation. The method includes generating a first object to be used in the physical operation, the first object being generated <boundary-data type="line-number">5  </boundary-data>
+based on the physical operation using a template. The template is configured for generating objects for any of at least <part-num-ref name="template is configured for generating objects for any of at least">(1)</part-num-ref>
+ a physical operation performed in product manufacturing and <part-num-ref name="physical operation performed in product manufacturing and">(2)</part-num-ref>
+ a physical operation performed in post- manufacturing product management.    </p>
+    <p id="p-10" num="10">Implementations may include any or all of the following features. The <boundary-data type="line-number">10  </boundary-data>
+generated first object may be an order object that describes the physical operation and that is to be updated after performance of the physical operation to indicate fulfillment. The template may specify a branching node for the order object, the branching node indicating that the physical operation is to be performed in connection with a branch in a process path. When the physical <boundary-data type="line-number">15  </boundary-data>
+operation is to be performed in the product manufacturing, the template may specify an internal material flow node for the order object, the internal material flow node describing a flow of material in relation to the physical operation.    </p>
+    <p id="p-11" num="11">When the generated first object is an information collection object configured to represent performance of the physical operation, the method may further include <boundary-data type="line-number">20  </boundary-data>
+initiating the performance of the physical operation using the information collection object. The method may further include recording, in the information collection object, data generated in the performance of the physical operation.    </p>
+    <p id="p-12" num="12">The method may further include generating at least one task object using the <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+information collection object, the task object corresponding to a predefined task that is a portion of the physical operation. When the physical operation is for product manufacturing, the first object may include a material input node indicating a first material that enters the physical operation, and a material output <boundary-data type="line-number">5  </boundary-data>
+node indicating a second material that results from the physical operation. When the physical operation is for post-manufacturing product management, the first object may include a material input node and a material output node. The material input node may indicate (A) a source location for a moving operation, (B) a logistics package for a packing operation, or (C) a quantity or stock category for <boundary-data type="line-number">10  </boundary-data>
+a checking operation, and the material output node may indicate (D) a resulting destination location for a moving operation, (E) a logistics package for a packing operation, or (F) a quantity or stock category for a checking operation. The first object may include at least one operation node corresponding to the physical operation. The operation node may correspond to any of (a) a making type <boundary-data type="line-number">15  </boundary-data>
+operation, (b) a moving type operation, (c) a packing type operation and (d) a checking type operation. The first object may include at least one activity node associated with the operation node, the activity node representing an activity to be performed in the physical operation. The activity node may represent any of (a) a pre-operation activity, (b) a production activity changing a material, (c) a <boundary-data type="line-number">20  </boundary-data>
+post-operation activity, (d) an activity of packing at least one material, (e) an activity of unpacking at least one material, (f) an activity of moving at least one material and (g) an activity of checking at least one material. The first object may include at least one step node associated with the activity node, the step node <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+representing a step to be performed in the physical operation. The first object may be a confirmation object configured to be used in confirming performance of the physical operation. The method may further include generating, using another template, an information collection object that is configured to represent <boundary-data type="line-number">5  </boundary-data>
+the performance of the physical operation. The method may further include recording, in the information collection object, data generated in the performance of the physical operation. When several objects including the first object are to be used in performing the physical operation, the method may further include generating the several objects using separate templates, each of the separate <boundary-data type="line-number">10  </boundary-data>
+templates being configured for generating product-manufacturing type objects and post-manufacturing product management type objects.    </p>
+    <p id="p-13" num="13">Advantages of implementations may include any or all of the following.</p>
+    <p id="p-14" num="14">Providing a flexible and efficient use of common templates in manufacturing management and warehouse management. Providing operation control that is <boundary-data type="line-number">15  </boundary-data>
+based on sharing of information. Providing operation control that is based on sharing of master data such as bill of operation, bill of material, packing bill of material, process model, release management of master data, location and bin management, and resource management. Providing operation control that is based on sharing inventory management, execution behavior patter and general <boundary-data type="line-number">20  </boundary-data>
+services.    </p>
+    <p id="p-15" num="15">The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+and advantages of the invention will be apparent from the description and drawings, and from the claims.    </p>
+    <p id="p-16" num="16">Brief Description of the Drawings FIG. <confidence value="5">1</confidence>
+ is a block diagram showing an environment where templates are <boundary-data type="line-number">5  </boundary-data>
+used to generate multiple business objects used to initiate physical operations;    </p>
+    <p id="p-17" num="17">FIG. 2 is a block diagram showing the interaction between the site logistics processing component and other components;</p>
+    <p id="p-18" num="18">FIG. 3 is a block diagram showing the structure of the order and lot business objects;</p>
+    <p id="p-19" num="19">
+      <boundary-data type="line-number">10       </boundary-data>
+FIG. 4 is a block diagram showing operations and activities that comprise production order and production lot business objects, along with the process of generating confirmation documents;    </p>
+    <p id="p-20" num="20">FIG. 5 is a block diagram showing operations and activities that comprise site logistics order and site logistics lot business objects, along with the process <boundary-data type="line-number">15  </boundary-data>
+of generating confirmation documents;    </p>
+    <p id="p-21" num="21">FIG. 6 is a block diagram showing the structure of the logistics confirmation template;</p>
+    <p id="p-22" num="22">FIG. 7 is a block diagram showing details of process flow branching;</p>
+    <p id="p-23" num="23">FIG. 8 is a flow chart showing a generic process from request to <boundary-data type="line-number">20  </boundary-data>
+performance of a physical operation;    </p>
+    <p id="p-24" num="24">FIG. 9 is a block diagram of a general computer system.</p>
+    <p id="p-25" num="25">Like reference numerals in the various drawings indicate like elements.</p>
+    <boundary-data type="header">
+      <confidence value="8">6</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-26" num="26">
+      <page-break num="8"/>
+Detailed Description FIG <confidence value="5">1</confidence>
+ shows an environment <part-num-ref name="environment">100.</part-num-ref>
+ The environment <part-num-ref name="environment">100</part-num-ref>
+ may contain computer resources to plan, execute and document physical operations that take place in the environment <part-num-ref name="environment">100.</part-num-ref>
+ The environment <part-num-ref name="environment">100</part-num-ref>
+ contains a production <boundary-data type="line-number">5  </boundary-data>
+environment <part-num-ref name="production environment">102</part-num-ref>
+ in which products can be manufactured, for example by assembling components or by transforming a material. There can also be moving or packing operations in the production environment <part-num-ref name="production environment">102.</part-num-ref>
+ A production order <part-num-ref name="production order">104</part-num-ref>
+ and a production lot <part-num-ref name="production lot">106</part-num-ref>
+ are each an object that may be used in a process performed in the production environment <part-num-ref name="production environment">102.</part-num-ref>
+ The production order <part-num-ref name="production order">104</part-num-ref>
+ <boundary-data type="line-number">10  </boundary-data>
+describes the production process of the requested material(s) on the execution level. Production flow is modeled using operations and activities that are executed in sequence, in parallel, or as an aggregate of both. In particular, the production order defines which components and resources are required to produce a material. The production lot <part-num-ref name="production lot">106</part-num-ref>
+ is used in executing the physical <boundary-data type="line-number">15  </boundary-data>
+operation(s) specified by the production order <part-num-ref name="production order">104.</part-num-ref>
+ The production lot <part-num-ref name="production lot">106</part-num-ref>
+ can be initiated upon the release of the production order <part-num-ref name="production order">104.</part-num-ref>
+ By using a production lot, actual quantities are aggregated, confirmation documents are created and plan reductions are calculated. The production lot <part-num-ref name="production lot">106</part-num-ref>
+ may be considered an information collection object. For example, the information collected using the <boundary-data type="line-number">20  </boundary-data>
+production lot <part-num-ref name="production lot">106</part-num-ref>
+ can be used in updating inventory records and in changing a fulfillment status of the production order <part-num-ref name="production order">104.</part-num-ref>
+    </p>
+    <p id="p-27" num="27">The production order 104 and production lot <part-num-ref name="and production lot">106</part-num-ref>
+ may consist of data structures used to describe and document certain physical processes. A process <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+can include one or more operations (i.e. make, move, pack, check). Each operation, in turn, can include one or more activities to be carried out. Finally, an activity can consist of one or more steps that are performed in the physical environment.    </p>
+    <p id="p-28" num="28">
+      <boundary-data type="line-number">5       </boundary-data>
+The processes themselves, along with the data structures used to describe and document them may apply to a variety of other environments. To take advantage of the commonality that may exist among these environments, the environment <part-num-ref name="environment">100</part-num-ref>
+ may incorporate an order template <part-num-ref name="order template">108</part-num-ref>
+ and a lot template <part-num-ref name="lot template">110.</part-num-ref>
+ The order template <part-num-ref name="order template">108</part-num-ref>
+ and a lot template <part-num-ref name="lot template">110</part-num-ref>
+ contain the common data <boundary-data type="line-number">10  </boundary-data>
+structures used in executing and documenting processes, along with their component operations and activities, that may be used in several environments.    </p>
+    <p id="p-29" num="29">A template may be viewed as an abstract entity from which realizable objects can be generated to suit a particular environment. The production order <part-num-ref name="production order">104</part-num-ref>
+ and production lot <part-num-ref name="and production lot">106,</part-num-ref>
+ along with order and lot objects targeted to other <boundary-data type="line-number">15  </boundary-data>
+environments, may all be generated from the common order template <part-num-ref name="common order template">108</part-num-ref>
+ and the common lot template <part-num-ref name="common lot template">110.</part-num-ref>
+    </p>
+    <p id="p-30" num="30">The environment 100 also contains a warehouse environment <part-num-ref name="warehouse environment">112</part-num-ref>
+ that can be used for logistics management of products, for example by moving, storing or packing them according to predefined routines. The warehouse <boundary-data type="line-number">20  </boundary-data>
+environment uses a site logistics order <part-num-ref name="site logistics order">114</part-num-ref>
+ and a site logistics lot <part-num-ref name="site logistics lot">116.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">Warehouse type operations are generally referred to as site logistics in these examples, and may directly involve a warehouse facility or distribution center for goods, to name two examples. The site logistics order <part-num-ref name="site logistics order">114</part-num-ref>
+ is an object that is <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+used to describe the plan of the site logistics process down to the execution level. The logistics flow is modeled using operations and activities that are executed in sequence, in parallel or as an aggregate of both. This may include operations of moving, maintaining and packing products, and make-type <boundary-data type="line-number">5  </boundary-data>
+operations, for example if the warehouse environment <part-num-ref name="warehouse environment">112</part-num-ref>
+ is used for light assembly procedures. The site logistics order may also define which resources are required to perform the activities.    </p>
+    <p id="p-32" num="32">The site logistics lot 116 is used to execute site logistics process. It collects all actual data for a site logistics process and documents its progress.</p>
+    <p id="p-33" num="33">
+      <boundary-data type="line-number">10  </boundary-data>
+The site logistics lot 116 aggregates actual quantities and confirms that documents are created and plan reductions are calculated. The site logistics lot <part-num-ref name="site logistics lot">116</part-num-ref>
+ may be considered an information collection object. The site logistics lot <part-num-ref name="site logistics lot">116</part-num-ref>
+ forms the basis for a process-oriented genealogy. The order template <part-num-ref name="order template">108</part-num-ref>
+ and the lot template <part-num-ref name="lot template">110</part-num-ref>
+ may also be used for to generate the site logistics order <part-num-ref name="site logistics order">114</part-num-ref>
+ <boundary-data type="line-number">15  </boundary-data>
+and the site logistics lot <part-num-ref name="site logistics lot">116</part-num-ref>
+ for the warehouse environment <part-num-ref name="warehouse environment">112.</part-num-ref>
+ This is to take advantage of the data structure format in the templates used to describe and document common processes.    </p>
+    <p id="p-34" num="34">The order template 108 and lot template <part-num-ref name="and lot template">110</part-num-ref>
+ may be used to generate order objects and lot objects in a variety of environments. FIG 1 shows an <boundary-data type="line-number">20  </boundary-data>
+additional facility <part-num-ref name="additional facility">118</part-num-ref>
+ for which order and lot objects may be generated. This facility may perform processes which also involve making, moving, packing, maintaining or checking products and which therefore have commonality with the processes that make up the production and warehouse environments.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-35" num="35">
+      <page-break num="11"/>
+Generating order and lot objects for this environment from the order template <part-num-ref name="order template">108</part-num-ref>
+ and the lot template <part-num-ref name="lot template">110</part-num-ref>
+ illustrates the extensibility of the template design. Other object templates may also be generated for the production environment <part-num-ref name="production environment">102</part-num-ref>
+ and the warehouse environment <part-num-ref name="warehouse environment">112</part-num-ref>
+ similarly to how the order template <part-num-ref name="order template">108</part-num-ref>
+ and the <boundary-data type="line-number">5  </boundary-data>
+lot template <part-num-ref name="lot template">110</part-num-ref>
+ are generated.    </p>
+    <p id="p-36" num="36">FIG 2 shows a site logistics interaction model <part-num-ref name="site logistics interaction model">200.</part-num-ref>
+ The model illustrates how site logistics processing can interact with a variety of processing components. Included in the module is a logistics execution module <part-num-ref name="logistics execution module">202.</part-num-ref>
+ The logistics execution module <part-num-ref name="logistics execution module">202</part-num-ref>
+ is used in planning and executing physical <boundary-data type="line-number">10  </boundary-data>
+operations in a post-manufacturing scenario, such as in a warehouse.    </p>
+    <p id="p-37" num="37">The logistics execution module 202 contains a site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ that includes the information relating to the performance of physical operations. The logistics execution module <part-num-ref name="logistics execution module">202</part-num-ref>
+ also can be used in executing operations in other facilities, such as in a production plant. The <boundary-data type="line-number">15  </boundary-data>
+logistics execution module may then be provided with a production processing component having a structure similar to that of the logistics execution module <part-num-ref name="logistics execution module">202.</part-num-ref>
+ Particularly, such processing components or any of their constituent objects can be generated using templates along the lines of the above description.    </p>
+    <p id="p-38" num="38">Here, the site logistics processing component includes five business <boundary-data type="line-number">20  </boundary-data>
+objects: a site logistics request <part-num-ref name="site logistics request">206,</part-num-ref>
+ the site logistics order <part-num-ref name="site logistics order">114,</part-num-ref>
+ the site logistics <confidence value="5">l</confidence>
+ot <part-num-ref name="site logistics lot">116,</part-num-ref>
+ a site logistics task <part-num-ref name="site logistics task">208</part-num-ref>
+ and a site logistics confirmation <part-num-ref name="site logistics confirmation">210.</part-num-ref>
+ The site logistics request <part-num-ref name="site logistics request">206</part-num-ref>
+ is a request to perform logistics operations at a certain time that support outbound, inbound and site logistics processes. The site logistics <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+request represents the internal view of execution. It communicates with the requestor, and provides site logistics functionalities, such as site logistics order initiation and site logistics lot creation.    </p>
+    <p id="p-39" num="39">The site logistics task 208 is an object that reflects the organization of <boundary-data type="line-number">5  </boundary-data>
+work to be performed at a site. The site logistics task divides the site logistics process into self-contained work items. The tasks are to be executed by one or more persons, or by an automation system, involved in the site logistics process.    </p>
+    <p id="p-40" num="40">The workers receive all the instructions they need to execute a task via the user interface, and are requested to input actual data. The site logistics confirmation <boundary-data type="line-number">10  </boundary-data>
+      <part-num-ref name="site logistics confirmation">210</part-num-ref>
+ is a document that is used to confirm any changes to physical stock quantities (for example, as a result of goods movements). It includes information about inventory changes, deviations from plan, execution timestamps, and the users and resources involved. The site logistics confirmation updates inventory, finance, and planning.    </p>
+    <p id="p-41" num="41">
+      <boundary-data type="line-number">15       </boundary-data>
+In implementations where a production processing component is used, it may contain objects that correspond in function to the site logistics request, the site logistics order, the site logistics lot, the site logistics task and the site logistics confirmation.    </p>
+    <p id="p-42" num="42">The site logistics processing component 204 interacts with several other <boundary-data type="line-number">20  </boundary-data>
+process components as part of site logistics execution. The first of these process components is a supply chain control module <part-num-ref name="supply chain control module">234</part-num-ref>
+ which constitutes a request for receiving goods from a vendor or for delivering goods to a customer based on a purchase order or a sales order. The execution of the process is managed by <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+the site logistics processing component <part-num-ref name="site logistics processing component">204.</part-num-ref>
+ During the execution the site logistics processing component interacts with an inbound delivery processing component <part-num-ref name="inbound delivery processing component">212</part-num-ref>
+ or an outbound delivery processing component <part-num-ref name="outbound delivery processing component">216,</part-num-ref>
+ creating an inbound delivery document or an outbound delivery document with the actual <boundary-data type="line-number">5  </boundary-data>
+relevant logistics data of execution. The inbound delivery processing component enables communication with the vendor and invoicing. The outbound delivery processing component <part-num-ref name="outbound delivery processing component">216</part-num-ref>
+ enables communication with the product recipient and billing.    </p>
+    <p id="p-43" num="43">Another processing component that the site logistics processing <boundary-data type="line-number">10  </boundary-data>
+component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ interacts with is a material inspection processing component <part-num-ref name="material inspection processing component">222.</part-num-ref>
+ The material inspection processing component <part-num-ref name="material inspection processing component">222</part-num-ref>
+ is responsible for planning and executing quality inspection documents. The interaction model can be divided into two main parts: the planning phase and the execution phase. In the planning phase, the material inspection processing component <part-num-ref name="material inspection processing component">222</part-num-ref>
+ <boundary-data type="line-number">15  </boundary-data>
+determines the necessity for quality inspection for each of the provided products.    </p>
+    <p id="p-44" num="44">At that point, all material inspection documents within the material inspection processing component <part-num-ref name="material inspection processing component">222</part-num-ref>
+ are created. In the execution phase, the site logistics lot <part-num-ref name="site logistics lot">116</part-num-ref>
+ is created with the corresponding site logistics task <part-num-ref name="corresponding site logistics task">208.</part-num-ref>
+ The user who performs the quality inspection test will be able to navigate from the relevant task <boundary-data type="line-number">20  </boundary-data>
+user interface (UI) to the UI for the material inspection processing. The actual reporting of quality inspection results will be done within the material inspection processing component <part-num-ref name="material inspection processing component">222.</part-num-ref>
+ After finalizing the quality inspection reporting, the process control returns to the site logistics processing component <part-num-ref name="site logistics processing component">204.</part-num-ref>
+ Stock <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+quality decisions that are made within the material inspection processing component <part-num-ref name="material inspection processing component">222</part-num-ref>
+ will serve as a basis for stock category updates (if required).    </p>
+    <p id="p-45" num="45">Stock category updates will be carried out by the site logistics processing component <part-num-ref name="site logistics processing component">204.</part-num-ref>
+ The material inspection processing component <part-num-ref name="material inspection processing component">222</part-num-ref>
+ contains <boundary-data type="line-number">5  </boundary-data>
+respective objects for material inspection, material inspection sample and for material inspection quality level.    </p>
+    <p id="p-46" num="46">Another processing component that the site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ interacts with is a foundation layer <part-num-ref name="foundation layer">236.</part-num-ref>
+ The foundation layer includes, among other components, the following business objects: storage <boundary-data type="line-number">10  </boundary-data>
+behavior method, source and destination determination (SDD) rule and storage control. These business objects are responsible for planning internal operations (e.g. replenishment). They determine whether replenishment is needed, what is the quantity, from which bin to take the stock etc. SDD is a process that searches for the best location for stock retrieval or for stock placement (for <boundary-data type="line-number">15  </boundary-data>
+example which logistics area). The initial part of the process determines the most appropriate SDD rule according to which a suitable location is found. The rule defines a sequence of locations to search by. After finding the location, the rule identifies the storage behavior method of the location (i.e., a rule node in the storage behavior method business object), which specifies the strategy for <boundary-data type="line-number">20  </boundary-data>
+retrieval or placement of stock and the constraints that need to be satisfied.    </p>
+    <p id="p-47" num="47">Availability of inventory is checked and the answer is provided to the client.</p>
+    <p id="p-48" num="48">Turning now to the storage control business object, it can create the site logistics request <part-num-ref name="site logistics request">206</part-num-ref>
+ to execute an internal process.    </p>
+    <boundary-data type="header">
+      <confidence value="88">13</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-49" num="49">
+      <page-break num="15"/>
+The site logistics processing component 204 also interacts with a confirmation and inventory processing component <part-num-ref name="confirmation and inventory processing component">228.</part-num-ref>
+ Particularly, the site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ deals with the execution of processes within the site (e.g., moving, packing, counting etc.), and these stock changes must be <boundary-data type="line-number">5  </boundary-data>
+updated in the inventory. The site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ interacts with an inventory object <part-num-ref name="inventory object">230</part-num-ref>
+ in the confirmation and inventory processing component <part-num-ref name="confirmation and inventory processing component">228.</part-num-ref>
+    </p>
+    <p id="p-50" num="50">The site logistics processing component 204 interacts with a financial accounting module <part-num-ref name="financial accounting module">232,</part-num-ref>
+ for example to perform accounting processing. The <boundary-data type="line-number">10  </boundary-data>
+logistics execution module <part-num-ref name="logistics execution module">202</part-num-ref>
+ interacts with the supply chain control module <part-num-ref name="supply chain control module">234</part-num-ref>
+ to match supply and demand, to respond to inbound and outbound deliveries, and in managing the fulfillment and inventory changes in site logistics processing. These interactions may take place using an integration technology such as the Exchange Infrastructure (X<confidence value="5">I</confidence>
+) available in products from SAP AG in <boundary-data type="line-number">15  </boundary-data>
+Walldorf (Baden) Germany. The site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ interacts with the foundation layer <part-num-ref name="foundation layer">236</part-num-ref>
+ that may provide a released site logistics process model, definitions for logistics and supply planning areas, materials and batches, service products and handling units, resources and logistics units. The foundation layer <part-num-ref name="foundation layer">236</part-num-ref>
+ may also provide a Site Logistics Process Segment, a Site <boundary-data type="line-number">20  </boundary-data>
+Logistics Process Model, a Storage Behavior Method, a Location, a Permanent Establishment, a LogisticsUnit<confidence value="5">U</confidence>
+sage, a Distribution Center, and a Logistics Task Folder.    </p>
+    <boundary-data type="header">
+      <confidence value="88">14</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-51" num="51">
+      <page-break num="16"/>
+The above is an example of how the site logistics processing component <part-num-ref name="site logistics processing component">204</part-num-ref>
+ functions within the logistics execution module <part-num-ref name="logistics execution module">202</part-num-ref>
+ and the various interactions it can have. A production processing component can be included in the logistics execution module <part-num-ref name="logistics execution module">202</part-num-ref>
+ and can have similar functions and <boundary-data type="line-number">5  </boundary-data>
+interactions. Particularly, the templates used in generating objects for such and other processing components configure the objects such that the above described interactions can take place.    </p>
+    <p id="p-52" num="52">FIG. 3A shows a model of an order object <part-num-ref name="order object">300</part-num-ref>
+ that can be generated from the order template <part-num-ref name="order template">108.</part-num-ref>
+ FIG. 3B shows a model of a lot object <part-num-ref name="lot object">350</part-num-ref>
+ that can be <boundary-data type="line-number">10  </boundary-data>
+generated from the lot template <part-num-ref name="lot template">110.</part-num-ref>
+ The order object <part-num-ref name="order object">300</part-num-ref>
+ includes a header node <part-num-ref name="header node">302.</part-num-ref>
+ Associated with the header node is an operation node <part-num-ref name="operation node">304</part-num-ref>
+ representing one or more operations that are planned for a resource to perform according to the order. The operations may be of different types, as indicated by operation types <part-num-ref name="operations may be of different types, as indicated by operation types">306</part-num-ref>
+ associated with the operation node <part-num-ref name="operation node">304.</part-num-ref>
+ For example, the <boundary-data type="line-number">15  </boundary-data>
+operation types <part-num-ref name="operation types">306</part-num-ref>
+ include making, moving, packing or checking a product.    </p>
+    <p id="p-53" num="53">Each operation node 304 is associated with at least one activity node <part-num-ref name="is associated with at least one activity node">308</part-num-ref>
+ that represents an activity that is to be performed within the operation. The activity node <part-num-ref name="activity node">308</part-num-ref>
+ contains scheduling information for the execution. The activity node <part-num-ref name="activity node">308</part-num-ref>
+ may be associated with at least one material input node <part-num-ref name="may be associated with at least one material input node">310</part-num-ref>
+ and at <boundary-data type="line-number">20  </boundary-data>
+least one material output node <part-num-ref name="and at least one material output node">312</part-num-ref>
+ representing the material(s) before and after performing the activity, respectively. There can be several material inputs and several material outputs, each of which represents one material that enters, or results from, the activity. For site logistics management the material input node <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+indicates the source location (for moving operation), logistics package (for packing operation), or quantity or stock category (for checking operation).    </p>
+    <p id="p-54" num="54">Similarly, the material output node indicates the resulting destination location (for moving operation), logistics package (for packing operation), or quantity or stock <boundary-data type="line-number">5  </boundary-data>
+category (for checking operation).    </p>
+    <p id="p-55" num="55">The activity node 308 may include a resource requirement node <part-num-ref name="resource requirement node">314</part-num-ref>
+ that represents the resource(s) needed for carrying out the activity and may include a service product input node <part-num-ref name="service product input node">315</part-num-ref>
+ that represents the service product(s) provisioned by the resource(s) needed for carrying out the activity. The activity node <part-num-ref name="activity node">308</part-num-ref>
+ <boundary-data type="line-number">10  </boundary-data>
+may be associated with one or more step nodes <part-num-ref name="may be associated with one or more step nodes">316</part-num-ref>
+ that represent a lower level of action undertaken in performing the activity. Activities can be of several different kinds. The activities in the order <part-num-ref name="order">300</part-num-ref>
+ can be any or all of activity types <part-num-ref name="can be any or all of activity types">318</part-num-ref>
+ that include setup activities, producing activities and moving activities, to name a few.    </p>
+    <p id="p-56" num="56">
+      <boundary-data type="line-number">15       </boundary-data>
+Each of the operation nodes <part-num-ref name="operation nodes">304</part-num-ref>
+ can have an association with a predecessor operation in the process, or a successor operation, or both. This is provided through an internal material flow node <part-num-ref name="internal material flow node">320.</part-num-ref>
+ That is, an operation in the order is associated with any operation that immediately precedes it, and with any operation that immediately succeeds it.    </p>
+    <p id="p-57" num="57">
+      <boundary-data type="line-number">20       </boundary-data>
+The order header 302 has a branching node <part-num-ref name="branching node">322</part-num-ref>
+ associated with it. This provides that the operations to be executed using the order <part-num-ref name="order">300</part-num-ref>
+ can branch into more than one path. The branching node <part-num-ref name="branching node">322</part-num-ref>
+ is immediately followed by a path node <part-num-ref name="path node">324</part-num-ref>
+ representing a sequence of operations that form a logistics process <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+path within a branch. Such paths can be exclusive, meaning that they are alternative processing paths, only one of which may be processed at a time. The paths may be non-exclusive, meaning that several of them may be processed at a time. The branching node <part-num-ref name="branching node">322</part-num-ref>
+ is also associated with a join node <part-num-ref name="join node">326</part-num-ref>
+ <boundary-data type="line-number">5  </boundary-data>
+representing a point at which the branched logistics process paths again unite. A branch path immediately precedes the join. Here, the internal material flow node can link to any two of the operation, branching or join nodes.    </p>
+    <p id="p-58" num="58">The internal material flow 320 has associated with it at least one of an unfinished material node <part-num-ref name="unfinished material node">328,</part-num-ref>
+ a material node <part-num-ref name="material node">330</part-num-ref>
+ and a logistic package (LP) <boundary-data type="line-number">10  </boundary-data>
+node <part-num-ref name="logistic package (LP) node">332.</part-num-ref>
+ The unfinished material node <part-num-ref name="unfinished material node">328</part-num-ref>
+ represents an intermediate state of a product or item for which additional processing is planned. The material node <part-num-ref name="material node">330</part-num-ref>
+ represents the material used in the processing. The LP node <part-num-ref name="LP node">332</part-num-ref>
+ represents an item for packaged goods. For example, the LP can be the outcome of a packing operation. Physical units that are handled in the same manner in <boundary-data type="line-number">15 </boundary-data>
+logistics operations refer to the same LP. The LP can function as a logistics unit (LU) <part-num-ref name="logistics unit (LU)">333</part-num-ref>
+ or as a handling unit (HU) <part-num-ref name="handling unit (HU)">234.</part-num-ref>
+ Generally, the HU is considered as an identified LU. The activity node <part-num-ref name="activity node">308</part-num-ref>
+ has the material input node <part-num-ref name="material input node">310,</part-num-ref>
+ the material output node <part-num-ref name="material output node">312,</part-num-ref>
+ an LP input node <part-num-ref name="LP input node">336</part-num-ref>
+ and an LP output node <part-num-ref name="LP output node">338</part-num-ref>
+ associated with it, representing the input and output of one or more materials and LPs in <boundary-data type="line-number">20  </boundary-data>
+performing the activity.    </p>
+    <p id="p-59" num="59">The lot 350, in turn, correlates to the order in several areas. It has a lot header <part-num-ref name="lot header">352</part-num-ref>
+ with which is associated one or more operations <part-num-ref name="with which is associated one or more operations">354.</part-num-ref>
+ Particularly, the operations planned in the order <part-num-ref name="order">300</part-num-ref>
+ will be recorded in the lot <part-num-ref name="lot">350</part-num-ref>
+ upon being <boundary-data type="header">
+        <confidence value="88">17</confidence>
+      </boundary-data>
+      <page-break num="19"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+executed. The operation node <part-num-ref name="operation node">354</part-num-ref>
+ has any of operation types <part-num-ref name="has any of operation types">356.</part-num-ref>
+ Similarly, the lot contains at least one activity node <part-num-ref name="lot contains at least one activity node">358</part-num-ref>
+ that can be any of activity types <part-num-ref name="that can be any of activity types">360.</part-num-ref>
+ One or more step nodes <part-num-ref name="that can be any of activity types 360. One or more step nodes">362</part-num-ref>
+ can be associated with each activity node <part-num-ref name="can be associated with each activity node">358.</part-num-ref>
+    </p>
+    <p id="p-60" num="60">
+      <boundary-data type="line-number">5       </boundary-data>
+The lot 350 includes a material input node <part-num-ref name="material input node">364</part-num-ref>
+ correlating to the material input node <part-num-ref name="material input node">310</part-num-ref>
+ of the order <part-num-ref name="order">300.</part-num-ref>
+ Similarly, the lot <part-num-ref name="lot">350</part-num-ref>
+ includes a material output node <part-num-ref name="material output node">366</part-num-ref>
+ correlating to the material output node <part-num-ref name="material output node">312</part-num-ref>
+ of the order <part-num-ref name="order">300.</part-num-ref>
+ Here, the lot <part-num-ref name="lot">350</part-num-ref>
+ also includes an LP input node <part-num-ref name="LP input node">368</part-num-ref>
+ and an LP output node <part-num-ref name="LP output node">370</part-num-ref>
+ correlating, respectively, to the LP input node <part-num-ref name="LP input node">336</part-num-ref>
+ and the LP output node <part-num-ref name="LP output node">338</part-num-ref>
+ of <boundary-data type="line-number">10  </boundary-data>
+the order <part-num-ref name="order">300.</part-num-ref>
+    </p>
+    <p id="p-61" num="61">In execution of the physical operation(s) planned by the order <part-num-ref name="order">300,</part-num-ref>
+ the lot <part-num-ref name="lot">350</part-num-ref>
+ collects the actual data generated for each step of each activity in the operation, and tracks the materials and LUs that are involved in the process. An example of this will now be described.    </p>
+    <p id="p-62" num="62">
+      <boundary-data type="line-number">15       </boundary-data>
+FIG 4 shows an example of a production process <part-num-ref name="production process">400,</part-num-ref>
+ which can contain a production order object <part-num-ref name="production order object">402</part-num-ref>
+ and a production lot object <part-num-ref name="production lot object">404.</part-num-ref>
+ The production order <part-num-ref name="production order">402</part-num-ref>
+ may be generated from the order template <part-num-ref name="order template">108.</part-num-ref>
+ The production lot object <part-num-ref name="production lot object">404</part-num-ref>
+ is associated with the production order object <part-num-ref name="production order object">402</part-num-ref>
+ and may be generated from the lot template <part-num-ref name="lot template">110.</part-num-ref>
+ The production order <part-num-ref name="production order">402</part-num-ref>
+ dictates the steps <boundary-data type="line-number">20  </boundary-data>
+of the production process <part-num-ref name="production process">400</part-num-ref>
+ to be performed in the production environment.    </p>
+    <p id="p-63" num="63">The production lot 404 collects all actual data during the execution of the production process <part-num-ref name="production process">400</part-num-ref>
+ and documents its progress. The performance of individual activities in the process is confirmed using production confirmation <boundary-data type="header">
+        <confidence value="88">18</confidence>
+      </boundary-data>
+      <page-break num="20"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+documents <part-num-ref name="process is confirmed using production confirmation documents">406</part-num-ref>
+ that are generated at appropriate stages during the process.    </p>
+    <p id="p-64" num="64">The production lot 404 is realized upon release of the production order <part-num-ref name="production order">402.</part-num-ref>
+    </p>
+    <p id="p-65" num="65">The production order 402 is comprised of several operation nodes, a first one of which is a drilling operation <part-num-ref name="drilling operation">408.</part-num-ref>
+ The drilling operation <part-num-ref name="drilling operation">408</part-num-ref>
+ includes <boundary-data type="line-number">5  </boundary-data>
+component activity nodes, the first of which is an install tool activity <part-num-ref name="install tool activity">410.</part-num-ref>
+ Once this activity is performed, the drilling operation <part-num-ref name="drilling operation">408</part-num-ref>
+ receives a part to be drilled at a material input node <part-num-ref name="material input node">412.</part-num-ref>
+ The material input node <part-num-ref name="material input node">412</part-num-ref>
+ indicates where the production process dictates the part should be placed for input to the operation.    </p>
+    <p id="p-66" num="66">A drill activity 414 is then performed on the part. Following the drill activity <part-num-ref name="drill activity">414,</part-num-ref>
+ <boundary-data type="line-number">10  </boundary-data>
+the part is subjected to a measure activity <part-num-ref name="measure activity">416.</part-num-ref>
+ The drilling operation <part-num-ref name="drilling operation">408</part-num-ref>
+ completes at an unfinished material node <part-num-ref name="unfinished material node">418.</part-num-ref>
+ The modeling can include features for specifying byproducts and co-products in addition to the main product. The unfinished material node <part-num-ref name="unfinished material node">418</part-num-ref>
+ is associated with an internal material flow <part-num-ref name="internal material flow">419</part-num-ref>
+ that connects the drilling operation <part-num-ref name="drilling operation">408</part-num-ref>
+ with a subsequent hardening <boundary-data type="line-number">15  </boundary-data>
+operation <part-num-ref name="subsequent hardening operation">424.</part-num-ref>
+    </p>
+    <p id="p-67" num="67">Similar to the production order <part-num-ref name="production order">402,</part-num-ref>
+ the production lot <part-num-ref name="production lot">404</part-num-ref>
+ is comprised of several operation nodes, a first one of which is a drilling operation <part-num-ref name="drilling operation">420.</part-num-ref>
+ The drilling operation <part-num-ref name="drilling operation">420</part-num-ref>
+ is broken into component activity nodes, the first of which is an install tool activity <part-num-ref name="install tool activity">422.</part-num-ref>
+ The activity nodes, such as the install tool activity <part-num-ref name="install tool activity">422,</part-num-ref>
+ <boundary-data type="line-number">20  </boundary-data>
+store any data gathered during execution of the activity as dictated by the activity nodes in the drilling operation <part-num-ref name="drilling operation">408</part-num-ref>
+ of the production order <part-num-ref name="production order">402.</part-num-ref>
+ At appropriate stages during the execution of the production process <part-num-ref name="production process">400,</part-num-ref>
+ production confirmation documents <part-num-ref name="production process 400, production confirmation documents">406</part-num-ref>
+ are generated detailing results of a particular stage.    </p>
+    <boundary-data type="header">
+      <confidence value="88">19</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-68" num="68">
+      <page-break num="21"/>
+Following the drilling operation <part-num-ref name="drilling operation">408,</part-num-ref>
+ as dictated by the production order <part-num-ref name="production order">402,</part-num-ref>
+ the part enters the hardening operation <part-num-ref name="hardening operation">424.</part-num-ref>
+ The part to be hardened is input to the operation via the unfinished material <part-num-ref name="unfinished material">418.</part-num-ref>
+ The part is hardened during a harden activity <part-num-ref name="harden activity">428</part-num-ref>
+ and exits the hardening operation <part-num-ref name="hardening operation">424</part-num-ref>
+ at an <boundary-data type="line-number">5  </boundary-data>
+unfinished material node <part-num-ref name="unfinished material node">430.</part-num-ref>
+ A hardening operation <part-num-ref name="hardening operation">432,</part-num-ref>
+ contained within the production lot <part-num-ref name="production lot">404,</part-num-ref>
+ contains a harden activity object <part-num-ref name="harden activity object">434</part-num-ref>
+ which stores data pertinent to the performance of the activity. Confirmation documentation may be triggered when the activity is complete.    </p>
+    <p id="p-69" num="69">The final operation in the production process, as dictated by the <boundary-data type="line-number">10  </boundary-data>
+production order <part-num-ref name="production order">402,</part-num-ref>
+ calls for the part to enter a painting operation <part-num-ref name="painting operation">436.</part-num-ref>
+ The painting operation <part-num-ref name="painting operation">436</part-num-ref>
+ contains component activities including a setup paint shop activity <part-num-ref name="setup paint shop activity">438,</part-num-ref>
+ a paint activity <part-num-ref name="paint activity">440</part-num-ref>
+ and a clean paint shop activity <part-num-ref name="clean paint shop activity">442.</part-num-ref>
+ A material input node <part-num-ref name="material input node">443</part-num-ref>
+ indicates an input to the setup activity. Also, a material input <part-num-ref name="material input">444</part-num-ref>
+ indicates an input to the paint activity, e.g., to use red paint. That is, the <boundary-data type="line-number">15  </boundary-data>
+unfinished material that is to be painted enters via the unfinished material node <part-num-ref name="unfinished material node">430.</part-num-ref>
+ The internal material flow is modeled via nodes associated with the internal material flow node. A painting operation <part-num-ref name="painting operation">448</part-num-ref>
+ also exists in the production lot <part-num-ref name="production lot">404</part-num-ref>
+ to contain data related to performing the painting operation and to trigger related production confirmation documents <part-num-ref name="painting operation and to trigger related production confirmation documents">406.</part-num-ref>
+    </p>
+    <p id="p-70" num="70">
+      <boundary-data type="line-number">20       </boundary-data>
+FIG 5 shows an example of a site logistics (warehouse) process <part-num-ref name="site logistics (warehouse) process">500,</part-num-ref>
+ which can contain a site logistics order object <part-num-ref name="site logistics order object">502</part-num-ref>
+ and a site logistics lot object <part-num-ref name="site logistics lot object">504.</part-num-ref>
+ The site logistics order <part-num-ref name="site logistics order">502</part-num-ref>
+ may be generated from the order template <part-num-ref name="order template">108.</part-num-ref>
+    </p>
+    <p id="p-71" num="71">The site logistics lot object 504 is associated with the site logistics order object <boundary-data type="header">
+        <confidence value="88">20</confidence>
+      </boundary-data>
+      <page-break num="22"/>
+      <boundary-data type="header">Atto<confidence value="88">rn</confidence>
+ey Docket No. 15609-087001/2005P00932 US      </boundary-data>
+      <part-num-ref name="site logistics order object">502</part-num-ref>
+ and may be generated from the lot template <part-num-ref name="lot template">110.</part-num-ref>
+ The site logistics order <part-num-ref name="site logistics order">502</part-num-ref>
+ dictates the steps of the site logistics process <part-num-ref name="site logistics process">500</part-num-ref>
+ to be performed, for example in the warehouse environment. The site logistics lot <part-num-ref name="site logistics lot">504</part-num-ref>
+ collects all actual data during the execution of the site logistics process <part-num-ref name="site logistics process">500</part-num-ref>
+ and documents <boundary-data type="line-number">5  </boundary-data>
+its progress. The performance of individual activities in the process is confirmed using site logistics confirmation documents <part-num-ref name="process is confirmed using site logistics confirmation documents">506</part-num-ref>
+ that are generated at appropriate stages during the process. The site logistics lot <part-num-ref name="site logistics lot">504</part-num-ref>
+ is realized upon release of the site logistics order <part-num-ref name="site logistics order">502.</part-num-ref>
+    </p>
+    <p id="p-72" num="72">The site logistics order 502 is comprised of two operation nodes, a first <boundary-data type="line-number">10  </boundary-data>
+one of which is a making operation <part-num-ref name="making operation">508.</part-num-ref>
+ The making operation <part-num-ref name="making operation">508</part-num-ref>
+ includes a make activity <part-num-ref name="make activity">510.</part-num-ref>
+ For example, this includes an assembly operation or a light manufacturing step performed in the warehouse. The make activity <part-num-ref name="make activity">510</part-num-ref>
+ receives a material to be manipulated at material input node <part-num-ref name="material to be manipulated at material input node">512.</part-num-ref>
+ The make activity <part-num-ref name="make activity">510</part-num-ref>
+ is then performed on the input material. The making operation <part-num-ref name="making operation">508</part-num-ref>
+ completes at <boundary-data type="line-number">15  </boundary-data>
+a material output node <part-num-ref name="material output node">514.</part-num-ref>
+ That is, the site logistics process uses these material nodes in contrast to the production process which uses unfinished material nodes and logistic package nodes.    </p>
+    <p id="p-73" num="73">Similar to the site logistics order <part-num-ref name="site logistics order">502,</part-num-ref>
+ the site logistics lot <part-num-ref name="site logistics lot">504</part-num-ref>
+ is comprised of two operation nodes, a first one of which is a making operation <part-num-ref name="making operation">516.</part-num-ref>
+ The <boundary-data type="line-number">20  </boundary-data>
+making operation <part-num-ref name="making operation">516</part-num-ref>
+ includes a make activity <part-num-ref name="make activity">518.</part-num-ref>
+ The make activity <part-num-ref name="make activity">518</part-num-ref>
+ stores any data gathered during execution of the activity as dictated by the activity node in the making operation <part-num-ref name="making operation">508</part-num-ref>
+ of the site logistics order <part-num-ref name="site logistics order">502.</part-num-ref>
+ At appropriate stages <boundary-data type="header">
+        <confidence value="88">21</confidence>
+      </boundary-data>
+      <page-break num="23"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+during the execution of the site logistics process <part-num-ref name="site logistics process">500,</part-num-ref>
+ site logistics confirmation documents <part-num-ref name="site logistics process 500, site logistics confirmation documents">506</part-num-ref>
+ are generated detailing results of a particular stage.    </p>
+    <p id="p-74" num="74">Following the making operation <part-num-ref name="making operation">508,</part-num-ref>
+ as dictated by the site logistics order <part-num-ref name="site logistics order">502,</part-num-ref>
+ the part enters a packing operation <part-num-ref name="packing operation">520.</part-num-ref>
+ The material to be packed is input <boundary-data type="line-number">5  </boundary-data>
+to the operation at material input <part-num-ref name="operation at material input">522.</part-num-ref>
+ This corresponds to the material at the output <part-num-ref name="output">514.</part-num-ref>
+ The part is packed during a pack activity <part-num-ref name="pack activity">524</part-num-ref>
+ and exits the packing operation <part-num-ref name="packing operation">520</part-num-ref>
+ at a material output <part-num-ref name="material output">526.</part-num-ref>
+ A packing operation <part-num-ref name="packing operation">528,</part-num-ref>
+ contained within the site logistics lot <part-num-ref name="site logistics lot">504,</part-num-ref>
+ contains a pack activity object <part-num-ref name="pack activity object">530</part-num-ref>
+ which stores data pertinent to the performance of the activity. Confirmation documentation may be <boundary-data type="line-number">10  </boundary-data>
+triggered when the activity is complete.    </p>
+    <p id="p-75" num="75">FIG 6 shows an object relationship <part-num-ref name="object relationship">600</part-num-ref>
+ that includes a logistics confirmation template <part-num-ref name="logistics confirmation template">602.</part-num-ref>
+ The logistics confirmation template <part-num-ref name="logistics confirmation template">602</part-num-ref>
+ may be used by the production lot <part-num-ref name="production lot">106</part-num-ref>
+ or the site logistics lot <part-num-ref name="site logistics lot">116</part-num-ref>
+ to generate confirmation objects relevant to the production environment <part-num-ref name="production environment">102</part-num-ref>
+ or the warehouse <boundary-data type="line-number">15  </boundary-data>
+environment <part-num-ref name="warehouse environment">112</part-num-ref>
+ respectively. The logistics confirmation confirms materials, goods and activities that have been completed.    </p>
+    <p id="p-76" num="76">First the logistics confirmation template <part-num-ref name="logistics confirmation template">602</part-num-ref>
+ includes a root node logistics confirmation <part-num-ref name="root node logistics confirmation">604</part-num-ref>
+ and a subordinate node inventory change item <part-num-ref name="subordinate node inventory change item">606.</part-num-ref>
+ The logistics confirmation <part-num-ref name="logistics confirmation">604</part-num-ref>
+ may be configured for use in a variety of logistics <boundary-data type="line-number">20  </boundary-data>
+environments. Particularly, the logistics confirmation template <part-num-ref name="logistics confirmation template">602</part-num-ref>
+ may be used to generate at least three business objects: a goods and activity confirmation object <part-num-ref name="goods and activity confirmation object">608,</part-num-ref>
+ a production confirmation object <part-num-ref name="production confirmation object">610</part-num-ref>
+ and a site logistics confirmation object <part-num-ref name="site logistics confirmation object">612.</part-num-ref>
+ The production confirmation object <part-num-ref name="production confirmation object">610</part-num-ref>
+ may be generated by the <boundary-data type="header">
+        <confidence value="88">22</confidence>
+      </boundary-data>
+      <page-break num="24"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+production lot <part-num-ref name="production lot">106</part-num-ref>
+ to document the execution results of certain physical operations and activities within the production environment. The site logistics confirmation object <part-num-ref name="site logistics confirmation object">612</part-num-ref>
+ deals with the execution of processes within the site (e.g., moving, packing, counting etc.) and updates to inventory. The site logistics <boundary-data type="line-number">5  </boundary-data>
+confirmation object <part-num-ref name="site logistics confirmation object">612</part-num-ref>
+ may interact with the inventory object <part-num-ref name="inventory object">230</part-num-ref>
+ in the confirmation and inventory processing component <part-num-ref name="confirmation and inventory processing component">228</part-num-ref>
+ through actions on the site logistics lot <part-num-ref name="site logistics lot">116.</part-num-ref>
+    </p>
+    <p id="p-77" num="77">Second the inventory change item <part-num-ref name="inventory change item">606</part-num-ref>
+ is a node in the logistics confirmation <part-num-ref name="logistics confirmation">604</part-num-ref>
+ that documents an inventory change. It may occur in three <boundary-data type="line-number">10  </boundary-data>
+specializations: an inventory item change <part-num-ref name="inventory item change">614,</part-num-ref>
+ a logistic unit (LU) change <part-num-ref name="logistic unit (LU) change">616</part-num-ref>
+ and a handling unit (HU) change <part-num-ref name="handling unit (HU) change">618.</part-num-ref>
+ A LU is an object that describes the logistics aspects of a product, package or a HU. All three of these nodes provide actions used to make changes in the inventory business object <part-num-ref name="inventory business object">230.</part-num-ref>
+ The inventory item change <part-num-ref name="inventory item change">614</part-num-ref>
+ manipulates a quantity or attribute of a material in a <boundary-data type="line-number">15  </boundary-data>
+storage location. Inventory item change <part-num-ref name="storage location. Inventory item change">614</part-num-ref>
+ contains a subordinate node: an inventory item change item quantity <part-num-ref name="inventory item change item quantity">620</part-num-ref>
+ which is used to change the quantity of a material in a storage location. The LU change <part-num-ref name="LU change">616</part-num-ref>
+ is used to change the LU for a given item. The HU change <part-num-ref name="HU change">618</part-num-ref>
+ is used to change the HU for a given item.    </p>
+    <p id="p-78" num="78">The inventory change item 606 contains two subordinate nodes: an <boundary-data type="line-number">20  </boundary-data>
+assignment <part-num-ref name="assignment">622</part-num-ref>
+ and a reference <part-num-ref name="reference">624.</part-num-ref>
+ The assignment <part-num-ref name="assignment">622</part-num-ref>
+ relates to an assignment of an inventory change item to a set of account assignment objects.    </p>
+    <p id="p-79" num="79">The reference 624 relates to a reference to a different business document or the business document item relevant to the inventory change item.</p>
+    <boundary-data type="header">
+      <confidence value="88">23</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P0<confidence value="5">0</confidence>
+932 US    </boundary-data>
+    <p id="p-80" num="80">
+      <page-break num="25"/>
+Inbound relationships exist between the inventory change item <part-num-ref name="inventory change item">606</part-num-ref>
+ and a variety of business foundation objects. A supply planning area object <part-num-ref name="supply planning area object">626</part-num-ref>
+ specifies the planning-relevant area in which the inventory is changed. A logistics operating unit object <part-num-ref name="logistics operating unit object">628</part-num-ref>
+ specifies the LU whose inventory has changed.    </p>
+    <p id="p-81" num="81">
+      <boundary-data type="line-number">5  </boundary-data>
+A handling unit object 630 specifies the HU whose inventory has changed. A business partner object <part-num-ref name="business partner object">632</part-num-ref>
+ specifies the business partner associated with an inventory change. A resource object <part-num-ref name="resource object">634</part-num-ref>
+ specifies the place represented by a resource at which the inventory has changed. A product object <part-num-ref name="product object">636</part-num-ref>
+ specifies the product whose inventory has changed. A batch object <part-num-ref name="batch object">638</part-num-ref>
+ specifies the batch <boundary-data type="line-number">10  </boundary-data>
+whose inventory has changed.    </p>
+    <p id="p-82" num="82">
+      <confidence value="86">FI</confidence>
+G 7 shows a process <part-num-ref name="process">700</part-num-ref>
+ with branching. Branching relates to alternative processing paths that can be taken in a process. Branching can be used in production type processes and in warehouse type processes, and can be included in a template from which is to be created objects for use in any of these <boundary-data type="line-number">15  </boundary-data>
+processes. Branches can be classified into two types: non-exclusive branching and exclusive branching. Non-exclusive branching involves alternative processing paths that may be processed simultaneously. Exclusive branching involves alternative processing paths wherein only one of them may be processed at a time.    </p>
+    <p id="p-83" num="83">
+      <boundary-data type="line-number">20       </boundary-data>
+In this example process 700, a first path <part-num-ref name="first path">702</part-num-ref>
+ and a second path <part-num-ref name="second path">704</part-num-ref>
+ represent alternative process paths that originate in a branch <part-num-ref name="branch">706.</part-num-ref>
+ The branch <part-num-ref name="branch">706</part-num-ref>
+ may be exclusive or non-exclusive. Operations are located on each path subsequent to the branch. Path <part-num-ref name="branch. Path">702</part-num-ref>
+ defines operation <part-num-ref name="defines operation">10</part-num-ref>
+ and operation <part-num-ref name="and operation">11</part-num-ref>
+ and <boundary-data type="header">
+        <confidence value="88">24</confidence>
+      </boundary-data>
+      <page-break num="26"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+path <part-num-ref name="and path">704</part-num-ref>
+ defines operation <part-num-ref name="defines operation">20</part-num-ref>
+ and operation <part-num-ref name="and operation">21.</part-num-ref>
+ Following the completion of the operations defined in a particular branch, the process flows through a join node <part-num-ref name="join node">708</part-num-ref>
+ where the process may continue.    </p>
+    <p id="p-84" num="84">FIG 8 is a flow chart of exemplary operations <part-num-ref name="flow chart of exemplary operations">800</part-num-ref>
+ that can be performed in <boundary-data type="line-number">5  </boundary-data>
+a computer system in association with initiating a physical operation. The operations <part-num-ref name="operations">800</part-num-ref>
+ can be performed by a processor executing instructions stored in a computer program product. The operations <part-num-ref name="operations">800</part-num-ref>
+ begin in step <part-num-ref name="begin in step">802</part-num-ref>
+ with receiving a request in a computer system for a physical operation. For example, the site logistics request <part-num-ref name="site logistics request">206</part-num-ref>
+ can be received as a request for a warehouse <boundary-data type="line-number">10  </boundary-data>
+operation. In step <part-num-ref name="warehouse operation. In step">804,</part-num-ref>
+ the operations comprise generating a first object to be used in the physical operation. The first object is generated based on the physical operation using a template. The template is configured for generating objects for any of at least <part-num-ref name="template is configured for generating objects for any of at least">(1)</part-num-ref>
+ a physical operation performed in product manufacturing and <part-num-ref name="physical operation performed in product manufacturing and">(2)</part-num-ref>
+ a physical operation performed in post-manufacturing <boundary-data type="line-number">15  </boundary-data>
+product management. For example, the site logistics order <part-num-ref name="site logistics order">114</part-num-ref>
+ can be generated from the order template <part-num-ref name="order template">108.</part-num-ref>
+ As another example, the production order <part-num-ref name="production order">104</part-num-ref>
+ can be generated from the order template <part-num-ref name="order template">108.</part-num-ref>
+ In optional step <part-num-ref name="order template 108. In optional step">806,</part-num-ref>
+ the physical operation corresponding to the request can be initiated. For example any of the operations illustrated in FIGS 4 or <part-num-ref name="or">5</part-num-ref>
+ can be initiated.    </p>
+    <p id="p-85" num="85">
+      <boundary-data type="line-number">20       </boundary-data>
+FIG. 9 is a block diagram of a computer system <part-num-ref name="computer system">900</part-num-ref>
+ that can be used in the operations described above, according to one embodiment. The system <part-num-ref name="system">900</part-num-ref>
+ includes a processor <part-num-ref name="processor">910,</part-num-ref>
+ a memory <part-num-ref name="memory">920,</part-num-ref>
+ a storage device <part-num-ref name="storage device">930,</part-num-ref>
+ and an input/output device <part-num-ref name="input/output device">940.</part-num-ref>
+ Each of the components <part-num-ref name="components">910,</part-num-ref>
+ <part-num-ref name="components 910,">920,</part-num-ref>
+ <part-num-ref name="components 910, 920,">930,</part-num-ref>
+ and <part-num-ref name="components 910, 920, 930, and">940</part-num-ref>
+ are <boundary-data type="header">
+        <confidence value="88">25</confidence>
+      </boundary-data>
+      <page-break num="27"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+interconnected using a system bus <part-num-ref name="system bus">950.</part-num-ref>
+ The processor <part-num-ref name="processor">910</part-num-ref>
+ is capable of processing instructions for execution within the system <part-num-ref name="system">900.</part-num-ref>
+ In one embodiment, the processor <part-num-ref name="processor">910</part-num-ref>
+ is a single-threaded processor. In another embodiment, the processor <part-num-ref name="processor">910</part-num-ref>
+ is a multi-threaded processor. The processor <part-num-ref name="processor">910</part-num-ref>
+ is capable of <boundary-data type="line-number">5  </boundary-data>
+processing instructions stored in the memory <part-num-ref name="memory">920</part-num-ref>
+ or on the storage device <part-num-ref name="storage device">930</part-num-ref>
+ to display graphical information for a user interface on the input/output device <part-num-ref name="input/output device">940.</part-num-ref>
+    </p>
+    <p id="p-86" num="86">The memory 920 stores information within the system <part-num-ref name="system">900.</part-num-ref>
+ In one embodiment, the memory <part-num-ref name="memory">920</part-num-ref>
+ is a computer-readable medium. In one embodiment, the memory <part-num-ref name="memory">920</part-num-ref>
+ is a volatile memory unit. In another embodiment, <boundary-data type="line-number">10  </boundary-data>
+the memory <part-num-ref name="memory">920</part-num-ref>
+ is a non-volatile memory unit.    </p>
+    <p id="p-87" num="87">The storage device 930 is capable of providing mass storage for the system <part-num-ref name="system">900.</part-num-ref>
+ In one embodiment, the storage device <part-num-ref name="storage device">930</part-num-ref>
+ is a computer- readable medium. In various different embodiments, the storage device <part-num-ref name="storage device">930</part-num-ref>
+ may be a floppy disk device, a hard disk device, an optical disk device, or a tape <boundary-data type="line-number">15  </boundary-data>
+device.    </p>
+    <p id="p-88" num="88">The input/output device 940 provides input/output operations for the system <part-num-ref name="system">900.</part-num-ref>
+ In one embodiment, the input/output device <part-num-ref name="input/output device">940</part-num-ref>
+ includes a keyboard and/or pointing device. In one embodiment, the input/output device <part-num-ref name="input/output device">940</part-num-ref>
+ includes a display unit for displaying graphical user interfaces.    </p>
+    <p id="p-89" num="89">
+      <boundary-data type="line-number">20       </boundary-data>
+The invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Apparatus of the invention can be implemented in a computer program product tangibly embodied in an information carrier, e.g., in a machine-readable storage device or <boundary-data type="header">
+        <confidence value="88">26</confidence>
+      </boundary-data>
+      <page-break num="28"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+in a propagated signal, for execution by a programmable processor; and method steps of the invention can be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output. The invention can be implemented <boundary-data type="line-number">5  </boundary-data>
+advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, <boundary-data type="line-number">10 </boundary-data>
+in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.    </p>
+    <p id="p-90" num="90">
+      <boundary-data type="line-number">15       </boundary-data>
+Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a <boundary-data type="line-number">20  </boundary-data>
+processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer will also include, or be operatively coupled to communicate with, one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and <boundary-data type="header">
+        <confidence value="88">27</confidence>
+      </boundary-data>
+      <page-break num="29"/>
+      <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices;    </p>
+    <p id="p-91" num="91">
+      <boundary-data type="line-number">5  </boundary-data>
+magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).    </p>
+    <p id="p-92" num="92">To provide for interaction with a user, the invention can be implemented <boundary-data type="line-number">10  </boundary-data>
+on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user and a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the computer.    </p>
+    <p id="p-93" num="93">The invention can be implemented in a computer system that includes a <boundary-data type="line-number">15  </boundary-data>
+back-end component, such as a data server, or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication <boundary-data type="line-number">20  </boundary-data>
+such as a communication network. Examples of communication networks include, e.g., a LAN, a WAN, and the computers and networks forming the Internet.    </p>
+    <boundary-data type="header">
+      <confidence value="88">28</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 15609-087001/2005P00932 US</boundary-data>
+    <p id="p-94" num="94">
+      <page-break num="30"/>
+The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a network, such as the described one. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client- <boundary-data type="line-number">5  </boundary-data>
+server relationship to each other.    </p>
+    <p id="p-95" num="95">A number of embodiments of the invention have been described.</p>
+    <p id="p-96" num="96">Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.</p>
+    <boundary-data type="header">
+      <confidence value="88">29</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11323850.xml

@@ -0,0 +1,612 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11323850</doc-number>
+        <date>2005-12-30</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Atty Docket No.: TELV-P<confidence value="486">O10</confidence>
+ 5                                    Application For United States Non<confidence value="5">-</confidence>
+Provisional Utility Patent Title<confidence value="5">:</confidence>
+    </p>
+    <heading id="h-1">INTELLIGENT LOCATION BASED SERVICES AND NAVIGATION</heading>
+    <heading id="h-2">HYBRID SYSTEM</heading>
+    <p id="p-2" num="2">
+      <boundary-data type="line-number">
+        <confidence value="86">10</confidence>
+       </boundary-data>
+Inventor:    </p>
+    <p id="p-3" num="3">
+      <boundary-data type="line-number">15   </boundary-data>
+      <confidence value="5">Y</confidence>
+i-Chung Chao, residing at 45630 Parkmeadow Court, Fremont, CA, <part-num-ref name="Parkmeadow Court, Fremont, CA,">94539,</part-num-ref>
+ a citizen of the United States of America.    </p>
+    <p id="p-4" num="4">Robert Rennard, residing at 2485 Muirfield Way, Gilroy, CA <part-num-ref name="Muirfield Way, Gilroy, CA">95020,</part-num-ref>
+ a citizen of the United States of America.    </p>
+    <p id="p-5" num="5">
+      <boundary-data type="line-number">
+        <confidence value="88">20</confidence>
+      </boundary-data>
+ Haiping Jin, residing at 2052 Arrowood Lane, San Jose, CA, <part-num-ref name="Arrowood Lane, San Jose, CA,">95130,</part-num-ref>
+ a citizen of the United States of America.    </p>
+    <p id="p-6" num="6">
+      <confidence value="88">25</confidence>
+ <page-break num="2"/>
+    </p>
+    <heading id="h-3">INTELLIGENT LOCATION BASED SERVICES AND</heading>
+    <heading id="h-4">NAVIGATION HYBRID SYSTEM</heading>
+    <p id="p-7" num="7">Field of Invention <boundary-data type="line-number">5   </boundary-data>
+[<confidence value="66885">0001]</confidence>
+ The present invention relates generally to hybrid systems, and more particularly, to a system for a location based services and navigation system wherein a client and a server communicate to carry out the location based service and navigation tasks.    </p>
+    <p id="p-8" num="8">Description of Related Art <boundary-data type="line-number">10   </boundary-data>
+[0002<confidence value="2">]</confidence>
+ Rapid growth in consumer electronics is evident with mobility as a ubiquitous feature. Consumer electronics products, such as music players, digital cameras, personal digital assistants (PDA), cellular phones, and notebooks, offer means for users to create, transfer, store, and consume information almost anywhere, anytime.    </p>
+    <p id="p-9" num="9">[0003<confidence value="5">]</confidence>
+ One consumer electronics growth, where mobility is quintessential, is in location <boundary-data type="line-number">15   </boundary-data>
+based services, such as navigation systems utilizing satellite-based Global Positioning System (GPS) devices. Location based services allow users to create, transfer, store, and/or consume information in order for users to create, transfer, store, and consume in the "real world". One such use of location based services is to efficiently transfer or route users to the desired destination or service.    </p>
+    <p id="p-10" num="10">
+      <boundary-data type="line-number">20   </boundary-data>
+      <confidence value="5">[</confidence>
+0004<confidence value="5">]</confidence>
+ Navigation systems and location based services enabled systems have been incorporated in automobiles, notebooks, handheld devices, and other portable products.    </p>
+    <p id="p-11" num="11">Today, these systems aid users by incorporating available, real-time relevant information, such as maps, directions, local businesses, or other points of interest. The real-time <boundary-data type="header">CONFIDENTIAL                          2                             TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+information provides invaluable relevant information, when available or in service areas.    </p>
+    <p id="p-12" num="12">The relevant information is also invaluable when service is not available, as well.</p>
+    <p id="p-13" num="13">[0005<confidence value="5">1</confidence>
+ Currently, there are mainly two types of navigation system. One is client based navigation system. All map content and navigation software are stored on the client. And <boundary-data type="line-number">5   </boundary-data>
+the client based navigation system can be specially designed standalone GPS navigation units, normally called Personal Navigation Device (PND), with large memory device to store maps on board; or using standard PDA or smart phone with memory card. The second one is thin client and server based navigation system. This is very typical of cell phone based navigation system. In this case, the map data and other Points of Interest <boundary-data type="line-number">10   </boundary-data>
+(P<confidence value="66">OI</confidence>
+) data are stored at server. The map data is loaded to the phone to provide navigation service through the phone, each time its user requests the navigation service. The drawback of the client based navigation system is the inconvenience to get more updated maps. Also, it is more costly and typically larger in size since it needs larger memory card to store large amount of maps and P<confidence value="66">OI</confidence>
+ data. Because of limitation of the memory <boundary-data type="line-number">15   </boundary-data>
+card, and the large data size of the street audio prompts, the typical standalone navigation device does not provide audio street name prompts. The advantage is that it can be used in areas without wireless coverage, because it does not depend on wireless service as the thin client navigation system. The drawback of the thin client navigation system is that it always need wireless network to load the map information to the client to navigate. So <boundary-data type="line-number">20   </boundary-data>
+when there is no network, the user is then unable to access the navigation service. The advantage of the thin client system is that its map data is always updated, because it can be done at server by the service provider, rather by users. Also the P<confidence value="66">OI</confidence>
+ data can be updated as well from server. It can also provide other real time information to the thin <boundary-data type="header">CONFIDENTIAL                        3                             TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+client through wireless network, such as gas price or weather information. Also since all street audio prompts are stored at server, the thin client system can play audio street prompts, because they are loaded to the phone together with map and route information when the user requests the navigation services. A hybrid navigation system is needed to <boundary-data type="line-number">5   </boundary-data>
+address above drawbacks of either client based system or thin client based system, and at the same time take advantage of the merits of both systems.    </p>
+    <heading id="h-5">SU<confidence value="8">M</confidence>
+MARY OF THE INVENTION    </heading>
+    <p id="p-14" num="14">
+      <confidence value="5">[</confidence>
+0006<confidence value="5">1</confidence>
+ An intelligent location based services and navigation hybrid system is provided by <boundary-data type="line-number">10   </boundary-data>
+partitioning the intelligence between the server and client devices to support off-line as well as on-line or real-time relevant information system comprising a server-client structure, wherein the relevant information functions are partitioned and executed by one or more distributed servers and location based service enabled client devices. The present invention provides an intelligent location based services and navigation system <boundary-data type="line-number">15   </boundary-data>
+comprising a client having location based service capability and storing information capability and a server. The intelligent location based services and navigation system provides functions to set a condition for updates of a relevant information by the server and client (distributed and coordinated conditions), selects the relevant information for the updates by the server, transmits the relevant information from the server, receives the <boundary-data type="line-number">20   </boundary-data>
+updates of the relevant information by the client, and selects an operational mode by the client and/or server.    </p>
+    <p id="p-15" num="15">[0007<confidence value="5">1</confidence>
+ The intelligent location based services and navigation hybrid system provides flexible, expansive, and robust real-time or on-line, as well as off-line relevant <boundary-data type="header">CONFIDENTIAL                          4                              TELV-P<confidence value="585">010</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+information to location based services enabled devices that have not been previously achieved. The client may intelligently request updates, or request entirely new type of information from the server as desired, receive the updates, or provide updates as well.    </p>
+    <p id="p-16" num="16">The client may elect to operate off-line or on-line in areas with services to optimize <boundary-data type="line-number">5   </boundary-data>
+interaction with the server. The client may utilize extended storage of the memory accessing vast amounts of relevant information as desired. The client can accumulate information received from the server and only update the information from server as needed. The client may also delete information based on the priorities to accommodate the limited storage size on the client. These priorities can be set either through client <boundary-data type="line-number">10   </boundary-data>
+application but with the ability to be set through server as well. The client can also start with preloaded information through memory storage device either internal or external to the client. The server may also intelligently provide updates to the client based on predetermined intervals, event driven, or based on analysis by the server, such as travel routes leading the client to areas with no content to support that region.    </p>
+    <boundary-data type="header">CONFIDENTIAL                           5                             TELV-P<confidence value="566">O10</confidence>
+    </boundary-data>
+    <heading id="h-6">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-17" num="17">
+      <page-break num="6"/>
+      <confidence value="5">[</confidence>
+0008<confidence value="5">]</confidence>
+ The accompanying drawings that are incorporated in and form a part of this specification illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention:    </p>
+    <p id="p-18" num="18">
+      <boundary-data type="line-number">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+ FIG. 1 is an architectural diagram of an intelligent location based services and navigation hybrid system in an embodiment of the present invention;    </p>
+    <p id="p-19" num="19">FIG. 2 is a more detailed architectural diagram of the communication path of FIG.</p>
+    <p id="p-20" num="20">
+      <confidence value="88">1;</confidence>
+    </p>
+    <p id="p-21" num="21">
+      <boundary-data type="line-number">10         </boundary-data>
+FIG. 3 is a diagrammatical view of geographic regions having no access to server;    </p>
+    <p id="p-22" num="22">FIG. 4 is a more detailed diagrammatical view of the geographic regions of FIG. 3 with the relevant information stored on the distribution of the client;</p>
+    <p id="p-23" num="23">FIG. 5 is a flow chart for a processing flow in the server and client of the relevant information; and <boundary-data type="line-number">15         </boundary-data>
+FIG. 6 is a flow chart of the intelligent located based services and navigation hybrid system in an embodiment of the present invention.    </p>
+    <boundary-data type="header">CONFIDENTIAL                         6                             TELV-P<confidence value="488">010</confidence>
+    </boundary-data>
+    <heading id="h-7">DETAI<confidence value="8">L</confidence>
+ED DESCRIPTION    </heading>
+    <p id="p-24" num="24">
+      <page-break num="7"/>
+[009<confidence value="5">]</confidence>
+ The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements. In the following description, specific nomenclature is set forth to provide a <boundary-data type="line-number">5   </boundary-data>
+thorough understanding of the present invention. It will be apparent to one skilled in the art that the specific details may not be necessary to practice the present invention.    </p>
+    <p id="p-25" num="25">Furthermore, various modifications to the embodiments will be readily apparent to those skilled in the art and the generic principles herein may be applied to other embodiments not necessarily enumerated herein. Thus, the present invention is not intended to be <boundary-data type="line-number">10   </boundary-data>
+limited to the embodiments shown but is to be accorded the widest scope consistent with the principles and features described herein.    </p>
+    <p id="p-26" num="26">[0010<confidence value="5">]</confidence>
+ A key component of a navigation system is the determination of the navigation information (or position) of a user. It is intended that the term navigation information referred to herein comprises a geographic location or geographic information relating to <boundary-data type="line-number">15   </boundary-data>
+the position of an object. The navigation information may contain three-dimensional information that completely defines the substantially exact position of an object. In some additional embodiments, the navigation information may contain information that is not sufficient to completely define the position of an object. Broadly defined, as used herein, the navigation information also may include speed, time, direction of movement, etc. of <boundary-data type="line-number">20   </boundary-data>
+an object.    </p>
+    <p id="p-27" num="27">[0011<confidence value="5">]</confidence>
+ One skilled in the art would appreciate that the format with which a navigation information is expressed is not critical to some embodiments of the invention. For example, in some embodiments, navigation information is presented in the format of (x, <boundary-data type="header">CONFIDENTIAL                          7                             TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+y), where x and y are two ordinates that define the geographic location, i.e., a position of a user. In an alternative embodiment, navigation information is presented by longitude and latitude related information. In another embodiment of the present invention, the navigation information also includes a velocity element comprising a speed component <boundary-data type="line-number">5   </boundary-data>
+and a heading component.    </p>
+    <p id="p-28" num="28">[0012<confidence value="5">1</confidence>
+ A key component of an intelligent location based services and navigation hybrid system is the relevant information for the user. It is intended that the term relevant information referred to herein comprises the navigation information described supra as well as information relating to points of interest to the user, such as local business, hours <boundary-data type="line-number">10   </boundary-data>
+of businesses, types of businesses, advertised specials, traffic information, maps, local events, and nearby community or personal information etc.    </p>
+    <p id="p-29" num="29">[0013<confidence value="5">1</confidence>
+ Referring now to FIG. 1, therein is shown an architectural diagram of an intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ in an embodiment of the present invention. The intelligent location based services and navigation hybrid <boundary-data type="line-number">15   </boundary-data>
+system is provided by partitioning the intelligence between the server and client devices to support off-line as well as on-line or real-time relevant information system comprising a server-client structure, wherein the relevant information functions are partitioned and executed by one or more distributed servers and location based service enabled client devices. The architectural diagram depicts a client <part-num-ref name="client">102,</part-num-ref>
+ such as location based service <boundary-data type="line-number">20   </boundary-data>
+(LBS) enabled communication device, a communication path <part-num-ref name="communication path">104,</part-num-ref>
+ and a server <part-num-ref name="server">106.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may be any number of locations based service communication device, such as a wireless personal digital assistant, smart phone, cellular phone, satellite phone, or integrated into vehicular telematic, all with capabilities to store information locally.    </p>
+    <boundary-data type="header">CONFIDENTIAL                          <confidence value="5">8</confidence>
+                             TELV-P<confidence value="488">010</confidence>
+    </boundary-data>
+    <p id="p-30" num="30">
+      <page-break num="9"/>
+      <confidence value="5">[</confidence>
+0014<confidence value="5">1</confidence>
+ The processing intelligence of the intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ is partitioned with the server <part-num-ref name="server">106</part-num-ref>
+ and the client <part-num-ref name="client">102</part-num-ref>
+ with both having rules and logics to intelligently perform the respective functions. The functions in the client <part-num-ref name="client">102</part-num-ref>
+ and the server <part-num-ref name="server">106</part-num-ref>
+ for the intelligent location based services <boundary-data type="line-number">5   </boundary-data>
+and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ may be executed by software, firmware, hardware, or any combination thereof<confidence value="5">.</confidence>
+ The client <part-num-ref name="client">102</part-num-ref>
+ and the server <part-num-ref name="server">106</part-num-ref>
+ may independently or jointly control, update, and optimize the interaction, such as providing updates based on changing weather or traffic conditions or availabilities of the relevant information in the region client needs to operate or availabilities of the server access, with each other <boundary-data type="line-number">10   </boundary-data>
+utilizing the communication path <part-num-ref name="communication path">104.</part-num-ref>
+ The server <part-num-ref name="server">106</part-num-ref>
+ may also receive and analyze the relevant information from the client <part-num-ref name="client">102.</part-num-ref>
+ For example, the server <part-num-ref name="server">106</part-num-ref>
+ may change the rules on the client <part-num-ref name="client">102,</part-num-ref>
+ or change the parameters of the rules based on information from different sources relevant to the client <part-num-ref name="client">102.</part-num-ref>
+ The server <part-num-ref name="server">106</part-num-ref>
+ may set logic for the interaction between the client <part-num-ref name="client">102</part-num-ref>
+ and the server <part-num-ref name="server">106,</part-num-ref>
+ such as to obtain or set new <boundary-data type="line-number">15   </boundary-data>
+parameters for the local rules. The client <part-num-ref name="client">102</part-num-ref>
+ may proactively interact with the server <part-num-ref name="server">106</part-num-ref>
+ utilizing the communication path <part-num-ref name="communication path">104.</part-num-ref>
+ For illustrative purposes, the server <part-num-ref name="server">106</part-num-ref>
+ is shown as multiple units in a single location, although it is understood that the number of units of the server <part-num-ref name="server">106</part-num-ref>
+ and the locations of the server <part-num-ref name="server">106</part-num-ref>
+ may be distributed, as well.    </p>
+    <p id="p-31" num="31">[0015<confidence value="5">]</confidence>
+ Similarly, a distribution of the client <part-num-ref name="client">102</part-num-ref>
+ may proactively initiate transmission of <boundary-data type="line-number">20   </boundary-data>
+real-time relevant information sampled or created by the distribution of the client <part-num-ref name="client">102,</part-num-ref>
+ or may transmit stored relevant information from off-line operation of the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ where no server access is available. The server <part-num-ref name="server">106</part-num-ref>
+ or the distribution of the server <part-num-ref name="server">106</part-num-ref>
+ may control, update, and optimize the interaction with the distribution of the <boundary-data type="header">CONFIDENTIAL                          9                              TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+client <part-num-ref name="client">102.</part-num-ref>
+ For illustrative purposes, the server <part-num-ref name="server">106</part-num-ref>
+ or the distribution of the server <part-num-ref name="server">106</part-num-ref>
+ may interact with the client <part-num-ref name="client">102</part-num-ref>
+ or a distribution of the client <part-num-ref name="client">102,</part-num-ref>
+ although it is understood that a portion of the distribution of the server <part-num-ref name="server">106</part-num-ref>
+ and the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ may interact, as well. Also for illustrative purposes, the distribution of the <boundary-data type="line-number">5   </boundary-data>
+server <part-num-ref name="server">106</part-num-ref>
+ and the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ are shown to interact, although it is understood that a different or intersecting set of distribution of the server <part-num-ref name="server">106</part-num-ref>
+ and the client <part-num-ref name="client">102</part-num-ref>
+ may also interact, as well.    </p>
+    <p id="p-32" num="32">[0016] The server <part-num-ref name="server">106</part-num-ref>
+ may intelligently estimate possible travel directions of the client <part-num-ref name="client">102</part-num-ref>
+ and update the client <part-num-ref name="client">102</part-num-ref>
+ with predetermined relevant information when the client <boundary-data type="line-number">10   </boundary-data>
+      <part-num-ref name="client">102</part-num-ref>
+ may enter a no server access region or time, such as an area with no wireless network service. The server <part-num-ref name="server">106</part-num-ref>
+ may select a region, such as a particular geographic region, or a region surrounding the client <part-num-ref name="client">102,</part-num-ref>
+ to sample and analyze the real-time relevant information from the client <part-num-ref name="client">102</part-num-ref>
+ in a service area. The server <part-num-ref name="server">106</part-num-ref>
+ may utilize sampled relevant information from the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ in surrounding service areas <boundary-data type="line-number">15   </boundary-data>
+of the no-service area improving the accuracy of the relevant information provided to the client <part-num-ref name="client">102.</part-num-ref>
+ The server <part-num-ref name="server">106</part-num-ref>
+ may reconcile outlier samples from the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ or to extrapolate relevant information in the no service area. The server <part-num-ref name="server">106</part-num-ref>
+ may intelligently increase the update rate or update on events, such as changing weather or traffic conditions, to the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ improving relevant information <boundary-data type="line-number">20   </boundary-data>
+accuracy.    </p>
+    <p id="p-33" num="33">[0017] For illustrative purposes, the server <part-num-ref name="server">106</part-num-ref>
+ is described as intelligently increasing update rate or update on event, although it is understood that the server <part-num-ref name="server">106</part-num-ref>
+ may provide other forms of controls and interactions to the distribution of the client <part-num-ref name="client">102,</part-num-ref>
+ as well. Also <boundary-data type="header">CONFI<confidence value="8">D</confidence>
+ENTIAL                          10                             TELV-P<confidence value="565">010</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+for illustrative purposes, the interaction of the server <part-num-ref name="server">106</part-num-ref>
+ is described as between the server <part-num-ref name="server">106</part-num-ref>
+ and the distribution of the client <part-num-ref name="client">102,</part-num-ref>
+ although it is understood the interaction may be to other elements of the intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100,</part-num-ref>
+ such as to another of the server <part-num-ref name="server">106</part-num-ref>
+ of the distribution of the server <part-num-ref name="server">106.</part-num-ref>
+    </p>
+    <p id="p-34" num="34">
+      <boundary-data type="line-number">5   </boundary-data>
+[0018<confidence value="5">]</confidence>
+ The client <part-num-ref name="client">102,</part-num-ref>
+ having location based service capability, interacts with a navigation system, such as a Global Positioning System, of the communication path <part-num-ref name="communication path">104</part-num-ref>
+ for navigation information. The location based service may also include other information to assist the user of the client <part-num-ref name="client">102,</part-num-ref>
+ such as local businesses and locations, traffic conditions, or other points of interest, which may adjust the travel route provided <boundary-data type="line-number">10   </boundary-data>
+by the navigation system.    </p>
+    <p id="p-35" num="35">[0019<confidence value="5">]</confidence>
+ The client <part-num-ref name="client">102</part-num-ref>
+ comprises a control device (not shown), such as a microprocessor, software (not shown), a memory <part-num-ref name="memory">108,</part-num-ref>
+ cellular components (not shown), navigation components (not shown), and a user interface. The user interface, such as a display, a key pad, and a microphone, and a speaker, allows the user to interact with the client <part-num-ref name="client">102.</part-num-ref>
+ The <boundary-data type="line-number">15   </boundary-data>
+microprocessor executes the software and provides the intelligence of the client <part-num-ref name="client">102</part-num-ref>
+ for interaction with the server <part-num-ref name="server">106</part-num-ref>
+ for the relevant information, the user interface, interaction to the cellular system of the communication path <part-num-ref name="communication path">104,</part-num-ref>
+ and interaction to the navigation system of the communication path <part-num-ref name="communication path">104,</part-num-ref>
+ as well as other functions pertinent to a location based service communication device.    </p>
+    <p id="p-36" num="36">
+      <boundary-data type="line-number">20   </boundary-data>
+[0020] The memory <part-num-ref name="memory">108,</part-num-ref>
+ such as volatile, nonvolatile memory, internal only, externally upgradeable, or a combination thereof, may store the software, setup data, and other data for the operation of the client <part-num-ref name="client">102</part-num-ref>
+ as a location based service communication device. The memory <part-num-ref name="memory">108</part-num-ref>
+ may also store the relevant information from the server <part-num-ref name="server">106</part-num-ref>
+ or preloaded, <boundary-data type="header">CONFIDENTIAL                         1<confidence value="2">I</confidence>
+                             TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+such as maps, route information, traf<confidence value="8">f</confidence>
+ic information, and P<confidence value="66">OI</confidence>
+ etc<confidence value="5">,</confidence>
+ and store the sampled or created relevant information to be transmitted to the server <part-num-ref name="server">106.</part-num-ref>
+ For illustrative purpose, the functions of the client <part-num-ref name="client">102</part-num-ref>
+ may be performed by any one in the list of software, firmware, hardware, or any combination thereof<confidence value="5">.</confidence>
+ The cellular components are <boundary-data type="line-number">5   </boundary-data>
+active and passive components, such as microelectronics or an antenna, for interaction to the cellular system of the communication path <part-num-ref name="communication path">104.</part-num-ref>
+ The navigation components are the active and passive components, such as microelectronics or an antenna, for interaction to the navigation system of the communication path <part-num-ref name="communication path">104.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">
+      <confidence value="5">[</confidence>
+0021<confidence value="5">]</confidence>
+ Referring now to FIG. 2, therein is shown a more detailed architectural diagram of <boundary-data type="line-number">10   </boundary-data>
+the communication path <part-num-ref name="communication path">104</part-num-ref>
+ of FIG. 1. The communication path <part-num-ref name="communication path">104</part-num-ref>
+ includes a satellite <part-num-ref name="satellite">202,</part-num-ref>
+ a cellular tower <part-num-ref name="cellular tower">204,</part-num-ref>
+ a gateway <part-num-ref name="gateway">206,</part-num-ref>
+ and a network <part-num-ref name="network">208.</part-num-ref>
+ The satellite <part-num-ref name="satellite">202</part-num-ref>
+ may provide the interaction path for a satellite phone form of the client <part-num-ref name="client">102</part-num-ref>
+ or may be part of the navigation system, such as Global Positioning System, to provide the interaction path for the client <part-num-ref name="client">102</part-num-ref>
+ with location based service capability. The satellite <part-num-ref name="satellite">202</part-num-ref>
+ and the cellular <boundary-data type="line-number">15  </boundary-data>
+tower <part-num-ref name="cellular tower">204</part-num-ref>
+ provide an interaction path between the client <part-num-ref name="client">102</part-num-ref>
+ and the gateway <part-num-ref name="gateway">206.</part-num-ref>
+ The gateway <part-num-ref name="gateway">206</part-num-ref>
+ provides a portal to the network <part-num-ref name="network">208</part-num-ref>
+ and subsequently the distribution of the server <part-num-ref name="server">106.</part-num-ref>
+ The network <part-num-ref name="network">208</part-num-ref>
+ may be wired or wireless communication path and may include a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a storage area network (SAN), and other topological forms of the <boundary-data type="line-number">20   </boundary-data>
+network <part-num-ref name="network">208,</part-num-ref>
+ as required. The network <part-num-ref name="network">208</part-num-ref>
+ is depicted as a cloud of cooperating network topologies and technologies.    </p>
+    <p id="p-38" num="38">
+      <confidence value="5">[</confidence>
+0022<confidence value="5">]</confidence>
+ For illustrative purposes, the satellite <part-num-ref name="satellite">202</part-num-ref>
+ is shown as singular, although it is understood that the number of the satellite <part-num-ref name="satellite">202</part-num-ref>
+ may be more than one, such as a <boundary-data type="header">CONFIDENTIAL                        12                            TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+constellation of the satellite <part-num-ref name="satellite">202</part-num-ref>
+ to form navigation system interaction path, as well. Also for illustrative purposes, the cellular tower <part-num-ref name="cellular tower">204</part-num-ref>
+ is shown as singular, although it is understood that the number of the cellular tower <part-num-ref name="cellular tower">204</part-num-ref>
+ may be more than one, as well.    </p>
+    <p id="p-39" num="39">Further for illustrative purposes, the gateway <part-num-ref name="gateway">206</part-num-ref>
+ is shown as singular, although it is <boundary-data type="line-number">5   </boundary-data>
+understood that the number of the gateway <part-num-ref name="gateway">206</part-num-ref>
+ may be more than one, as well.    </p>
+    <p id="p-40" num="40">[0023<confidence value="5">1</confidence>
+ The interaction of the server <part-num-ref name="server">106</part-num-ref>
+ with the client <part-num-ref name="client">102</part-num-ref>
+ and with different locations of the distribution of the server <part-num-ref name="server">106</part-num-ref>
+ may traverse vast distances employing all of the elements of the communication path <part-num-ref name="communication path">104.</part-num-ref>
+ The interaction may also utilize only a portion of the communication path <part-num-ref name="communication path">104.</part-num-ref>
+ For illustrative purposes, the server <part-num-ref name="server">106</part-num-ref>
+ is shown <boundary-data type="line-number">10   </boundary-data>
+connecting to the network, although it is understood that the server <part-num-ref name="server">106</part-num-ref>
+ may connect to other devices, such as another of the server <part-num-ref name="server">106</part-num-ref>
+ in the same location or storage.    </p>
+    <p id="p-41" num="41">[0024<confidence value="5">1</confidence>
+ Referring now to FIG. 3, therein is shown a diagrammatical view of geographic regions <part-num-ref name="diagrammatical view of geographic regions">300</part-num-ref>
+ having service and no-service. The diagrammatic view depicts an example of the client <part-num-ref name="client">102</part-num-ref>
+ traveling from left to right of the geographic regions <part-num-ref name="geographic regions">300</part-num-ref>
+ with first <boundary-data type="line-number">15   </boundary-data>
+concentric circles <part-num-ref name="with first concentric circles">302</part-num-ref>
+ and second concentric circles <part-num-ref name="and second concentric circles">304</part-num-ref>
+ representing service. The client <part-num-ref name="client">102</part-num-ref>
+ travels from a first service region <part-num-ref name="first service region">306</part-num-ref>
+ then traverses a no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ and re-enters a second service region <part-num-ref name="second service region">310.</part-num-ref>
+ For example, the geographic regions <part-num-ref name="geographic regions">300</part-num-ref>
+ from the first service region <part-num-ref name="first service region">306</part-num-ref>
+ to the second service region <part-num-ref name="second service region">310</part-num-ref>
+ may represent local and geographically adjacent regions or may be separated by large distances, such as from the <boundary-data type="line-number">20   </boundary-data>
+west coast to the east coast of the United States of America. The no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ may be a geographic region with no physical server access, or may be a period when and where the client <part-num-ref name="client">102</part-num-ref>
+ is non-operative or operating in an off-line mode or the server is down <boundary-data type="header">CONFIDENTIAL                        13                            TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+[0025<confidence value="5">]</confidence>
+ The server <part-num-ref name="server">106</part-num-ref>
+ of FIG. <confidence value="5">I</confidence>
+ may provide updates to the client <part-num-ref name="client">102</part-num-ref>
+ traveling across the geographic regions <part-num-ref name="geographic regions">300.</part-num-ref>
+ The updates may be at predetermined intervals, such as distance, or time, or may be event driven, such as traffic or weather condition changes.    </p>
+    <p id="p-42" num="42">The server 106 may intelligently provide updates based on estimated travel path of the <boundary-data type="line-number">5   </boundary-data>
+client <part-num-ref name="client">102</part-num-ref>
+ that may enter the no server access region <part-num-ref name="no server access region">308.</part-num-ref>
+ The server <part-num-ref name="server">106</part-num-ref>
+ may also intelligently update the client <part-num-ref name="client">102</part-num-ref>
+ based on analyzed relevant information of the first service region <part-num-ref name="first service region">306</part-num-ref>
+ and the second service region <part-num-ref name="second service region">310,</part-num-ref>
+ such as unexpected changes between the first service region <part-num-ref name="first service region">306</part-num-ref>
+ and the second service region <part-num-ref name="second service region">310.</part-num-ref>
+ The updates may be stored in the memory <part-num-ref name="memory">108</part-num-ref>
+ of FIG. 1 of the client <part-num-ref name="client">102</part-num-ref>
+ to be used in the no server access <boundary-data type="line-number">10   </boundary-data>
+region <part-num-ref name="no server access region">308</part-num-ref>
+ or to minimize bandwidth utilization of the communication path <part-num-ref name="communication path">104</part-num-ref>
+ of FIG. 1 in areas with service. For example, if the user deviated from nominal route in the no server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ the client can use local map either uploaded from the server or preloaded in the memory card and/or updated by the server, and/or traffic information, to provide local rerouting, which has been impossible for the thin client navigation system.    </p>
+    <p id="p-43" num="43">
+      <boundary-data type="line-number">15   </boundary-data>
+When the client is in the second region <part-num-ref name="second region">310</part-num-ref>
+ with service, the client will still use the local relevant information as long as they exist on the memory card and up to date. In the case the local relevant information, such as maps, is either not up to date or not available, on the memory card, then the client will request to the server to get the updated relevant navigation information, such as maps, and P<confidence value="66">OI</confidence>
+ information. After each use, the client <boundary-data type="line-number">20   </boundary-data>
+will decide to either accumulate the information on the client or just delete them, based on the logic set by either server or client.    </p>
+    <p id="p-44" num="44">[0027<confidence value="5">]</confidence>
+ For illustrative purpose, the client <part-num-ref name="client">102</part-num-ref>
+ is shown as singular, although it is understood that the client <part-num-ref name="client">102</part-num-ref>
+ may be a distribution of the client <part-num-ref name="client">102.</part-num-ref>
+ Also for illustrative <boundary-data type="header">CONFIDENTIAL                          14                            TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+purpose, the client <part-num-ref name="client">102</part-num-ref>
+ is shown as traveling from left to right across the geographic regions <part-num-ref name="geographic regions">300,</part-num-ref>
+ although the client <part-num-ref name="client">102</part-num-ref>
+ may travel in any direction. Further for illustrative purpose, the server <part-num-ref name="server">106</part-num-ref>
+ may utilize the relevant information from the first service region <part-num-ref name="first service region">306</part-num-ref>
+ and the second service region <part-num-ref name="second service region">310</part-num-ref>
+ to update the client <part-num-ref name="client">102</part-num-ref>
+ prior to entering the no <boundary-data type="line-number">5   </boundary-data>
+server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ although it is understood that the server <part-num-ref name="server">106</part-num-ref>
+ may utilize other relevant information other than from the first service region <part-num-ref name="first service region">306</part-num-ref>
+ or the second service region <part-num-ref name="second service region">310</part-num-ref>
+ providing appropriate updates to the client <part-num-ref name="client">102.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may subsequently transmit the sampled, stored, or relevant information created during the no server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ such as in a geographic region with service, when the client <part-num-ref name="client">102</part-num-ref>
+ <boundary-data type="line-number">10   </boundary-data>
+is operative, or when the client <part-num-ref name="client">102</part-num-ref>
+ proactively operates in an on-line mode in the second region <part-num-ref name="second region">310.</part-num-ref>
+    </p>
+    <p id="p-45" num="45">[0027<confidence value="5">1</confidence>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may proactively request for updates from the server <part-num-ref name="server">106</part-num-ref>
+ or sync with the information at the server <part-num-ref name="server">106,</part-num-ref>
+ based on rules defined at client. The rules or part of the rules can be updated from server as well. For example, the client <part-num-ref name="client">102</part-num-ref>
+ may have <boundary-data type="line-number">15   </boundary-data>
+relevant information indicating possible non-operative periods, such as air travel requiring the client <part-num-ref name="client">102</part-num-ref>
+ to be turned off<confidence value="5">.</confidence>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may intelligently track non- operative events or time and request updates as appropriate or as needed. The non- operative times or events may not be prescheduled and the client <part-num-ref name="client">102</part-num-ref>
+ may request updates from the server <part-num-ref name="server">106</part-num-ref>
+ when the client <part-num-ref name="client">102</part-num-ref>
+ is turned back on. The client <part-num-ref name="client">102</part-num-ref>
+ may <boundary-data type="line-number">20   </boundary-data>
+also proactively request for updates from the server <part-num-ref name="server">106</part-num-ref>
+ determined by the usefulness of the relevant information in the client <part-num-ref name="client">102,</part-num-ref>
+ such as age of the information, different geographic locations, or updating selected relevant information based on priority rules that may be included in the client <part-num-ref name="client">102.</part-num-ref>
+ The relevant information updates in the client <part-num-ref name="client">102</part-num-ref>
+ <boundary-data type="header">CONFIDENTIAL                          15                             TELV-P<confidence value="566">O10</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+may override, replace, or add to the existing relevant information in the client <part-num-ref name="client">102.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may also request for more information from the server <part-num-ref name="server">106,</part-num-ref>
+ if the user upgrade its memory card for the client <part-num-ref name="client">102</part-num-ref>
+ from a smaller to a larger memory size.    </p>
+    <p id="p-46" num="46">[0028] Referring now to FIG. 4, therein is a more detailed diagrammatical view of the <boundary-data type="line-number">5   </boundary-data>
+geographic regions <part-num-ref name="geographic regions">300</part-num-ref>
+ of FIG. 3 with the relevant information stored on the distribution of the client <part-num-ref name="client">102.</part-num-ref>
+ The more detailed diagrammatic view depicts the geographic regions <part-num-ref name="geographic regions">300</part-num-ref>
+ as an aerial representation of a roadway segment <part-num-ref name="roadway segment">402</part-num-ref>
+ with a distribution of the client <part-num-ref name="client">102</part-num-ref>
+ traveling generally from left to right across the first service region <part-num-ref name="first service region">306,</part-num-ref>
+ the no server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ and the second service region <part-num-ref name="second service region">310.</part-num-ref>
+ The no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ <boundary-data type="line-number">10   </boundary-data>
+has an exit <part-num-ref name="exit">404</part-num-ref>
+ leading to various points of interest <part-num-ref name="leading to various points of interest">406,</part-num-ref>
+ such as gas station, restaurants, or hotels.    </p>
+    <p id="p-47" num="47">
+      <confidence value="5">[</confidence>
+0029] The server <part-num-ref name="server">106</part-num-ref>
+ of FIG. 1 may update the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ in the predetermined interval or as a result of analysis of the travel paths of the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ traveling towards the no server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ or as a result of the <boundary-data type="line-number">15   </boundary-data>
+content change from the server <part-num-ref name="server">106,</part-num-ref>
+ such as new map data update, or traffic condition change due to special event such as big sport event The client <part-num-ref name="client">102</part-num-ref>
+ may request updates to the points of interest <part-num-ref name="points of interest">406.</part-num-ref>
+    </p>
+    <p id="p-48" num="48">[0030] The server <part-num-ref name="server">106</part-num-ref>
+ may analyze the relevant information from the first service region <part-num-ref name="first service region">306,</part-num-ref>
+ the second service region <part-num-ref name="second service region">310,</part-num-ref>
+ and other sources determining no significant change <boundary-data type="line-number">20   </boundary-data>
+in traffic flow across the geographic regions <part-num-ref name="geographic regions">300</part-num-ref>
+ such that the server <part-num-ref name="server">106</part-num-ref>
+ may not update relevant information to the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ to optimize the interaction between the server <part-num-ref name="server">106</part-num-ref>
+ and the distribution of the client <part-num-ref name="client">102.</part-num-ref>
+ The travel routes, estimated times, and other relevant information for the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ traveling <boundary-data type="header">CONFIDENTIAL                          16                             TELV-<confidence value="5588">P010</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+through the no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ should be accurate and stored in the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ or a portion of the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ that may store the relevant information. The memory <part-num-ref name="memory">108</part-num-ref>
+ of FIG. <confidence value="4">1</confidence>
+ of the client <part-num-ref name="client">102</part-num-ref>
+ provides the user the location based services information and navigation information for the no server access <boundary-data type="line-number">5   </boundary-data>
+region <part-num-ref name="no server access region">308.</part-num-ref>
+ The information should be as sufficient as possible to conduct all core navigation services, such as automatic deviation correction, and general P<confidence value="66">OI</confidence>
+ or personalized P<confidence value="66">OI</confidence>
+ search.    </p>
+    <p id="p-49" num="49">[0031<confidence value="5">1</confidence>
+ Alternatively, as an example, the client <part-num-ref name="client">102</part-num-ref>
+ may obtain updates in the no server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ such as access to a wired service, electrical or optical, such as a wired <boundary-data type="line-number">10   </boundary-data>
+broadband service. For example, the client <part-num-ref name="client">102</part-num-ref>
+ may take the exit <part-num-ref name="exit">404</part-num-ref>
+ and stop by one of the points of interest <part-num-ref name="points of interest">406</part-num-ref>
+ having wired service access. The client <part-num-ref name="client">102</part-num-ref>
+ may obtain updates at or near the points of interest <part-num-ref name="points of interest">406</part-num-ref>
+ by direct connect to a wired service terminal (not shown), such as a personal computer, or wireless if the wired service is connected to a wireless service, such as wireless local area network (WLAN) or Wi-Fi. These updates <boundary-data type="line-number">15   </boundary-data>
+may modify to the relevant information in the other regions outside of the no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ affecting travel routes, estimated times, or the distance to the next availability of the points of interest <part-num-ref name="points of interest">406.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may utilize a wired service in the no server access region <part-num-ref name="no server access region">308</part-num-ref>
+ to provide updates to the server <part-num-ref name="server">106</part-num-ref>
+ as well, such as review of the local restaurants.    </p>
+    <p id="p-50" num="50">
+      <boundary-data type="line-number">20   </boundary-data>
+[0032<confidence value="5">1</confidence>
+ For illustrative purpose, the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ is shown traveling in a unidirection from left to right on the roadway segment <part-num-ref name="roadway segment">402,</part-num-ref>
+ although it is understood that the distribution of the client <part-num-ref name="client">102</part-num-ref>
+ may travel in any number of direction. Also for illustrative purpose, the exit <part-num-ref name="exit">404</part-num-ref>
+ is shown leading to the points of interest <part-num-ref name="points of interest">406</part-num-ref>
+ in the no <boundary-data type="header">CONFIDENTIAL                          17                             TELV-P<confidence value="566">O10</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+server access region <part-num-ref name="no server access region">308,</part-num-ref>
+ although it is understood the exit <part-num-ref name="exit">404</part-num-ref>
+ may lead to an area with service. The user can also exit through <part-num-ref name="user can also exit through">404</part-num-ref>
+ by mistake and hence deviate from the nominal route.    </p>
+    <p id="p-51" num="51">[0033<confidence value="5">]</confidence>
+ Referring now to FIG. 5, therein is shown a flow chart for a processing flow <part-num-ref name="processing flow">500</part-num-ref>
+ <boundary-data type="line-number">5   </boundary-data>
+in the server and client of the relevant information. The intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ may update the client with relevant information in a number of different ways. A server initiated update <part-num-ref name="server initiated update">502</part-num-ref>
+ may invoke updates of the relevant information to the client <part-num-ref name="client">102</part-num-ref>
+ by a periodic time or distance interval for the client <part-num-ref name="client">102</part-num-ref>
+ predetermined by the server <part-num-ref name="server">106</part-num-ref>
+ or may be updated based on events, such as changes <boundary-data type="line-number">10   </boundary-data>
+to weather conditions or traffic flow, causing changes to the relevant information or when the information on the server get updated from its sources, such as map vendors or P<confidence value="66">OI</confidence>
+ vendors or from other user feedbacks. A client initiated update <part-num-ref name="client initiated update">504</part-num-ref>
+ may invoke updates of the relevant information when the client <part-num-ref name="client">102</part-num-ref>
+ requests the server <part-num-ref name="server">106</part-num-ref>
+ for updates of the relevant information, for example when the client get service request from the users, but <boundary-data type="line-number">15   </boundary-data>
+the relevant information is not available on the client, or when the client decide that the data on the client is obsolete already [0034<confidence value="5">1</confidence>
+ Both the server initiated update <part-num-ref name="server initiated update">502</part-num-ref>
+ and the client initiated update <part-num-ref name="client initiated update">504</part-num-ref>
+ are processed by the server <part-num-ref name="server">106</part-num-ref>
+ in a server relevant information processing <part-num-ref name="server relevant information processing">506</part-num-ref>
+ utilizing the predetermined functions, such as a server route engine 506-2, map data content <boundary-data type="line-number">20   </boundary-data>
+management module 506-10, a server traffic processing 506-4, a server weather processing 506-6, or a server location based services (LBS) processing 506-8. The server <part-num-ref name="server">106</part-num-ref>
+ may utilize various feeds, such as weather, traffic, or location based services database or wireless service coverage map, and to analyze the relevant information that <boundary-data type="header">CONFIDENTIA<confidence value="8">L</confidence>
+                          18                             TELV-P<confidence value="566">O10</confidence>
+      </boundary-data>
+      <page-break num="19"/>
+needs to be updated and/or the aging information of the information on the client to optimize the interaction between the server <part-num-ref name="server">106</part-num-ref>
+ and the client <part-num-ref name="client">102.</part-num-ref>
+    </p>
+    <p id="p-52" num="52">[0035<confidence value="5">1</confidence>
+ The server relevant information processing <part-num-ref name="server relevant information processing">506</part-num-ref>
+ provides the appropriate relevant information to a server send update <part-num-ref name="server send update">508</part-num-ref>
+ for transmission to the client <part-num-ref name="client">102.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ <boundary-data type="line-number">5   </boundary-data>
+receives the relevant information updates with a client update receive <part-num-ref name="client update receive">510.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ determines whether to store the information in the memory <part-num-ref name="memory">108</part-num-ref>
+ of FIG. <confidence value="5">1</confidence>
+ or update appropriate subset of the relevant information for the user of the client <part-num-ref name="client">102,</part-num-ref>
+ such as updating the local map data content, or the display on travel routes or estimated travel times. A client off-line or on-line operation <part-num-ref name="client off-line or on-line operation">512</part-num-ref>
+ determines if the client <part-num-ref name="client">102</part-num-ref>
+ will operate <boundary-data type="line-number">10   </boundary-data>
+off-line with the stored relevant information to optimize interaction with the server <part-num-ref name="server">106</part-num-ref>
+ or in areas without service, or if the client <part-num-ref name="client">102</part-num-ref>
+ will operate on-line for maximum update or if the memory <part-num-ref name="memory">108</part-num-ref>
+ does not have sufficient space or the service requires to access real time information from the server.    </p>
+    <p id="p-53" num="53">[0036<confidence value="5">]</confidence>
+ The server send update <part-num-ref name="server send update">508</part-num-ref>
+ is not isolated to provide updates directly to the client <boundary-data type="line-number">15   </boundary-data>
+      <part-num-ref name="client">102.</part-num-ref>
+ The server <part-num-ref name="server">106</part-num-ref>
+ may provide updates to other destinations, such as the wired terminals or other feeds, for the client <part-num-ref name="client">102</part-num-ref>
+ to direct connect and update in areas of no service, to optimize the interaction to the server <part-num-ref name="server">106,</part-num-ref>
+ or to store vast amount of the relevant information on a number of the memory <part-num-ref name="memory">108.</part-num-ref>
+    </p>
+    <p id="p-54" num="54">[0037<confidence value="5">1</confidence>
+ The intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ may be <boundary-data type="line-number">20   </boundary-data>
+executed with circuitry, software, or combination thereof<confidence value="5">.</confidence>
+ The processing flow <part-num-ref name="processing flow">500</part-num-ref>
+ may be executed with circuitry, software, or combination thereof<confidence value="5">.</confidence>
+    </p>
+    <p id="p-55" num="55">[0038<confidence value="5">1</confidence>
+ It has been discovered that the intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">100</part-num-ref>
+ provides flexible, user friendly, high performance, expansive, and <boundary-data type="header">CONFIDENTIAL                          19                             TELV-P<confidence value="488">010</confidence>
+      </boundary-data>
+      <page-break num="20"/>
+robust real-time or on-line as well as off-line relevant information to location based services enabled devices that have not been previously achieved. The server <part-num-ref name="server">106</part-num-ref>
+ may intelligently provide updates to the client <part-num-ref name="client">102</part-num-ref>
+ based on predetermined intervals, event driven, or based on analysis by the server <part-num-ref name="server">106,</part-num-ref>
+ such as travel routes leading the client <part-num-ref name="client">102</part-num-ref>
+ <boundary-data type="line-number">5   </boundary-data>
+to areas with no-service or map information updates from its vendor. The client <part-num-ref name="client">102</part-num-ref>
+ may intelligently request updates from the server <part-num-ref name="server">106</part-num-ref>
+ as desired, receive the updates, or provide updates as well. The client <part-num-ref name="client">102</part-num-ref>
+ may elect to operate off-line or on-line in areas with services to optimize interaction with the server <part-num-ref name="server">106.</part-num-ref>
+ The client <part-num-ref name="client">102</part-num-ref>
+ may utilize extended storage of the memory <part-num-ref name="memory">108</part-num-ref>
+ accessing vast amounts of relevant information as <boundary-data type="line-number">10   </boundary-data>
+desired.    </p>
+    <p id="p-56" num="56">
+      <confidence value="5">[</confidence>
+0039<confidence value="5">1</confidence>
+ Referring now to FIG. 6, therein is shown flow chart of an intelligent location based services and navigation hybrid system <part-num-ref name="intelligent location based services and navigation hybrid system">600</part-num-ref>
+ for manufacturing the intelligent location based services and navigation hybrid system in an embodiment of the present invention. The system <part-num-ref name="system">600</part-num-ref>
+ comprising a client having location based service capability <boundary-data type="line-number">15   </boundary-data>
+and a server includes setting a condition for updates of a relevant information by the server in a block 602; selecting the relevant information for the updates by the server in a block 604; transmitting the relevant information from the server in a block 606; receiving the updates of the relevant information by the client in a block 608; and selecting an operational mode by the client in a block <part-num-ref name="block">610.</part-num-ref>
+    </p>
+    <p id="p-57" num="57">
+      <boundary-data type="line-number">20   </boundary-data>
+      <confidence value="5">[</confidence>
+0040<confidence value="5">1</confidence>
+ While the invention has been described in conjunction with a specific best mode, it is to be understood that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the above description. Accordingly, it is intended to embrace all such alternatives, modifications, and variations, which fall within <boundary-data type="header">CONFIDENTIAL                         20                             TELV-P<confidence value="5">O</confidence>
+ <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="21"/>
+the scope of the included claims. All matters set forth herein or shown in the accompanying drawings are to be interpreted in an illustrative and non-limiting sense.    </p>
+    <boundary-data type="header">CONFIDENTIAL                        21                            TELV-P<confidence value="6">O</confidence>
+ <confidence value="88">10</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11342606.xml

@@ -0,0 +1,35 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11342606</doc-number>
+        <date>2009-07-29</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Application No. 11/342,606                                           MS 314753.01/MFCP.125996 File Date 01/31/2006 Reply to Office Action of 04/29/2009 Response Filed: 7/29/2009 </p>
+    <heading id="h-1">AMENDMENTS TO THE SPECIFICATION</heading>
+    <p id="p-2" num="2">The "Cross-Reference to Related Application" and "Statement Regarding Federally Sponsored Research or Development" and associated paragraphs [0001] and [0002] are deleted as follows:</p>
+    <heading id="h-2">CROSS REFERENCE TO RELATED <confidence value="2222222222">APPLICATIO</confidence>
+    </heading>
+    <p id="p-3" num="3">
+      <confidence value="222225">[[99-1</confidence>
+       <confidence value="8425">Net-</confidence>
+app<confidence value="44">he</confidence>
+abl<confidence value="52">e-</confidence>
+     </p>
+    <heading id="h-3">STATEMENT <confidence value="222222222">RECARDINC</confidence>
+ FEDER<confidence value="6">A</confidence>
+LLY SPONSORED <confidence value="2222222222">RESEARCHOR</confidence>
+    </heading>
+    <heading id="h-4">DEVELOPMENT</heading>
+    <p id="p-4" num="4">[0002<confidence value="2">]</confidence>
+        Not applicable 3508195 v2 Page <part-num-ref name="v2 Page">2</part-num-ref>
+ of <part-num-ref name="of">18</part-num-ref>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11354360.xml

@@ -0,0 +1 @@
+<?xml version="1.0" encoding="utf-8"?><pat:SpecificationDocument xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:pat="urn:us:gov:doc:uspto:patent" xmlns:ent="urn:us:gov:doc:uspto:enterprise" xmlns="urn:us:gov:doc:uspto:patent" xmlns:tbl="http://www.oasis-open.org/tables/exchange/1.0" xmlns:com="http://www.wipo.int/standards/XMLSchema/Common/1" xsi:schemaLocation="urn:us:gov:doc:uspto:patent XML_SCHEMAS/V1_3/SpecificationDocument_1_0.xsd" pat:instanceFileName="11354360.07-29-2014.HY9ZGJOWPXXIFW2.SPEC.XML" pat:id="HY9ZGJOWPXXIFW2"><pat:DocumentCode>SPEC</pat:DocumentCode><pat:DocumentHeaderDetails pat:id="ID-00001"><pat:ApplicationHeaderDetails><pat:ApplicationNumber>11354360</pat:ApplicationNumber></pat:ApplicationHeaderDetails><pat:PageTotalQuantity>1</pat:PageTotalQuantity><pat:ParagraphTotalQuantity>4</pat:ParagraphTotalQuantity></pat:DocumentHeaderDetails><pat:MailRoomDate>2014-07-29</pat:MailRoomDate><pat:DocumentCreateDateText>2014-08-01</pat:DocumentCreateDateText><pat:DocumentTitle>SPECIFICATION DOCUMENT</pat:DocumentTitle><pat:Specification><?PageStart number='1'?><pat:P pat:pNumber="1" pat:id="p-1"><pat:BoundaryData><pat:HeaderText>Application No.: 11/354,360</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Filed: 2/15/2006</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Attorney Docket No.: RSW920060014US1 (7161-235U)</pat:HeaderText></pat:BoundaryData></pat:P><pat:Heading pat:id="h-1">AMENDMENTS TO THE SPECIFICATION</pat:Heading><pat:P pat:pNumber="2" pat:id="p-2">Please amend paragraph [0005] of Applicants' originally filed specification as follows: </pat:P><pat:P pat:pNumber="3" pat:id="p-3">[0005]   In particular, Internet security protocol implementations generally can be quite complicated to configure. The complexity in configuring an Internet security protocol implementation can arise from the number of protocol options available for configuration, as well as the number of permitted configuration topologies. In many cases, not only must data endpoints be defined, but also security endpoints must be defined. To that end, different security modes can be selected including tunnel mode and transport mode in the case of IPSec. Yet further, in an IPSec security protocol framework, security protocol implementations including authentication header (AH), encapsulated security payload (ESP) and Internet key exchange (IKE) require the definition of filter rules to permit IPSec traffic. </pat:P><pat:P pat:pNumber="4" pat:id="p-4"><pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber='8'>3</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData></pat:P></pat:Specification></pat:SpecificationDocument>

applicant/11360319.xml

@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11360319</doc-number>
+        <date>2008-01-08</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">IN THE SPECIFICATION:</heading>
+    <p id="p-1" num="1">Please amend paragraphs [004], [005], [006], [0046] and [0070] of the specification as shown below, in which deletions are indicated with strikethrough and/or double brackets, and added terms are indicated with underscoring.</p>
+    <p id="p-2" num="2">[004] Accordingly, the hydraulic pressure regulated by the pressure governing valve can provide a large brake force with a small footing-force on a brake pedal. In the conventional hydraulic brake, regenerative cooperative control switching valves are used when performing regenerative cooperative control, and the wheel cylinders communicate [[s]] with the pressure governing valve or [[to]] with a reservoir so as to regulate the hydraulic pressure in the wheel cylinders at an appropriate pressure.</p>
+    <p id="p-3" num="3">[005] However, in the hydraulic brake device as disclosed in JP-A-2002-264795, the hydraulic pressure output from the pressure governing valve to the auxiliary hydraulic pressure chamber decreases below a predetermined range when performing a brake action, if such a trouble occurs that a foreign substance clogged in a hydraulic pressure path on the output side of the pressure governing valve. This hinders the hydraulic pressure from being outputted in an amount corresponding to the pedal stroke amount.</p>
+    <p id="p-4" num="4">Consequently, in the event of such trouble, a sufficient hydraulic pressure cannot be output from the pressure governing valve to the master cylinder side.</p>
+    <p id="p-5" num="5">[006] There may also occur another trouble that a valve spool pushed into the output hydraulic pressure chamber against force of springs, by actuating the brake pedal, does not return properly even after easing the pedal because the spring is caught on the <confidence value="22222222222222">cireumnistaia4</confidence>
+ circumferential surface of the output hydraulic pressure chamber. This <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+prevents providing an output hydraulic pressure corresponding to the brake pedal stroke amount. Consequently, a properly reduced output hydraulic pressure to be output to the master cylinder side cannot be provided.    </p>
+    <p id="p-6" num="6">[0045] The hydraulic pressure source <part-num-ref name="hydraulic pressure source">10</part-num-ref>
+ generates working fluid for wheel braking at a predetermined hydraulic pressure. Specifically, the hydraulic pressure source <part-num-ref name="hydraulic pressure source">10</part-num-ref>
+ comprises an accumulator <confidence value="66">10</confidence>
+a, a pressure senor <confidence value="45">lO</confidence>
+b, a DC motor <confidence value="45">lO</confidence>
+c, a hydraulic pressure pump <confidence value="45">lO</confidence>
+d and a reservoir <confidence value="65">10</confidence>
+e. The accumulator <confidence value="42">I0</confidence>
+a accumulates and maintains the working fluid at a predetermined pressure. The pressure sensor <confidence value="45">lO</confidence>
+b (also referred to as a "first hydraulic pressure sensor") detects a hydraulic pressure P1 of the working fluid accumulated in the accumulator <confidence value="6688">10a.</confidence>
+    </p>
+    <p id="p-7" num="7">[0046] The reservoir <confidence value="42">I0</confidence>
+e reserves the working fluid at the atmospheric pressure. The DC motor <confidence value="65">10</confidence>
+c drives and stops in accordance with an instruction from the ECU <part-num-ref name="ECU">80.</part-num-ref>
+    </p>
+    <p id="p-8" num="8">When the DC motor <part-num-ref name="DC motor">
+        <confidence value="5">1</confidence>
+      </part-num-ref>
+ <confidence value="6">O</confidence>
+c drives, the working fluid is supplied to the accumulator <part-num-ref name="accumulator">
+        <confidence value="52">10</confidence>
+      </part-num-ref>
+ a by the hydraulic pressure pump <confidence value="65">10</confidence>
+d. The ECU <part-num-ref name="ECU">80</part-num-ref>
+ sends the instruction, depending on a detected value from the pressure sensor <confidence value="4588">lOb.</confidence>
+    </p>
+    <p id="p-9" num="9">[0070]    Then, based on the information on pressure input from the pressure sensor <part-num-ref name="pressure sensor">32,</part-num-ref>
+ the ECU <part-num-ref name="ECU">80</part-num-ref>
+ controls <confidence value="2222222222">open/close</confidence>
+ operations of the electromagnetic valve <part-num-ref name="electromagnetic valve">34,</part-num-ref>
+ so as to output into the auxiliary hydraulic pressure chamber <part-num-ref name="auxiliary hydraulic pressure chamber">61</part-num-ref>
+ a pressure equal to the current reference output hydraulic pressure value depending on the information on the stroke amount of the brake pedal <part-num-ref name="brake pedal">30,</part-num-ref>
+ which is input from the stroke sensor <part-num-ref name="stroke sensor">51</part-num-ref>
+ based on the information on pressure input from the pressure sensor <part-num-ref name="pressure sensor">32</part-num-ref>
+ [[41]].    </p>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11420020.xml

@@ -0,0 +1,393 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11420020</doc-number>
+        <date>2006-05-24</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">
+      <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                      - 1 -                          U.S. Patent    </boundary-data>
+    <p id="p-1" num="1">Customizable User Interface Wrappers for Web Applications </p>
+    <heading id="h-1">BACKGROUND</heading>
+    <p id="p-2" num="2">Field <confidence value="5">[</confidence>
+0001<confidence value="5">]</confidence>
+       The present embodiments relate generally to computer applications, and more specifically to methods and systems for developing web applications for computers.    </p>
+    <p id="p-3" num="3">Background <confidence value="5">[</confidence>
+0002<confidence value="5">]</confidence>
+       A great deal of cost and effort goes into the development of new computer applications. Much of this effort is spent in writing and debugging computer code to give the software application the desired look and feel, controls and customized features. When new web applications are being developed they must have the ability to operate in conjunction with a conventional browser in order to traverse the Internet and read hypertext files. Conventional external browsers include, for example, Internet Explorer, Netscape Navigator, Firefox, Opera, Safari, Lynx, or the like.    </p>
+    <p id="p-4" num="4">
+      <confidence value="5">[</confidence>
+0003<confidence value="5">]</confidence>
+       One problem with using a conventional external browser in conjunction with a web application is that conventional browsers are typically not controllable or customizable within the particular platform being used to develop the web application to gain access the Internet. When a conventional browser is used in the development of a web application, the controls, functions and skin of the browser can be seen when the newly created web application product is launched. This is a drawback for web application developers, along with a lack of flexibility to customize conventional external browsers.    </p>
+    <p id="p-5" num="5">
+      <confidence value="5">[</confidence>
+0004<confidence value="5">]</confidence>
+       What is needed is to provision the ability to extend existing web applications and present them within the development platform, without the need for an external browser or construction of coded plug-in method infrastructure. This would allow for some level of customization by the web application provider.    </p>
+    <heading id="h-2">SUMMARY</heading>
+    <p id="p-6" num="6">
+      <confidence value="5">[</confidence>
+0005<confidence value="5">]</confidence>
+       Embodiments disclosed herein address the above stated needs by providing systems and methods for creating customizable user interface wrappers for a web application, <page-break num="2"/>
+      <boundary-data type="header">AUS920050565US1                      -<confidence value="8">2</confidence>
+ -                           U.S. Patent      </boundary-data>
+including creating a declarative description of the customized user interface and storing it in the memory of a computer, accessing the declarative description to generate the user interface wrapper; and then enabling the web application to operate using the user interface wrapper.    </p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0006<confidence value="5">]</confidence>
+       In at least one exemplary embodiment the declarative description is stored in an XML file in order to provide attributes for operating the web application. The XML file may be implemented as an extension listed in an extension directory of a plug-in. The attributes may be tailored to run the web application on a given platform, such as an operating system implemented on a predefined type of computer.    </p>
+    <heading id="h-3">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-8" num="8">
+      <confidence value="5">[</confidence>
+0007<confidence value="5">]</confidence>
+       The accompanying drawings, which are incorporated in and constitute part of the specification, illustrate various embodiments of the invention. Together with the general description, the drawings serve to explain the principles of the invention. In the drawings:    </p>
+    <p id="p-9" num="9">
+      <confidence value="5">[</confidence>
+0008<confidence value="5">]</confidence>
+       FIG. 1 depicts a software development platform architecture for implementing the various embodiments;    </p>
+    <p id="p-10" num="10">
+      <confidence value="5">[</confidence>
+0009<confidence value="5">]</confidence>
+       FIG. 2A depicts an exemplary plug-in embodied in Java;    </p>
+    <p id="p-11" num="11">
+      <confidence value="5">[</confidence>
+0010<confidence value="5">]</confidence>
+       FIG. 2<confidence value="5">B</confidence>
+ depicts an exemplary file structure of a plug-in containing two files;    </p>
+    <p id="p-12" num="12">
+      <confidence value="5">[</confidence>
+0011<confidence value="5">]</confidence>
+       FIG. 3 depicts a method of wrappering a web application according to various embodiments; and <confidence value="5">[</confidence>
+0012<confidence value="5">]</confidence>
+       FIG. 4 depicts an exemplary hardware environment for implementing the various embodiments.    </p>
+    <heading id="h-4">DETAILED DESCRIPTION</heading>
+    <p id="p-13" num="13">
+      <confidence value="5">[</confidence>
+0013<confidence value="5">]</confidence>
+       The following description of the various exemplary embodiments is illustrative in nature and is not intended to limit the invention, its application, or uses.    </p>
+    <p id="p-14" num="14">
+      <confidence value="5">[</confidence>
+0014<confidence value="5">]</confidence>
+       Various embodiments may be implemented in a software development platform with a plug-in architecture. Eclipse is one software development platform which may be used. Wrappering a web application allows the software developer (or programmer) to modify the web application to run on one or more software platforms. A web application is <page-break num="3"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                      -<confidence value="8">3</confidence>
+-                            U.S. Patent      </boundary-data>
+a software application or routine that submits data, for example, in response to a user action or input, over a network and gets a response. In accordance with some embodiments, a web application may be distinguished from a standard application by the number of views in the perspective. A perspective is what is being displayed at a given time on the screen of a computer with a graphical user interface (GUI) based operating system (OS). A perspective may include a number of different overlapping panes (or windows) from different applications. A view is a single pane. Standard applications may have multiple views displayed simultaneously on a computer screen. However, in some embodiments, a web application has only one view associated with it, and thus may be distinguished from a standard application by the number of views associated with it. In other embodiments, however, a web application may be associated with more than one view.    </p>
+    <p id="p-15" num="15">
+      <confidence value="5">[</confidence>
+0015<confidence value="5">]</confidence>
+       Typically, web applications do not have natively dependent code. That is, web applications are not generally tied to any particular platform of the many platforms currently available such as the Windows<confidence value="5">®</confidence>
+ Millenium Edition, Windows<confidence value="2">@</confidence>
+ XP, Linux, or the like. As such, however, a conventional web application is not tailored or customized for different platforms, or for any platform in particular. As part of wrappering the web application, declarative properties are added and the web application is repackaged. This allows the web application to run in a desired manner on a given platform, giving the wrappered web application a custom control or canvas for that platform. Further, the wrappered web application may include a user interface (UI) tailored to an operating system implemented on a predefined type of computer, e.g., a desktop computer, a laptop, a server, a personal digital assistant (PDA), or other like type of computer or information handling device.    </p>
+    <p id="p-16" num="16">
+      <confidence value="5">[</confidence>
+0016<confidence value="5">]</confidence>
+        The control may be configured to have a UI consistent with the rest of the platform.  The customization is achieved through the declaration procedure.   By repackaging an existing binary application, the wrappered web application may be configured to run on multiple software platforms, without necessarily requiring a recompilation of the web application code for each software platform. Since the customization is performed on an existing binary web application, the web application includes code for a UI at the beginning of the customization process. As part of the <page-break num="4"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                       -<confidence value="8">4</confidence>
+-                           U.S. Patent      </boundary-data>
+wrappering of the web application, it is associated with new customized UI code which is configured to display a view of the web application on the computer which stores and launches the new customized UI code.    </p>
+    <p id="p-17" num="17">
+      <confidence value="5">[</confidence>
+0017<confidence value="5">]</confidence>
+       A declarative file, such as an XML file, may be used to provide attributes for running the web application within a given platform. Typically, this is done by extending a provided function of the platform. The web application developer packages the web application binary code along with a declarative file in a form that the platform can recognize, generally without having to write or compile additional code. The wrappered web application can be installed into the platform in a form that gels with the platform, providing immediate access to the application. Additional levels of customization may be provided, if allowed by the platform.    </p>
+    <p id="p-18" num="18">
+      <confidence value="5">[</confidence>
+0018<confidence value="5">]</confidence>
+       The platform typically provides the ability to interpret the declarative information and generate a customized UI wrapper for the web application. Generally a browser control is generated and pointed to the web application's context root. The context root is typically defined as the web application root, which is the top-level directory of the application when it is deployed to a web server. For example, if I have an application with a context root of "TestApp" is running on a web server with an address of htt<confidence value="8">p</confidence>
+ <confidence value="6886885">://192.</confidence>
+168.10.10 then the way to   access  it  would   be   to  go   to   &lt;server  address&gt;/&lt;context  root&gt;  -- htt<confidence value="666">p:/</confidence>
+ <confidence value="5">1</confidence>
+92.168.10.1<confidence value="566">0/T</confidence>
+estA<confidence value="66">pp</confidence>
+. Further look-and-feel functions may be added as well using extensions. An extension point causes a perspective and view to be created upon being extended. An extension is created by placing one or more plug-ins in an extension directory. A plug-in typically references the platform extension point in the plug-in descriptor and provides any configuration information required by the extension point. In Eclipse the extension directory contains plug-ins to be linked, but does not contain the Java Runtime Environment (JRE) or the Eclipse engine. Using an extension point to link plug- ins permits the linked plug-ins to be registered and used when the application is launched.    </p>
+    <p id="p-19" num="19">
+      <confidence value="5">[</confidence>
+0019<confidence value="5">]</confidence>
+       The Eclipse view used by developers contains a Standard Widget Toolkit (SWT) browser control that may be directed to the location provided by the extending application.    </p>
+    <p id="p-20" num="20">A web application developer packages the web application as a plug-in, providing a plug-in manifest that extends the platform's web application extension point and also provides the <page-break num="5"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                      -<confidence value="8">5</confidence>
+-                            U.S. Patent      </boundary-data>
+context root of the web application, and optionally provides icons and displayable text.    </p>
+    <p id="p-21" num="21">When registering this plug-in, the platform loads and runs the web application and then can generate a customized UI wrapper for the web application. This is all done without the application developer necessarily having to write or compile additional code, which would typically be required if conventional development of a dedicated perspective and view were used for a web application.</p>
+    <p id="p-22" num="22">
+      <confidence value="5">[</confidence>
+0020<confidence value="5">]</confidence>
+       FIG. 1 depicts a software development platform architecture <part-num-ref name="software development platform architecture">100</part-num-ref>
+ which may be used to implement various embodiments. The platform architecture in this exemplary embodiment is Eclipse, an open integrated development environment (IDE) which may be used, for example, by a software developer or programmer to develop web applications.    </p>
+    <p id="p-23" num="23">The Eclipse development platform architecture is used herein to illustrate and explain various embodiments, and not by way of limitation. The various embodiments may be implemented using a number of other development platforms, for example, IBM's WebSphere Studio Application Developer or Rational Application Developer, Borland's JBuilder, or BEA WebLogic Workshop, Oracle's JDeveloper and NetBeans, or other like types of development platforms. Eclipse may be used to build or modify web applications by formatting them as plug-ins <part-num-ref name="number of other development platforms, for example, IBM's WebSphere Studio Application Developer or Rational Application Developer, Borland's JBuilder, or BEA WebLogic Workshop, Oracle's JDeveloper and NetBeans, or other like types of development platforms. Eclipse may be used to build or modify web applications by formatting them as plug-ins">160.</part-num-ref>
+ The Eclipse platform <part-num-ref name="Eclipse platform">100</part-num-ref>
+ itself consists of a number of components, including platform runtime <part-num-ref name="number of components, including platform runtime">110,</part-num-ref>
+ workspace <part-num-ref name="number of components, including platform runtime 110, workspace">130</part-num-ref>
+ and workbench <part-num-ref name="and workbench">120.</part-num-ref>
+ The workbench <part-num-ref name="workbench">120</part-num-ref>
+ is used for graphical user interface (GUI) based applications, and may, in some instances, be omitted for non-GUI configurations of the Eclipse platform <part-num-ref name="Eclipse platform">100.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">Although the plug-in <part-num-ref name="plug-in">160</part-num-ref>
+ is depicted within the workspace <part-num-ref name="workspace">130</part-num-ref>
+ and referred to herein as a plug-in, the plug-in <part-num-ref name="plug-in">160</part-num-ref>
+ remains, in a strict sense, a plug-in project until completion since it is not really a plug-in until the project is built.    </p>
+    <p id="p-25" num="25">
+      <confidence value="5">[</confidence>
+0021<confidence value="5">]</confidence>
+       A plug-in <part-num-ref name="plug-in">160</part-num-ref>
+ may be in the form of a directory structure containing one or more files, e.g., a manifest, compiled libraries, translated messages, etc. The manifest file of a plug-in (e.g., plugin.xml) defines information about the plug-in <part-num-ref name="plug-in">160,</part-num-ref>
+ declares the interconnection between that plug-in and other plug-ins, and can reference libraries of compiled source code to be executed within Eclipse. The compiled source code to be executed may be a web application, for example.     Typically, plug-ins <part-num-ref name="web application, for example.     Typically, plug-ins">160</part-num-ref>
+ have characteristics which are declaratively specified in the manifest file. The declarative plug- <page-break num="6"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                        -<confidence value="8">6</confidence>
+-                            U.S. Patent      </boundary-data>
+in characteristics may be used to customize the attributes of the application containing the plug-in. A plug-in <part-num-ref name="plug-in">160</part-num-ref>
+ may be formed from separate fragments which each have a dedicated directory or URL. A plug-in may be packaged up into a <confidence value="5">.</confidence>
+jar file (Java Archive) for easier delivery.    </p>
+    <p id="p-26" num="26">
+      <confidence value="5">[</confidence>
+0022<confidence value="5">]</confidence>
+       Plug-in tools 150-54 can be developed to perform a specified functionality on an application program. A simple tool with a straightforward functionality may be written as a single plug-in. More complex tools may be created with functionality split across multiple plug-ins. Many of the diverse functionalities of Eclipse platform <part-num-ref name="diverse functionalities of Eclipse platform">100</part-num-ref>
+ are located in the platform's plug-in tools 150-54. Eclipse plug-in tools 150-54 may include Java code from a JAR library, native code libraries, web templates, read-only files, images, HTML files (hypertext markup language), or the like. The code library and read-only content of plug-in tools 150-54 are typically located in a directory within the file system or else at a specified URL. The platform runtime <part-num-ref name="platform runtime">110</part-num-ref>
+ detects and logs plug-in tools 150-54 as part of the start- up process. The platform runtime <part-num-ref name="platform runtime">110</part-num-ref>
+ discovers the available plug-in tools 150-54 at start- up, reads the manifest files of the plug-ins <part-num-ref name="plug-ins">150,</part-num-ref>
+ matches extension declarations with corresponding extension point declarations, builds a plug-in registry in the computer's memory, and logs any missing extension points. Typically, no further plug-in tools 150-54 will be added once the platform runtime <part-num-ref name="platform runtime">110</part-num-ref>
+ has completed logging the plug-ins as part of the start-up process.    </p>
+    <p id="p-27" num="27">
+      <confidence value="5">[</confidence>
+0023<confidence value="5">]</confidence>
+       The workbench <part-num-ref name="workbench">120</part-num-ref>
+ serves as the UI of the Eclipse Platform, providing a useful structure for constructing or modifying a plug-in <part-num-ref name="plug-in">160.</part-num-ref>
+ Workbench <part-num-ref name="plug-in 160. Workbench">120</part-num-ref>
+ includes the Standard Widget Toolkit (SWT) <part-num-ref name="Standard Widget Toolkit (SWT)">122</part-num-ref>
+ and the JFace toolkit <part-num-ref name="JFace toolkit">124.</part-num-ref>
+ SWT <part-num-ref name="JFace toolkit 124. SWT">122</part-num-ref>
+ is a widget set and graphics library used to present information to the user. SWT <part-num-ref name="user. SWT">122</part-num-ref>
+ provides users with an application program interface (API) which is OS-independent. JFace <part-num-ref name="application program interface (API) which is OS-independent. JFace">124</part-num-ref>
+ is a specialized toolkit useful for programming UI tasks. <confidence value="5">J</confidence>
+Face <part-num-ref name="specialized toolkit useful for programming UI tasks. JFace">124</part-num-ref>
+ includes UI toolkit components such as image and font registries, dialog, preference, and wizard frameworks, and progress reporting for long running operations.    </p>
+    <p id="p-28" num="28">
+      <confidence value="5">[</confidence>
+0024<confidence value="5">]</confidence>
+       The Eclipse development platform is discussed in further detail in the "Eclipse Platform  Technical Overview"(c) (published    July, <part-num-ref name="&quot;Eclipse Platform  Technical Overview&quot;(c) (published    July,">2001</part-num-ref>
+ by    Object Technology International, Inc.; posted at <confidence value="22885885">,Nww.ecl</confidence>
+ipse<confidence value="5">.</confidence>
+org/whitepapers/ec<confidence value="5">l</confidence>
+ipse<confidence value="5">-</confidence>
+overview<confidence value="55">.p</confidence>
+df) and the <page-break num="7"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                      -<confidence value="8">7</confidence>
+-                            U.S. Patent      </boundary-data>
+book entitled "Eclipse: Building Commercial Quality Plug-ins," by Eric Clayberg and Dan Rubel (Addison-Wesley Professional June, 2004), both of which are hereby incorporated by reference herein in their respective entireties.    </p>
+    <p id="p-29" num="29">
+      <confidence value="5">[</confidence>
+0025<confidence value="5">]</confidence>
+       FIG. 2A depicts an example of code for a plugin.xml manifest file written in XML.    </p>
+    <p id="p-30" num="30">The plug-in includes declarative statements that customize various aspects of the application,  for  example,  id="com.somecompany.application.name",  name="Test Application Plugin", version= "1.0.0", and provider-name= "Some Company".</p>
+    <p id="p-31" num="31">
+      <confidence value="5">[</confidence>
+0026<confidence value="5">]</confidence>
+       The plug-in manifest shown in the figure, plugin.xml, includes an extension for a web application extension point="com.ibm.platform.WebApplication". This extension lists out some properties that customize some of the aspects of the application, for example, &lt;DisplayName&gt;Test     Application&lt;/DisplayName&gt;;        &lt;Url&gt;/TestApp     &lt;/Url&gt;;    </p>
+    <p id="p-32" num="32">&lt;BrowserOptions addressbarVisible="false toolbarVisible="false"/&gt;; and &lt;Icon&gt; icons<confidence value="5">/</confidence>
+ testapp.gif &lt;/Icon&gt;. The extension may be thought of as a hook into the platform, in a manner of speaking. The manifest file of each plug-in declares the interconnections from that plug-in to any other interconnected plug-ins by declaring extensions to extension points located in one or more other plug-ins.    </p>
+    <p id="p-33" num="33">
+      <confidence value="5">[</confidence>
+0027<confidence value="5">]</confidence>
+       FIG. 2B depicts an exemplary file structure of a plug-in containing two files. The plug-in file structure shown in the figure contains the plug-in XML file "plugin.xml" and a web application file "testapp.war." The file "plugin.xml" may be an XML plug-in file such as that depicted in FIG. 2A. A web application which has been wrappered in a development platform such as Eclipse may have a file structure similar to that of the plug- in shown in FIG. 2B containing two or more files.    </p>
+    <p id="p-34" num="34">
+      <confidence value="5">[</confidence>
+0028<confidence value="5">]</confidence>
+       FIG. 3 depicts a method <part-num-ref name="method">300</part-num-ref>
+ of wrappering a web application according to various embodiments. An example of a web application being wrappered could occur with the creation banking software which runs on a bank's kiosk ATM (automated teller machine).    </p>
+    <p id="p-35" num="35">The bank's web application running on its website may contain many of the features desired for its ATM kiosk web application. For example, a user could access the bank's website using a browser, enter the user password, and then perform various transactions such as checking account balances, transferring funds, etc. However, when the bank's website is accessed with a browser, the skin of the browser with the various browser <page-break num="8"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                       -<confidence value="8">8</confidence>
+-                           U.S. Patent      </boundary-data>
+controls and buttons are visible and available to the user. This would be undesirable for the ATM kiosk web application. The various embodiments disclosed herein allow a software developer or programmer to modify a copy of the bank's web application running on its website, transforming it into a customized version of the web application for use in the ATM kiosk. The developer could start with the bank's website web application and wrapper this platform to customize it with any desired look and feel, features, menu items, or controls. Developing the ATM kiosk web application in this manner, in accordance with various embodiments, would save a great deal of time and yet produce a customized product without the browser's skin or generic browser controls. FIG. 3 illustrates a method for wrappering a web application in this manner.    </p>
+    <p id="p-36" num="36">
+      <confidence value="5">[</confidence>
+0029<confidence value="5">]</confidence>
+       A developer typically starts with an existing web application which may be accessed on the Internet using a browser. The web application may be a generic web application, for example, written in Java, which is not native to any particular software platform. The method begins in <part-num-ref name="method begins in">302</part-num-ref>
+ and proceeds to <part-num-ref name="and proceeds to">304</part-num-ref>
+ where it is determined whether the web application is to be wrappered or not. If not, the method proceeds along the "NO" branch to <part-num-ref name="&quot;NO&quot; branch to">316</part-num-ref>
+ and ends. However, if it is decided, in <part-num-ref name="and ends. However, if it is decided, in">304,</part-num-ref>
+ that the web application is to be wrappered the method proceeds from <part-num-ref name="method proceeds from">304</part-num-ref>
+ along the "YES" branch to <part-num-ref name="&quot;YES&quot; branch to">306.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">
+      <confidence value="5">[</confidence>
+0030<confidence value="5">]</confidence>
+       In 306 a plug-in is created in a predefined plug-in format. The notion of having a plug-in to a platform implies that there is a platform-defined structure that the plug-in adheres to so that the platform can successfully recognize and access the plug-in. In <part-num-ref name="plug-in. In">306</part-num-ref>
+ the "predefined plug-in format" is the platform-defined structure that allows the platform to recognize and access the plug-in. For example, if Eclipse is being used in <part-num-ref name="plug-in. For example, if Eclipse is being used in">306</part-num-ref>
+ to modify a web application as a plug-in, then the plug-in being developed must adhere to the Eclipse predefined plug-in format<confidence value="5">-</confidence>
+that is, Eclipse's mechanisms and rules for plug-ins.    </p>
+    <p id="p-38" num="38">
+      <confidence value="5">[</confidence>
+0031<confidence value="5">]</confidence>
+       Upon completing 306 the method proceeds to <part-num-ref name="method proceeds to">308</part-num-ref>
+ to include the web application in the structure. The structure of this plug-in typically includes two or more files (e.g., at least one file such as a plugin.xml file with declarative statements, and the web application file).    </p>
+    <p id="p-39" num="39">FIG. 2B depicts an exemplary plug-in structure with the web application contained in the plug-in. Once the web application is included in the plug-in structure the method proceeds to <part-num-ref name="method proceeds to">310</part-num-ref>
+ to add declarative properties to the plug-in.    </p>
+    <boundary-data type="header">AUS920050565US1                       -<confidence value="8">9</confidence>
+-                           U.S. Patent    </boundary-data>
+    <p id="p-40" num="40">
+      <page-break num="9"/>
+      <confidence value="5">[</confidence>
+0032<confidence value="5">]</confidence>
+       The declarative statements may specify the look and feel for the customized web application, one or more URLs (universal resource locators) to be accessed locally or over a network by the customized web application, specialized menu lists, buttons or controls, the color scheme, line widths and shading, and any other custom features for the UI of the customized web application as it appears in the platform. Other features which may be specified as declarative statements include, for example: Toggling the visibility of the address bar (which displays the URL to the application); Providing a path to an image to be associated with the application in the platform (i.e. a "launch icon" for the app); or Indicating how the platform should "launch" the application (e.g., launched in the general "application" area of the platform or possibly in a separate window to be solely used by the application, and therefore resizable, expandable, etc. by itself without affecting any other running applications in the platform). This may be done by adding declarative properties to the plug-in descriptor via a platform extension. Declarative statements may be used to specify extensions to any number of extension points in other plug-ins. The extension points of one plug-in may be extended through another plug-in by defining an extension to the extension point in the other plug-in. Extension points define new function points for the platform that other plug-ins can plug into. Extension points may be better understood by the analogy of a power outlet to an appliance that plugs into the outlet can be used to describe the function of extension points (outlet) to extensions (appliance). Once the desired declarative properties have been added in <part-num-ref name="desired declarative properties have been added in">310</part-num-ref>
+ the method proceeds to <part-num-ref name="method proceeds to">312.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">
+      <confidence value="5">[</confidence>
+0033<confidence value="5">]</confidence>
+       In block 312 it is determined whether or not the application runs in the manner desired by the user. At this point, the customized web application should operate to access the defined URL without showing the standard browser skin or browser controls. The customized web application will have a tailored look and feel, including its own custom menu items and controls. If the errors are discovered in the web application, the application is unstable or contains bugs, or the application does not otherwise operate in the desired manner, the method proceeds from <part-num-ref name="method proceeds from">312</part-num-ref>
+ along the "NO" branch back to <part-num-ref name="&quot;NO&quot; branch back to">306.</part-num-ref>
+ In <part-num-ref name="&quot;NO&quot; branch back to 306. In">306</part-num-ref>
+ the user may again create a plug-in in the predefined plug-in format, or simply modify the previously created plug-in to fix the errors detected in the application in <part-num-ref name="application in">312.</part-num-ref>
+ Back in <part-num-ref name="application in 312. Back in">312,</part-num-ref>
+ <page-break num="10"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="58">S1</confidence>
+                      <confidence value="6">-</confidence>
+ <confidence value="88">10</confidence>
+ -                         U.S. Patent      </boundary-data>
+if it is determined that the application is stable and runs as expected the method proceeds from <part-num-ref name="method proceeds from">312</part-num-ref>
+ along the "YES" branch to <part-num-ref name="&quot;YES&quot; branch to">314.</part-num-ref>
+    </p>
+    <p id="p-42" num="42">
+      <confidence value="5">[</confidence>
+0034<confidence value="5">]</confidence>
+       In 314 the user determines whether the look-and-feel or controls of the web application are acceptable, or any additional features are desired for the web application.    </p>
+    <p id="p-43" num="43">If, in 314, it is determined that further customization is warranted the method proceeds from <part-num-ref name="method proceeds from">314</part-num-ref>
+ along the "YES" branch back to <part-num-ref name="&quot;YES&quot; branch back to">306.</part-num-ref>
+ The user may create a new plug-in in <part-num-ref name="new plug-in in">306,</part-num-ref>
+ or modify the previously created plug-in, to effect the changes desired by the user for further customization of the application. If no further customization is desired in <part-num-ref name="application. If no further customization is desired in">314</part-num-ref>
+ the method proceeds from <part-num-ref name="method proceeds from">314</part-num-ref>
+ to <part-num-ref name="to">316</part-num-ref>
+ and ends. Once the method has been completed, creating a customized user interface wrapper for the web application, the newly wrappered web application may be stored in the memory of a computer. When the wrappered web application is launch, it can access data or perform operations via the Internet in a predefined manner without showing the browser controls, menus or skin.    </p>
+    <p id="p-44" num="44">
+      <confidence value="5">[</confidence>
+0035<confidence value="5">]</confidence>
+       FIG. 4 depicts an exemplary hardware environment for implementing the various embodiments. The figure shows a block diagram of a typical information handling system hardware configuration which includes processor <part-num-ref name="typical information handling system hardware configuration which includes processor">401.</part-num-ref>
+ The processor <part-num-ref name="processor">401</part-num-ref>
+ may be implemented as a central processing unit (CPU) containing circuitry or other logic capable of performing or controlling the processes, steps and activities involved in practicing the embodiments disclosed herein. The processor <part-num-ref name="processor">401</part-num-ref>
+ may be embodied as either a microprocessor or an application specific integrated circuit (ASIC), may be a combination of two or more distributed processors, or any other circuitry or logic capable of carrying out commands or instructions, for example, the routines of a computer program such as a web application. In various embodiments the processor <part-num-ref name="processor">401</part-num-ref>
+ may run a computer program or routine which performs one or more of the activities depicted in FIG. 3.    </p>
+    <p id="p-45" num="45">
+      <confidence value="5">[</confidence>
+0036<confidence value="5">]</confidence>
+       The processor <part-num-ref name="processor">401</part-num-ref>
+ is interconnected to internal memory <part-num-ref name="is interconnected to internal memory">403</part-num-ref>
+ and storage memory <part-num-ref name="and storage memory">405.</part-num-ref>
+ The components of system <part-num-ref name="components of system">400</part-num-ref>
+ are typically interconnected via a bus <part-num-ref name="bus">450.</part-num-ref>
+ One or more of the components may be connected via an I/O bus (input/output bus), direct serial or parallel wired connections, wireless links, or a combination of any of these. The internal memory <part-num-ref name="internal memory">403,</part-num-ref>
+ which may be referred to as a local memory, may be any of several types of storage devices used for storing computer programs, routines, or code, including the <page-break num="11"/>
+      <boundary-data type="header">AUS920050565US1                     - 11 -                         U.S. Patent</boundary-data>
+instructions and data for carrying out activities of the various embodiments such as the activities discussed herein.    </p>
+    <p id="p-46" num="46">
+      <confidence value="5">[</confidence>
+0037<confidence value="5">]</confidence>
+       The internal memory <part-num-ref name="internal memory">403</part-num-ref>
+ and storage memory <part-num-ref name="and storage memory">405</part-num-ref>
+ may be implemented in any form suitable for storing data in a computer system, for example, as random access memory (RAM), read only memory (ROM), flash memory, registers, hard disk, or removable media such as a magnetic or optical disk, or other storage medium known in the art. Either of the memories <part-num-ref name="memories">403</part-num-ref>
+ and <part-num-ref name="and">405</part-num-ref>
+ may include a combination of one or more of these or other such storage devices or technologies. A wrappered web application may be stored in storage memory <part-num-ref name="wrappered web application may be stored in storage memory">405</part-num-ref>
+ of the computer system <part-num-ref name="computer system">400.</part-num-ref>
+ The internal memory <part-num-ref name="internal memory">403</part-num-ref>
+ and storage memory <part-num-ref name="and storage memory">405</part-num-ref>
+ may each be configured to store all or parts of a computer program product which performs the various activities in creating a customized wrapper for a web application.    </p>
+    <p id="p-47" num="47">
+      <confidence value="5">[</confidence>
+0038<confidence value="5">]</confidence>
+       The processor <part-num-ref name="processor">401</part-num-ref>
+ is configured to communicate with internal memory <part-num-ref name="is configured to communicate with internal memory">403</part-num-ref>
+ and storage memory <part-num-ref name="and storage memory">405</part-num-ref>
+ via the bus <part-num-ref name="bus">450</part-num-ref>
+ or by way of other wired or wireless communication links. Although the bus <part-num-ref name="bus">450</part-num-ref>
+ is depicted as a single bus connecting all of the component parts of the system, the information handling system <part-num-ref name="information handling system">400</part-num-ref>
+ may include two or more separate buses each connected to a subset of the system components.    </p>
+    <p id="p-48" num="48">
+      <confidence value="5">[</confidence>
+0039<confidence value="5">]</confidence>
+       The information handling system <part-num-ref name="information handling system">400</part-num-ref>
+ also includes one or more input/output (I/O) units such as user output <part-num-ref name="also includes one or more input/output (I/O) units such as user output">409</part-num-ref>
+ and user inputs <part-num-ref name="and user inputs">413</part-num-ref>
+ and <part-num-ref name="and">415.</part-num-ref>
+ The user output <part-num-ref name="user output">409</part-num-ref>
+ may be interfaced to bus <part-num-ref name="may be interfaced to bus">450</part-num-ref>
+ by a graphics adapter and implemented as a monitor, for example, a cathode ray tube (CRT) or a liquid crystal display (LCD) screen or other like type of computer screen. Typically, the output <part-num-ref name="output">409</part-num-ref>
+ (e.g., computer screen) displays a view controlled by the wrappered web application stored in memory <part-num-ref name="wrappered web application stored in memory">405</part-num-ref>
+ in response to the application being executed by processor <part-num-ref name="application being executed by processor">401</part-num-ref>
+ of the computer <part-num-ref name="computer">400.</part-num-ref>
+ The user output <part-num-ref name="user output">409</part-num-ref>
+ may include one or more audio speakers as well as a video monitor. The information handling system <part-num-ref name="information handling system">400</part-num-ref>
+ typically includes one or more user input devices 413-15 such as a keyboard, a mouse, a tablet surface and pen, a microphone and speech recognition routine, or other like types of input/output devices. The user input devices 413-15 may be interfaced to bus <part-num-ref name="user input devices 413-15 may be interfaced to bus">450</part-num-ref>
+ by an I/O interface <part-num-ref name="I/O interface">417.</part-num-ref>
+ The user output <part-num-ref name="user output">409</part-num-ref>
+ and user inputs 413-15 may include other devices known to those of ordinary skill in the art and suitable for use with a computer system.    </p>
+    <boundary-data type="header">
+      <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                      - <confidence value="88">12</confidence>
+ -                         U.S. Patent    </boundary-data>
+    <p id="p-49" num="49">
+      <page-break num="12"/>
+      <confidence value="5">[</confidence>
+0040<confidence value="5">]</confidence>
+       The information handling system <part-num-ref name="information handling system">400</part-num-ref>
+ is configured to include data interface unit <part-num-ref name="is configured to include data interface unit">420</part-num-ref>
+ suitable for connecting to networks such as one or more of the Internet, a local area network (LAN), a wide area network (WAN), the Public Switched Telephone System (PSTN), or to a wireless telephone network. The data interface unit <part-num-ref name="data interface unit">420</part-num-ref>
+ may include a wired and/or wireless transmitter and receiver. The data interface unit <part-num-ref name="data interface unit">420</part-num-ref>
+ may be implemented in the form of multiple units, including, for example, a modem and a network adapter. When the processor <part-num-ref name="processor">401</part-num-ref>
+ executes the wrappered web application stored in memory <part-num-ref name="wrappered web application stored in memory">405,</part-num-ref>
+ the computer system <part-num-ref name="computer system">400</part-num-ref>
+ accesses the Internet data interface unit <part-num-ref name="Internet data interface unit">420</part-num-ref>
+ and functions in a predefined manner specified by the declarative statements in the wrappered web application. The information handling system <part-num-ref name="information handling system">400</part-num-ref>
+ may use data interface unit <part-num-ref name="may use data interface unit">420</part-num-ref>
+ to connect to a server configured to store a computer program product such as the Eclipse platform which performs the various activities for creating a customized wrapper for a web application.    </p>
+    <p id="p-50" num="50">
+      <confidence value="5">[</confidence>
+0041<confidence value="5">]</confidence>
+       Various steps may be included or excluded as described herein, or performed in a different order, with the rest of the activities still remaining within the scope of at least one exemplary embodiment. For example, in at least one exemplary embodiment, if it is determined in <part-num-ref name="scope of at least one exemplary embodiment. For example, in at least one exemplary embodiment, if it is determined in">312</part-num-ref>
+ that the wrappered web application does not run in the manner desired, the method may loop back to <part-num-ref name="method may loop back to">310</part-num-ref>
+ to change the declarative properties rather than looping back to <part-num-ref name="declarative properties rather than looping back to">306</part-num-ref>
+ to begin the process again. Other deviations from the order depicted in the figures may fall within the scope of this disclosure, and some activities may be performed in an order other than that shown in the figures. For example, blocks <part-num-ref name="figures. For example, blocks">314</part-num-ref>
+ may be performed before block <part-num-ref name="may be performed before block">312.</part-num-ref>
+ It is expected that those of ordinary skill in the art may perform would know to change the order of the activities in other manners as well.    </p>
+    <p id="p-51" num="51">
+      <confidence value="5">[</confidence>
+0042<confidence value="5">]</confidence>
+       The processing units, processors and controllers described herein (e.g., processor <part-num-ref name="processor">401</part-num-ref>
+ of FIG. 4) may be of any type capable of performing the stated functions and activities.    </p>
+    <p id="p-52" num="52">For example, a processor may be embodied as a microprocessor, microcontroller, DSP, RISC processor, or any other type of processor that one of ordinary skill would recognize as being capable of performing the functions described herein. A processing unit in accordance with at least one exemplary embodiment can operate computer software programs stored (embodied) on computer-readable medium, e.g. hard disk, CD, flash <page-break num="13"/>
+      <boundary-data type="header">
+        <confidence value="885">AUS</confidence>
+920050565U<confidence value="5">S</confidence>
+1                       - 13 -                          U.S. Patent      </boundary-data>
+memory, ram, or other computer readable medium as recognized by one of ordinary skill in the art. The computer software programs can aid or perform the steps and activities described above. For example computer programs in accordance with at least one exemplary embodiment may include source code for storing a declarative description of a customized user interface in a storage medium, for accessing the declarative description to generate the user interface wrapper, and for enabling the web application to operate using the user interface wrapper. There are many further source codes that may be written to perform the stated steps and procedures described herein, and these are intended to lie within the scope of exemplary embodiments.    </p>
+    <p id="p-53" num="53">
+      <confidence value="5">[</confidence>
+0043<confidence value="5">]</confidence>
+       The use of the word "exemplary" in this disclosure is intended to mean that the embodiment or element so described serves as an example, instance, or illustration, and is not necessarily to be construed as preferred or advantageous over other embodiments or elements. The term "web application", as used herein, is intended to mean any software application or routine that submits data (e.g., in response to a user action or input) over the Internet and gets a response. The terms "platform" and "software platform" have been used interchangeably in this disclosure and are intended to mean an operating system which runs on a computing device or other state machine. As such, a "platform" may include software, routines, programs, commands or the like, but typically does not include hardware. A "development platform", as used herein, is intended to mean a type of software or a software environment which may be used to modify or create software applications such as web applications. The description of the invention provided herein is merely exemplary in nature, and thus, variations that do not depart from the gist of the invention are intended to be within the scope of the embodiments of the present invention. Such variations are not to be regarded as a departure from the spirit and scope of the present invention.    </p>
+  </description>
+</us-patent-application>
+

applicant/11423408.xml

@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11423408</doc-number>
+        <date>2008-03-18</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">AMENDMENTS TO THE SPEC<confidence value="8">I</confidence>
+FI<confidence value="8">C</confidence>
+ATION:    </heading>
+    <p id="p-1" num="1">Please amend the title, as follows:</p>
+    <heading id="h-2">"<confidence value="2222">RFID</confidence>
+ SYSTEM[[S]] AND METHOD[[S<confidence value="5">]</confidence>
+] FOR STORING INFORMATION    </heading>
+    <heading id="h-3">RELATED TO A VEHICLE OR AN OWNER OF THE VEHICLE"</heading>
+    <p id="p-2" num="2">IFLXP<confidence value="55">01</confidence>
+8                     - <confidence value="8">2</confidence>
+ <confidence value="8">-</confidence>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11426026.xml

@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<pat:SpecificationDocument xmlns:pat="urn:us:gov:doc:uspto:patent" xmlns="urn:us:gov:doc:uspto:patent" xmlns:ent="urn:us:gov:doc:uspto:enterprise" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tbl="http://www.oasis-open.org/tables/exchange/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:com="http://www.wipo.int/standards/XMLSchema/Common/1" pat:instanceFileName="11426026.04-17-2008.FF5RVCFRPPOPPY4.SPEC.xml" pat:id="FF5RVCFRPPOPPY4" xsi:schemaLocation="urn:us:gov:doc:uspto:patent XMLSchema/V1_3/SpecificationDocument_1_0.xsd">
+<pat:DocumentCode>SPEC</pat:DocumentCode><pat:DocumentHeaderDetails pat:id="ID-00001">
+<pat:ApplicationHeaderDetails><pat:ApplicationNumber>11426026</pat:ApplicationNumber></pat:ApplicationHeaderDetails>
+<pat:PageTotalQuantity>2</pat:PageTotalQuantity>
+<pat:ParagraphTotalQuantity>12</pat:ParagraphTotalQuantity>
+</pat:DocumentHeaderDetails>
+<pat:MailRoomDate>2008-04-17</pat:MailRoomDate>
+<pat:Specification pat:id="Specification">
+<?PageStart number="1"?>
+<pat:BoundaryData><pat:HeaderText>App<pat:OCRConfidenceData pat:levelNumber="66">li</pat:OCRConfidenceData>cation No<pat:OCRConfidenceData pat:levelNumber="5">.</pat:OCRConfidenceData> <pat:OCRConfidenceData pat:levelNumber="5">I</pat:OCRConfidenceData> <pat:OCRConfidenceData pat:levelNumber="5">1</pat:OCRConfidenceData>/426,026</pat:HeaderText></pat:BoundaryData>
+<pat:BoundaryData><pat:HeaderText>Preliminary Amendment <pat:OCRConfidenceData pat:levelNumber="5">d</pat:OCRConfidenceData>ated April 17, 2008</pat:HeaderText></pat:BoundaryData>
+<pat:BoundaryData><pat:HeaderText>Docket: 34198US (KDK)</pat:HeaderText></pat:BoundaryData>
+<pat:Heading pat:id="h-1">AMENDMENTS TO THE SPECIFICA<pat:OCRConfidenceData pat:levelNumber="8">T</pat:OCRConfidenceData>ION</pat:Heading>
+<pat:P pat:id="p-1" pat:pNumber="1">Please amend the <pat:PartName pat:idref="PN-00001">specification beginning on page </pat:PartName><pat:PartNumber pat:id="PN-00001">35</pat:PartNumber>, lines 4<pat:OCRConfidenceData pat:levelNumber="5">-</pat:OCRConfidenceData>8 in the following manner:</pat:P>
+<pat:P pat:id="p-2" pat:pNumber="2"><pat:OCRConfidenceData pat:levelNumber="6">-</pat:OCRConfidenceData> As previously noted in FIG. 4a, a portion of the methane refrigerant recycle stream is routed to FI<pat:OCRConfidenceData pat:levelNumber="55">G.</pat:OCRConfidenceData> 4b via conduit E. The <pat:PartName pat:idref="PN-00002">stream enters economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00002">702</pat:PartNumber>, wherein the <pat:PartName pat:idref="PN-00003">stream is heated cooled via indirect heat exchange means </pat:PartName><pat:PartNumber pat:id="PN-00003">716</pat:PartNumber>. The resulting<pat:OCRConfidenceData pat:levelNumber="1456812">,-4east</pat:OCRConfidenceData></pat:P>
+<pat:P pat:id="p-3" pat:pNumber="3"><pat:PatentImage com:orientationCategory="Portrait" pat:imageWrappingStyleCategory="In front of text">
+<com:ImageFormatCategory>SVG</com:ImageFormatCategory>
+<com:ImageFileName>11426026.04-17-2008.FF5RVCFRPPOPPY4.SPEC.1.svg</com:ImageFileName>
+<com:HeightMeasure com:measureUnitCode="In">0.16</com:HeightMeasure>
+<com:WidthMeasure com:measureUnitCode="In">6.5</com:WidthMeasure>
+<com:ColourModeCategory>Black and white</com:ColourModeCategory></pat:PatentImage></pat:P>
+<pat:P pat:id="p-4" pat:pNumber="4"> vapor is employed as a stripping gas. -- Please amend the <pat:PartName pat:idref="PN-00004">specification beginning on page </pat:PartName><pat:PartNumber pat:id="PN-00004">35</pat:PartNumber>, <pat:PartName pat:idref="PN-00005">line </pat:PartName><pat:PartNumber pat:id="PN-00005">14</pat:PartNumber> <pat:PartName pat:idref="PN-00006">through page </pat:PartName><pat:PartNumber pat:id="PN-00006">36</pat:PartNumber>, <pat:PartName pat:idref="PN-00007">line </pat:PartName><pat:PartNumber pat:id="PN-00007">2</pat:PartNumber> in the following manner:</pat:P>
+<pat:P pat:id="p-5" pat:pNumber="5"><pat:OCRConfidenceData pat:levelNumber="6">-</pat:OCRConfidenceData> According to FI<pat:OCRConfidenceData pat:levelNumber="5">G</pat:OCRConfidenceData>. 4b, the liquid product from the <pat:PartName pat:idref="PN-00008">bottom port of first distillation column </pat:PartName><pat:PartNumber pat:id="PN-00008">752</pat:PartNumber> <pat:PartName pat:idref="PN-00009">exits via conduit </pat:PartName><pat:PartNumber pat:id="PN-00009">788</pat:PartNumber>, whereupon the <pat:PartName pat:idref="PN-00010">stream splits into conduits </pat:PartName><pat:PartNumber pat:id="PN-00010">730</pat:PartNumber> <pat:PartName pat:idref="PN-00011">and </pat:PartName><pat:PartNumber pat:id="PN-00011">732</pat:PartNumber>. The <pat:PartName pat:idref="PN-00012">stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00012">732</pat:PartNumber> <pat:PartName pat:idref="PN-00013">enters economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00013">702</pat:PartNumber>, wherein the <pat:PartName pat:idref="PN-00014">stream is e<pat:OCRConfidenceData pat:levelNumber="4">e</pat:OCRConfidenceData>eled heated via indirect heat exchange means </pat:PartName><pat:PartNumber pat:id="PN-00014">718</pat:PartNumber>. The <pat:PartName pat:idref="PN-00015">resulting <pat:OCRConfidenceData pat:levelNumber="555555">eeeled</pat:OCRConfidenceData> warmed stream exits economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00015">702</pat:PartNumber> <pat:PartName pat:idref="PN-00016">via conduit </pat:PartName><pat:PartNumber pat:id="PN-00016">738</pat:PartNumber><pat:OCRConfidenceData pat:levelNumber="5">.</pat:OCRConfidenceData> A portion of the <pat:PartName pat:idref="PN-00017">stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00017">738</pat:PartNumber> <pat:PartName pat:idref="PN-00018">may be <pat:OCRConfidenceData pat:levelNumber="885">rou</pat:OCRConfidenceData>ted through conduit </pat:PartName><pat:PartNumber pat:id="PN-00018">744</pat:PartNumber> <pat:PartName pat:idref="PN-00019">via valve </pat:PartName><pat:PartNumber pat:id="PN-00019">743</pat:PartNumber> <pat:PartName pat:idref="PN-00020">in order to bypass condenser </pat:PartName><pat:PartNumber pat:id="PN-00020">720</pat:PartNumber>. The <pat:PartName pat:idref="PN-00021">conduit </pat:PartName><pat:PartNumber pat:id="PN-00021">744</pat:PartNumber> <pat:PartName pat:idref="PN-00022">bypass around condenser </pat:PartName><pat:PartNumber pat:id="PN-00022">720</pat:PartNumber> can be one mechanism for second distillation column feed and/or overhead vapor product temperature control.</pat:P>
+<pat:P pat:id="p-6" pat:pNumber="6">Referring now to the <pat:PartName pat:idref="PN-00023">remaining portion of second distillation column bottom liquid product in conduit </pat:PartName><pat:PartNumber pat:id="PN-00023">730</pat:PartNumber> in FIG. 4b, the <pat:PartName pat:idref="PN-00024">stream bypasses economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00024">702</pat:PartNumber>, <pat:PartName pat:idref="PN-00025">passes through valve </pat:PartName><pat:PartNumber pat:id="PN-00025">737</pat:PartNumber>, and recombines with the <pat:PartName pat:idref="PN-00026">ee<pat:OCRConfidenceData pat:levelNumber="4555">eled</pat:OCRConfidenceData> warmed stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00026">747</pat:PartNumber>. The <pat:PartName pat:idref="PN-00027">composite strea<pat:OCRConfidenceData pat:levelNumber="5">m</pat:OCRConfidenceData> enters condenser </pat:PartName><pat:PartNumber pat:id="PN-00027">720</pat:PartNumber> <pat:PartName pat:idref="PN-00028">via conduit </pat:PartName><pat:PartNumber pat:id="PN-00028">740</pat:PartNumber>. The temperature of the <pat:PartName pat:idref="PN-00029">stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00029">740</pat:PartNumber> can be controlled by adjusting the <pat:PartName pat:idref="PN-00030">flow rate through conduit </pat:PartName><pat:PartNumber pat:id="PN-00030">730</pat:PartNumber> <pat:PartName pat:idref="PN-00031">by opening or closing valve </pat:PartName><pat:PartNumber pat:id="PN-00031">737</pat:PartNumber>. For example, to dee<pat:OCRConfidenceData pat:levelNumber="185">rea</pat:OCRConfidenceData>se increase the temperature of the <pat:PartName pat:idref="PN-00032">stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00032">740</pat:PartNumber>, <pat:PartName pat:idref="PN-00033">one can further close valve </pat:PartName><pat:PartNumber pat:id="PN-00033">737</pat:PartNumber>, thereby forcing a <pat:PartName pat:idref="PN-00034">larger portion of flow through economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00034">702</pat:PartNumber> to be e<pat:OCRConfidenceData pat:levelNumber="55">ee</pat:OCRConfidenceData>led heated, therefore <pat:OCRConfidenceData pat:levelNumber="5">r</pat:OCRConfidenceData>     increasin<pat:OCRConfidenceData pat:levelNumber="5">g</pat:OCRConfidenceData> the temperature of the <pat:PartName pat:idref="PN-00035">composite stream entering condenser </pat:PartName><pat:PartNumber pat:id="PN-00035">720</pat:PartNumber>. <pat:PartName pat:idref="PN-00036">Condenser </pat:PartName><pat:PartNumber pat:id="PN-00036">720</pat:PartNumber> acts an indirect heat exchange means to cool a <pat:PartName pat:idref="PN-00037">yet-to-be discussed stream by using stream </pat:PartName><pat:PartNumber pat:id="PN-00037">740</pat:PartNumber> as a coolant<pat:OCRConfidenceData pat:levelNumber="5">.</pat:OCRConfidenceData> The <pat:PartName pat:idref="PN-00038">coolant exits condenser </pat:PartName><pat:PartNumber pat:id="PN-00038">720</pat:PartNumber> <pat:PartName pat:idref="PN-00039">via conduit </pat:PartName><pat:PartNumber pat:id="PN-00039">742</pat:PartNumber>. Thereafter, the <pat:PartName pat:idref="PN-00040">streams in conduits </pat:PartName><pat:PartNumber pat:id="PN-00040">742</pat:PartNumber> <pat:PartName pat:idref="PN-00041">and </pat:PartName><pat:PartNumber pat:id="PN-00041">744</pat:PartNumber> <pat:OCRConfidenceData pat:levelNumber="885">com</pat:OCRConfidenceData>bine, and the <pat:PartName pat:idref="PN-00042">composite stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00042">746</pat:PartNumber> feeds second distillation column 754<pat:OCRConfidenceData pat:levelNumber="666">.--</pat:OCRConfidenceData> <pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber="7">2</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData>
+<?PageStart number="2"?><pat:BoundaryData><pat:HeaderText>Application No. 11/426,026</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Preliminary Amendment dated Apr<pat:OCRConfidenceData pat:levelNumber="58">il</pat:OCRConfidenceData> 17, 2008</pat:HeaderText></pat:BoundaryData><pat:BoundaryData><pat:HeaderText>Docket: 34198US (KDK)</pat:HeaderText></pat:BoundaryData>Please amend the <pat:PartName pat:idref="PN-00043">specification beginning on page </pat:PartName><pat:PartNumber pat:id="PN-00043">41</pat:PartNumber>, <pat:PartName pat:idref="PN-00044">line </pat:PartName><pat:PartNumber pat:id="PN-00044">21</pat:PartNumber> <pat:PartName pat:idref="PN-00045">through page </pat:PartName><pat:PartNumber pat:id="PN-00045">42</pat:PartNumber>, <pat:PartName pat:idref="PN-00046">line </pat:PartName><pat:PartNumber pat:id="PN-00046">8</pat:PartNumber> in the following manner:</pat:P>
+<pat:P pat:id="p-7" pat:pNumber="7">--A portion of the methane recycle stream in FIG. 6a is routed to FIG. 6b via conduit E.</pat:P>
+<pat:P pat:id="p-8" pat:pNumber="8">Thereafter, the stream in conduit E splits into several conduits. One portion of the <pat:PartName pat:idref="PN-00047">stream in conduit E flows through conduit </pat:PartName><pat:PartNumber pat:id="PN-00047">928</pat:PartNumber>, whereupon a further portion of the stream is routed by way</pat:P>
+<pat:P pat:id="p-9" pat:pNumber="9"><pat:PatentImage com:orientationCategory="Portrait" pat:imageWrappingStyleCategory="In front of text">
+<com:ImageFormatCategory>SVG</com:ImageFormatCategory>
+<com:ImageFileName>11426026.04-17-2008.FF5RVCFRPPOPPY4.SPEC.2.svg</com:ImageFileName>
+<com:HeightMeasure com:measureUnitCode="In">0.45</com:HeightMeasure>
+<com:WidthMeasure com:measureUnitCode="In">6.5</com:WidthMeasure>
+<com:ColourModeCategory>Black and white</com:ColourModeCategory></pat:PatentImage></pat:P>
+<pat:P pat:id="p-10" pat:pNumber="10"> exits main economizing heat exchanger 904 <pat:PartName pat:idref="PN-00048">via conduit </pat:PartName><pat:PartNumber pat:id="PN-00048">938</pat:PartNumber> and combines with a <pat:PartName pat:idref="PN-00049">yet-to-be- discussed stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00049">934</pat:PartNumber><pat:OCRConfidenceData pat:levelNumber="5">.</pat:OCRConfidenceData> <pat:PartName pat:idref="PN-00050">Referring back to conduit </pat:PartName><pat:PartNumber pat:id="PN-00050">928</pat:PartNumber>, the remaining portion of the <pat:PartName pat:idref="PN-00051">stream enters intermediate stage separator economizing heat exchanger </pat:PartName><pat:PartNumber pat:id="PN-00051">906</pat:PartNumber>, wherein the stream is cooled via an <pat:PartName pat:idref="PN-00052">indirect heat exchange means </pat:PartName><pat:PartNumber pat:id="PN-00052">930</pat:PartNumber><pat:OCRConfidenceData pat:levelNumber="5">.</pat:OCRConfidenceData> The resulting, cooled stream exits via conduit H and is routed to the <pat:PartName pat:idref="PN-00053">inlet of low-stage propane chiller </pat:PartName><pat:PartNumber pat:id="PN-00053">18</pat:PartNumber> in FIG. 6a, as previously noted. In FIG. 6b, the remainder of the stream in conduit <pat:OCRConfidenceData pat:levelNumber="5">E</pat:OCRConfidenceData> enters the first distillation column</pat:P>
+<pat:P pat:id="p-11" pat:pNumber="11"><pat:PatentImage com:orientationCategory="Portrait" pat:imageWrappingStyleCategory="In front of text">
+<com:ImageFormatCategory>SVG</com:ImageFormatCategory>
+<com:ImageFileName>11426026.04-17-2008.FF5RVCFRPPOPPY4.SPEC.3.svg</com:ImageFileName>
+<com:HeightMeasure com:measureUnitCode="In">0.44</com:HeightMeasure>
+<com:WidthMeasure com:measureUnitCode="In">6.5</com:WidthMeasure>
+<com:ColourModeCategory>Black and white</com:ColourModeCategory></pat:PatentImage></pat:P>
+<pat:P pat:id="p-12" pat:pNumber="12"> distillation column economizing heat exchanger 902 <pat:PartName pat:idref="PN-00054">via conduit </pat:PartName><pat:PartNumber pat:id="PN-00054">934</pat:PartNumber>, whereupon it combines with the <pat:PartName pat:idref="PN-00055">hea<pat:OCRConfidenceData pat:levelNumber="666">ted</pat:OCRConfidenceData> cooled stream in conduit </pat:PartName><pat:PartNumber pat:id="PN-00055">938</pat:PartNumber>, as noted previously. The <pat:PartName pat:idref="PN-00056">composite stream flows via conduit </pat:PartName><pat:PartNumber pat:id="PN-00056">940</pat:PartNumber> <pat:PartName pat:idref="PN-00057">into <pat:OCRConfidenceData pat:levelNumber="66">fi</pat:OCRConfidenceData>rst distillation column </pat:PartName><pat:PartNumber pat:id="PN-00057">952</pat:PartNumber>, wherein it is employed as a stripping gas. The stream in conduit I enters from the <pat:PartName pat:idref="PN-00058">outlet of intermediate-stage ethylene chiller </pat:PartName><pat:PartNumber pat:id="PN-00058">26</pat:PartNumber> <pat:PartName pat:idref="PN-00059">in FIG. 6a, as previously noted. According to FIG. 4b, this pri<pat:OCRConfidenceData pat:levelNumber="5">m</pat:OCRConfidenceData>arily <pat:OCRConfidenceData pat:levelNumber="5">m</pat:OCRConfidenceData>ethane strea<pat:OCRConfidenceData pat:levelNumber="5">m</pat:OCRConfidenceData> is refluxed back to first distillation column </pat:PartName><pat:PartNumber pat:id="PN-00059">952</pat:PartNumber> in FIG. 6b. -- <pat:BoundaryData><pat:HeaderText><pat:OCRConfidenceData pat:levelNumber="8">3</pat:OCRConfidenceData></pat:HeaderText></pat:BoundaryData></pat:P>
+</pat:Specification></pat:SpecificationDocument>

applicant/11427129.xml

@@ -0,0 +1,436 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11427129</doc-number>
+        <date>2006-06-28</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Information Security Management System Background of the Invention [0001] This invention relates to information security management and more particularly to a system for managing and developing security standards and procedures that allow the system to quickly adapt to changing security environments.</p>
+    <p id="p-2" num="2">[0002<confidence value="5">]</confidence>
+ Many institutions must comply with various rules, policies, regulations, and guidelines, whether established internally, by a regulatory entity, or as a result of legislation (hereinafter "rule" or "rules"). Because some of these rules may place responsibility on the institution for overseeing consistent adherence to the rules, there is an increasing need for a comprehensive process to manage information security across an entire business organization. For very large and geographically diverse organizations, these requirements can create a significant challenge and resource expenditure.    </p>
+    <p id="p-3" num="3">[0003] Typically an organization's information security standards and procedures are maintained as static, paper based systems. One problem with such systems is that they require significant management and maintenance, and compliance and audit overhead. These systems also cannot measure the impact of changing regulatory requirements. Nor can they effectively communicate policy through an organization. These systems also do not map regulatory requirements to an organization's policies, standards and procedures. It is also difficult with these systems to identify gaps between the standards and an organization's actual procedures. Finally, these systems are unable to access and group policies for use by a specific target audience.</p>
+    <p id="p-4" num="4">[0004] Thus an information security management system that allows centralized policy management using portal technology is desired.</p>
+    <p id="p-5" num="5">
+      <confidence value="8">1</confidence>
+ <page-break num="2"/>
+    </p>
+    <heading id="h-1">SUMMARY OF THE INVENTION</heading>
+    <p id="p-6" num="6">[0005] This invention provides an information security management system and tool for developing standards and procedures related to those standards across an organization. The system of the invention takes proposed information technology (IT) requirements for an organization and rationalizes these requirements as standards or procedures or rejects the requirements as neither a standard nor a procedure. Each proposed standard is scored for its relationship to a rule (rationalized), the risk to the organization from failing to comply with the requirement and the operational impact on the organization. These scores are compared to threshold scores to determine if the proposed standard should be adopted as a standard for the organization. Proposed procedures are also scored for organizational impact. The rationalization score and risk score for the standard to which the procedure relates are also used. These scores are compared to threshold scores to determine if the proposed procedure should be adopted as a procedure for the organization. Each standard is linked to the rule on which it is based and each procedure is linked to the standard it supports. The rationalization methodology provides foundation criteria based decision making, which can be used for historical reference, standards justification and support of the standard or process.</p>
+    <p id="p-7" num="7">[0006] In some embodiments the information security management system of the invention includes various modules, applications, or application modules that work together to accomp<confidence value="8">l</confidence>
+ish information security standards and procedures rationalizations, review and reporting. Information security management modules facilitate the development of standards and procedures by capturing rationalization data and by calculating scores based on the system requirements and data. These can be implemented by a computer system or systems, software, and networks, or by other means. A common database is operatively connected to the information security management module and other modules to <part-num-ref name="information security management module and other modules to">
+        <confidence value="8">2</confidence>
+      </part-num-ref>
+ <page-break num="3"/>
+maintain the standards, procedures, scores, rules and other data related to the security management function. A reporting function can be provided to facilitate monitoring of the standards and procedures of an organization.    </p>
+    <p id="p-8" num="8">[0007<confidence value="5">]</confidence>
+ In some embodiments, the invention is implemented via a computing platform or a collection of computing platforms interconnected by a network, such as a corporate intranet, in which case a web browser can facilitate use of the invention. A computer program product or products containing computer programs with various instructions cause the hardware to carry out, at least in part, the methods of the invention. Applications, or modules, such as the previously mentioned information security management module may be operated on a server or workstation. If the applications are running on a server, the modules are accessed from a client workstation. A database is operatively connected to the modules. The database may comprise a plurality of separate data structures or data storage devices that may reside on the same platform as one or more of the application modules, but more typically will reside on a database server. In this computer-based embodiment, the hardware and software together form the means for carrying out the invention.    </p>
+    <heading id="h-2">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-9" num="9">[0008] Fig. <confidence value="5">1</confidence>
+ is a block diagram of some of the computing hardware that is used to implement some embodiments of the invention.    </p>
+    <p id="p-10" num="10">[0009] FIG. 2 is a network block diagram of the hardware used to implement the invention in an example embodiment suitable for use in a large enterprise.</p>
+    <p id="p-11" num="11">[0010] FIG. 3 is a flowchart illustrating the overall operation of the information security management system of the invention.</p>
+    <p id="p-12" num="12">
+      <confidence value="8">3</confidence>
+ <page-break num="4"/>
+[0011] F<confidence value="5">I</confidence>
+G. 4 is a flowchart illustrating the pre-rationalization and filtering module of the system.    </p>
+    <p id="p-13" num="13">[0012] Fig. 5 illustrates the pre-rationalization and filtering module and an embodiment of a scripted display or screen shot.</p>
+    <p id="p-14" num="14">[0013] FIG. 6 is a flowchart illustrating the standard rationalization phase of the system of the invention.</p>
+    <p id="p-15" num="15">[0014] FIG. 7 is a flowchart illustrating the standard rationalization module of the system of the invention.</p>
+    <p id="p-16" num="16">[0015] Fig. 8 illustrates the standards rationalization module and an embodiment of a scripted display or screen shot.</p>
+    <p id="p-17" num="17">[0016] FIG. 9 is a flowchart illustrating the standard risk module of the system of the invention.</p>
+    <p id="p-18" num="18">[0017] Fig. 10 illustrates the standards risk module and an embodiment of a scripted display or screen shot.</p>
+    <p id="p-19" num="19">[0018<confidence value="5">]</confidence>
+ FIG. 11 is a flowchart illustrating the standard operational impact module of the system of the invention.    </p>
+    <p id="p-20" num="20">[0019] Fig. 12 illustrates the standards operational impact module and an embodiment of a scripted display or screen shot.</p>
+    <p id="p-21" num="21">[0020] FIG. 13 is a flowchart illustrating the scoring methodology for the standard rationalization phase of the system of the invention.</p>
+    <p id="p-22" num="22">[0021] Fig. 14 is a flow chart illustrating the procedures rationalization phase of the system of the invention.</p>
+    <p id="p-23" num="23">
+      <confidence value="8">4</confidence>
+ <page-break num="5"/>
+[0022] FIG. 15 is a flowchart illustrating the procedure operational impact module of the system of the invention.    </p>
+    <p id="p-24" num="24">[0023] Fig. 16 illustrates the procedure operational impact module and an embodiment of a scripted display or screen shot.</p>
+    <p id="p-25" num="25">[0024] Fig. 17 is a flow chart illustrating the mapping module of the system of the invention.</p>
+    <p id="p-26" num="26">[0025] Figs. 18 and <part-num-ref name="and">19</part-num-ref>
+ are screen shots illustrating the mapping function of one embodiment of the system of the invention.    </p>
+    <heading id="h-3">DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS</heading>
+    <p id="p-27" num="27">[0026] The present invention can most readily be understood by considering the detailed embodiments presented herein. Some of these embodiments are presented in the context of a large enterprise using a corporate intranet to facilitate the carrying out of the compliance program assessment function;</p>
+    <p id="p-28" num="28">however, these embodiments are examples only. The invention has applicability to any type of information security system in any type of organization.</p>
+    <p id="p-29" num="29">[0027] The term "organization" typically is used to refer to an entity such as a company or association that is making use of the invention. The entity can be large or small. "Standard" as used herein refers to the activities, actions, behaviors, responsibilities, or the like that are required to be enforced by an organization based on the rules applicable to the organization. A standard dictates "what to do" but does not define the detailed steps on how to do it. A standard includes imperative language, such as "must" or "required", and typically does not use informational, instructional, suggested or guidance language such as "should" or "may<confidence value="5">"</confidence>
+. "Procedure" as used herein refers to detailed security requirements that support the standards. Often procedures <part-num-ref name="standards. Often procedures">
+        <confidence value="8">5</confidence>
+      </part-num-ref>
+ <page-break num="6"/>
+refer to specific technology platforms, processes or products and describe a required or preferred way to configure software and/or protect hardware related to a platform or software product. A procedure refers to "how to do" a process in order to achieve a given standard. Procedures constitute the specific steps required to fulfill a standard. A procedure is a detailed, in-depth, step-by-step statement that articulates what is to be done to implement a security standard;    </p>
+    <p id="p-30" num="30">essentially how a standard is to be implemented given a specific technology- platform. "Requirement " as used herein refers to proposed standards and/or proposed procedures inclusively and typically comprises a statement of a proposed rule, standard or procedure that has not been rationalized using the system and tool of the invention.</p>
+    <p id="p-31" num="31">[0028] The terms, "module", "application module", and "application" are meant to refer to a specific process that is performed as part of the information security system discussed throughout. Often a module corresponds to a software application. Some modules are for processes in which an analyst collects and inputs data to the information security system. The term "work station" as used in this application is intended to encompass any device from which a person accesses the system of the invention.</p>
+    <p id="p-32" num="32">[0029] FIG. <confidence value="5">1</confidence>
+ illustrates, in block diagram form, a view of a computer- implemented embodiment of the invention as it might be implemented on a network. FIG. <confidence value="5">1</confidence>
+ shows a computing platform <part-num-ref name="computing platform">100.</part-num-ref>
+ The platform is controlled by a processor <part-num-ref name="processor">102</part-num-ref>
+ which serves as the central processing unit (CPU) for the platform. Memory <part-num-ref name="platform. Memory">104</part-num-ref>
+ is typically divided into multiple types of memory or memory areas such as read-only memory (ROM), and random access memory (RAM). A plurality of general-purpose adapters <part-num-ref name="plurality of general-purpose adapters">106</part-num-ref>
+ are present. At least one, in this example, serves to connect the computing platform to a network <part-num-ref name="network">108.</part-num-ref>
+ The network might be a corporate intranet, or simply a local area network (LAN).    </p>
+    <p id="p-33" num="33">Computer program code instructions for implementing the appropriate application modules <part-num-ref name="appropriate application modules">134,</part-num-ref>
+ <part-num-ref name="appropriate application modules 134,">136</part-num-ref>
+ and <part-num-ref name="and">138</part-num-ref>
+ are stored on the fixed disk <part-num-ref name="fixed disk">110.</part-num-ref>
+ When the system is <part-num-ref name="system is">
+        <confidence value="8">6</confidence>
+      </part-num-ref>
+ <page-break num="7"/>
+operating, the instructions are partially loaded into memory and executed by the CPU. Numerous types of general purpose computer systems and workstations are available and can be used to implement computing platform <part-num-ref name="CPU. Numerous types of general purpose computer systems and workstations are available and can be used to implement computing platform">100.</part-num-ref>
+ Available systems include those that run operating systems such as Window<confidence value="86">TM</confidence>
+ <confidence value="66">by</confidence>
+ Microsoft, various versions of UNIXTM, various versions of LinuxTM, and various versions of Apple's MacTM OS.    </p>
+    <p id="p-34" num="34">[0030] It must be noted that the entire function of the invention, including the common database can be implemented in whole or in part on a single computing platform like that shown in FIG. 1. This might be the case, for example, if a small business were to make use of the invention on a stand-alone personal computer.</p>
+    <p id="p-35" num="35">In other embodiments, however, the common database would be stored on a database server such as an SQL server, as shown at <part-num-ref name="SQL server, as shown at">114</part-num-ref>
+ of FIG. 1. In this case, fixed disk storage <part-num-ref name="of FIG. 1. In this case, fixed disk storage">118</part-num-ref>
+ contains the database. Processor <part-num-ref name="database. Processor">120,</part-num-ref>
+ adapters <part-num-ref name="database. Processor 120, adapters">122,</part-num-ref>
+ and memory <part-num-ref name="database. Processor 120, adapters 122, and memory">124</part-num-ref>
+ function similarly to those of computing platform <part-num-ref name="function similarly to those of computing platform">100.</part-num-ref>
+ If a corporate intranet is used for connectivity, the applications or modules on computing platform <part-num-ref name="applications or modules on computing platform">100</part-num-ref>
+ can be accessed from a client workstation <part-num-ref name="client workstation">130,</part-num-ref>
+ via a web page.    </p>
+    <p id="p-36" num="36">[0031] In any case, a computer program which implements parts of the invention through the use of a system like that illustrated in FIG. <confidence value="5">1</confidence>
+ can take the form of a computer program product such as MICROSOFT EXCEL spreadsheet residing on a computer usable or computer readable storage medium. Such a medium, a diskette, is shown at <part-num-ref name="diskette, is shown at">132</part-num-ref>
+ in FIG. 1. A computer program product containing the program of instructions can be supplied in such a form, and loaded on the machines involved, either directly, or over a network. The medium may also be a stream of information being retrieved when the computer program product is "downloaded" through the Internet. The computer programs can reside on any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or device. The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, <part-num-ref name="electronic, magnetic, optical,">
+        <confidence value="8">7</confidence>
+      </part-num-ref>
+ <page-break num="8"/>
+electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. Other examples of the computer-readable medium would include an electrical connection having one or more wires, a portable computer diskette or portable fixed disk, an optical fiber, a compact disc read-only memory (CD-ROM), and a digital versatile disc read-only memory (DVD-ROM). Note that the computer-usable or computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.    </p>
+    <p id="p-37" num="37">[0032] In the embodiment of Fig. 2, the system of the invention takes place via the World Wide Web and is computer-based. This network infrastructure can be used to implement example embodiments of the invention in a large corporate enterprise having a world-wide-web (WWW) enabled corporate intranet, <part-num-ref name="world-wide-web (WWW) enabled corporate intranet,">200.</part-num-ref>
+    </p>
+    <p id="p-38" num="38">Browser clients 202 access the system via a client computing platform. A lightweight directory access protocol (LDAP) server <part-num-ref name="lightweight directory access protocol (LDAP) server">204</part-num-ref>
+ provides authentication for logging into the system. A commercial software pr<confidence value="8">o</confidence>
+duct such as SiteMinderTM from Netegrity, Inc., can be used for this purpose. Simple mail transfer protocol (SMTP) server <part-num-ref name="commercial software product such as SiteMinderTM from Netegrity, Inc., can be used for this purpose. Simple mail transfer protocol (SMTP) server">206</part-num-ref>
+ may be used to generate outgoing notification E-mail messages. A corporate directory server <part-num-ref name="corporate directory server">208</part-num-ref>
+ provides access to the organization's master directory of employees and other information necessary when identifying or se<confidence value="8">l</confidence>
+ecting individuals authorized to access the system of the invention. An internet protocol (IP) switch <part-num-ref name="internet protocol (IP) switch">210</part-num-ref>
+ provides load-balancing to direct sessions to one of two application servers <part-num-ref name="provides load-balancing to direct sessions to one of two application servers">212</part-num-ref>
+ and <part-num-ref name="and">214.</part-num-ref>
+ The switch may be run under the so-called "sticky on = yes" configuration, which assures that once a session is assigned to a portal application server computing platform, the session will continue to work in/from that portal until the session is completed.    </p>
+    <p id="p-39" num="39">[0033] In this example embodiment, the application servers run using Microsoft's Internet Information Services (IIS). These servers are the launch point for the <part-num-ref name="">
+        <confidence value="8">8</confidence>
+      </part-num-ref>
+ <page-break num="9"/>
+system modules and will direct action back and forth among the other servers and databases. The common database which has been previously discussed, is implemented on an SQL server shown at <part-num-ref name="SQL server shown at">209.</part-num-ref>
+ The network of FIG. 2 also includes an <confidence value="66">II</confidence>
+S-based reporting server, <part-num-ref name="IIS-based reporting server,">220,</part-num-ref>
+ which handles report formats and similar tasks invo<confidence value="8">l</confidence>
+ved with operating the reporting module.    </p>
+    <p id="p-40" num="40">[0034] To login, a login request is directed through the IP switch to one of the portal application servers. The application server directs the request to the LDAP server for authentication and the LDAP server authenticates and forwards the request to the SQL database for authentication, confirming that the log-in is to the system. Confirmation and information about the log-in is forwarded back to the application server.</p>
+    <p id="p-41" num="41">[0035] Next, a query may be forwarded to the corporate directory, where information about the log-in is maintained. The type of information may include name, telephone number and possibly postal and Email addresses, manager, line of business or the like. The information is included in a reply and the application server copies it to the SQL database, where the information is stored.</p>
+    <p id="p-42" num="42">This operation is confirmed, and a welcome screen is generated on the work station. From that welcome page, screen shots may be presented to move through the system of the invention. Responses are entered interactively and the database is continually updated. The template resides on the app<confidence value="8">l</confidence>
+ication server and the data in the SQL database.    </p>
+    <p id="p-43" num="43">[0036] The system of the invention enables an organization to establish a set of standards and procedures in support of those standards and to link the standards to rules and procedures to the standards. The standards may be developed from rules applicable to the organization. The standards may be grouped by underlying rule; by security topic (e.g. access control, logging or monitoring or the like); by technology path (e.g. Windows Server 2003; or Net Framework or the like); or by user group (e.g. general employee, executive or the like). In order to <part-num-ref name="like). In order to">
+        <confidence value="8">9</confidence>
+      </part-num-ref>
+ <page-break num="10"/>
+develop the organization's set of standards and policies a rationalization process is used.    </p>
+    <p id="p-44" num="44">[0037] An embodiment of the rationalization process is illustrated in Fig. 3.</p>
+    <p id="p-45" num="45">Initially an organizational requirement is proposed within the organization (block 301). The requirement is typically based on a rule but may be based on any other source. The rationalization process begins with a pre-rationalization and filtering phase (block <part-num-ref name="pre-rationalization and filtering phase (block">302)</part-num-ref>
+ to determine if the requirement is a standard or a procedure and should be passed to the rationalization phase or if it should be rejected (block <part-num-ref name="rationalization phase or if it should be rejected (block">308)</part-num-ref>
+ or reviewed and remediated (block 309). Requirements that pass the pre-rationalization and filtering stage <part-num-ref name="pre-rationalization and filtering stage">302</part-num-ref>
+ are passed to either a standard rationalization phase <part-num-ref name="standard rationalization phase">305</part-num-ref>
+ or a procedure rationalization phase <part-num-ref name="procedure rationalization phase">307</part-num-ref>
+ where the requirements are rejected <part-num-ref name="requirements are rejected">308,</part-num-ref>
+ reviewed <part-num-ref name="requirements are rejected 308, reviewed">309,</part-num-ref>
+ or accepted as a standard or procedure <part-num-ref name="standard or procedure">310.</part-num-ref>
+    </p>
+    <p id="p-46" num="46">[0038<confidence value="5">]</confidence>
+ Referring to Fig. 4 the pre-rationalization and filtering module <part-num-ref name="pre-rationalization and filtering module">302</part-num-ref>
+ first determines if the proposed requirement applies to information security (block 401). If it is not applicable to information security, then it is rejected (block 308).    </p>
+    <p id="p-47" num="47">If it is applicable to information security, then it is determined if the requirement describes "what to do" (block 403). A requirement that describes "what to do" is a potential standard. If it does not describe "what to do" ("NO" in block 403), then the requirement is analyzed to determine if it describes "how to do" (block 404).</p>
+    <p id="p-48" num="48">If it does describe "how to do" ("YES" in block 404), then the requirement is flagged as a potential procedure (block 405). If it does not describe "how to do" ("NO" in block 404), then the requirement is rejected as neither a standard nor a procedure (block 308).</p>
+    <p id="p-49" num="49">[0039] If the requirement describes "what to do" ("YES" in block 403), the requirement is again analyzed to determine if it describes "how to do" (block 406). If it does describe "how to do" ("YES" in block 406), then the requirement is sent for further review (block <part-num-ref name="requirement is sent for further review (block">309)</part-num-ref>
+ because the requirement potentially describes <part-num-ref name="requirement potentially describes">
+        <confidence value="88">10</confidence>
+      </part-num-ref>
+ <page-break num="11"/>
+both a standard ("what to do") and a procedure ("how to do"). If it does not describe "how to do" ("NO" in block 406), then the requirement is flagged as a potential standard (block 408).    </p>
+    <p id="p-50" num="50">[0040] Standards include imperative language, such as "must" or "required", and typically do not use informational, instructional, suggestive and guidance language such as "should" or "may". Requirements that include non-imperative language are flagged for review (block 309), and during this review, the requirements are analyzed to determine if the requirement it is necessary or just a suggestion. If it is deemed necessary, then the requirement must be rewritten to remove any non-imperative language (e.g. change "should" to "must") and the pre-rationalization process is recommenced for the rewritten requirement.</p>
+    <p id="p-51" num="51">Requirements that are not deemed to be necessary may be considered as possible best practices, to be handled in a different process.</p>
+    <p id="p-52" num="52">[0041] The following pre-rationalization and filtering methodology is followed for both proposed procedures and proposed standards. The proposed standard/procedure is analyzed to determine if it contains only one unique standard/procedure or multiple standards/procedures (block 409). If it contains multiple standards/procedures, then the requirement is flagged for further review (block 309). During the review process, the requirement is separated into multiple singular requirements that fit the criteria for a standard or a procedure.</p>
+    <p id="p-53" num="53">The pre-rationalization process is recommenced for each requirement.</p>
+    <p id="p-54" num="54">[0042] The proposed standard/procedure is also analyzed to determine if the language is complete and can be clearly understood (block 410). Incomplete or vague requirements are flagged for further review (block 309), and are reworded based on the appropriate underlying rule. Once modified, the pre-rationalization process is recommenced for that requirement.</p>
+    <p id="p-55" num="55">
+      <confidence value="88">11</confidence>
+ <page-break num="12"/>
+[0043] The proposed standard/procedure is then analyzed to determine if it is a duplicate of a standard or procedure that has already been rationalized (block 411). In order to make this determination, a repository of all standards and procedures that have passed through the pre-rationalization and filtering phase is maintained in memory <part-num-ref name="pre-rationalization and filtering phase is maintained in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ and a keyword search is performed to ensure that the intent of the proposed standard/procedure has not already been captured by another standard or procedure. If a second comparable standard/procedure is located, both potential standards/procedures are reviewed (block <part-num-ref name="second comparable standard/procedure is located, both potential standards/procedures are reviewed (block">309)</part-num-ref>
+ to determine which standard/procedure better describes the intended objective. The better standard/procedure is maintained and the less descriptive one is removed.    </p>
+    <p id="p-56" num="56">[0044] The standard/procedure is then analyzed to determine if it is applicable to the entire organization or if the standard only applies to subset business lines and/or geographical location (block 412). Any standard/procedure that applies only to a subset of business lines and/or geographical areas may be rejected (block 308). Once these steps have been completed, the requirement can <confidence value="88">be</confidence>
+ processed for standard rationalization (block <part-num-ref name="requirement can be processed for standard rationalization (block">305)</part-num-ref>
+ if it was flagged as a standard (block <part-num-ref name="standard (block">306)</part-num-ref>
+ or processed for procedure rationalization (block <part-num-ref name="or processed for procedure rationalization (block">307)</part-num-ref>
+ if it is flagged as a procedure (block 306).    </p>
+    <p id="p-57" num="57">[0045] The pre-rationalization and filtering process described above can be operated as a scripted menu driven computer based operation. An example script is set forth in Fig. 5. Script <part-num-ref name="example script is set forth in Fig. 5. Script">500</part-num-ref>
+ may be displayed on a work station that presents a series of questions <part-num-ref name="series of questions">501</part-num-ref>
+ where the answers <part-num-ref name="answers">502</part-num-ref>
+ to those questions are entered into the system and saved in memory <part-num-ref name="system and saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ to create and maintain a repository of all standards and procedures for the organization.    </p>
+    <p id="p-58" num="58">Each question 501 is provided with a "YES" or "NO" answer choice that may me selected by clicking on an appropriate icon on the display. For requirements that are applicable to less than the entire organization, a field <part-num-ref name="field">503</part-num-ref>
+ may be provided in which the specific business line is identified.    </p>
+    <p id="p-59" num="59">
+      <confidence value="88">12</confidence>
+ <page-break num="13"/>
+[0046] Security requirements that are identified as potential standards using the pre-rationalization and filtering process described with respect to Fig. 4 are then put through a standard rationalization module <part-num-ref name="standard rationalization module">305,</part-num-ref>
+ the details of which are illustrated in Fig. 6. The rationalization module relates a standard to the reason it is being proposed as a standard (i.e. the rule) and assesses the importance of implementing the proposed standard or conversely the risk associated with not meeting the standard. The system first determines a rationalization (RAT) score for the proposed standard (block 601). The rationalization score determines the rule(s) to which the standard applies and the relative importance of that rule(s).    </p>
+    <p id="p-60" num="60">[0047] Referring to Fig. 7, in order to determine the RAT score of block <part-num-ref name="RAT score of block">601,</part-num-ref>
+ a RAT score module <part-num-ref name="RAT score module">700</part-num-ref>
+ is used. The system first identifies the potential sources of a standard (the rules). These rules may be any rule applicable to the organization. Example sources include federal regulations, industry specific regulations, legal or contractual requirements, international law, organization best practice, management directive and industry best practice. Other sources may also apply depending on the specific industry, location of the organization and the forgoing list is made by way of example only. Fig. 7 shows examples of rules (blocks 701a through 701f). The rules shown in Fig. 7 are by way of example only and other and different sources may be identified by an organization.    </p>
+    <p id="p-61" num="61">[0048] Once the potential sources of a rule are identified, a weight <part-num-ref name="weight">702</part-num-ref>
+ is assigned to each rule source 701a through 701f. In one embodiment each rule is given a percentage weight out of one-hundred percent for all the rules. In other words the sum of the percentage weights of all rules must equal 100%. In the illustrated embodiment rules 701a through 701d deal with regulations or legal requirements and are deemed to be more important than rules 701e and 701f which are organizational best practices. Thus, the first four rules <part-num-ref name="first four rules">701</part-num-ref>
+ a through 701d may be weighted more heavily than the other two rules. The weights <part-num-ref name="weights">702</part-num-ref>
+ may vary depending upon the importance of each source. The list of possible sources and the weights are saved in memory <part-num-ref name="weights are saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118.</part-num-ref>
+    </p>
+    <p id="p-62" num="62">
+      <confidence value="88">13</confidence>
+ <page-break num="14"/>
+[0050] For any proposed security standard, the specific rule from which the proposed standard is derived is identified (blocks 703). The system stores a record of the responses for each standard that is rationalized and a record for that standard is maintained in memory <part-num-ref name="record for that standard is maintained in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118.</part-num-ref>
+ For any source identified as supporting the standard, the weight percentage is multiplied by <part-num-ref name="weight percentage is multiplied by">100</part-num-ref>
+ to give a subtotal score (blocks 704). The subtotal scores for each question are summed to get a total rationalization score (RAT score) (block 705).    </p>
+    <p id="p-63" num="63">[0051] The rationalization process described above can be operated as a scripted menu driven computer based module an embodiment of which is shown in Fig. 8. The script may be displayed on a work station that is presented as a series of questions <part-num-ref name="series of questions">801</part-num-ref>
+ where the answers <part-num-ref name="answers">803</part-num-ref>
+ to those questions are entered into the system and saved in memory <part-num-ref name="system and saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ that is a repository of all standards and procedures for the organization. Each question is provided with a "YES" or "NO" answer choice that may me selected by clicking on the appropriate icon on the display. The weights <part-num-ref name="weights">802</part-num-ref>
+ are displayed and the system generates the subtotal score in fields <part-num-ref name="subtotal score in fields">805</part-num-ref>
+ for that rule as previously described. A field <part-num-ref name="field">804</part-num-ref>
+ is provided for receiving an identification of the specific rule as input such as by using a keyboard at a work station. The module calculates the total RAT score as previously described and displays this score in field <part-num-ref name="total RAT score as previously described and displays this score in field">806.</part-num-ref>
+    </p>
+    <p id="p-64" num="64">[0052] Referring again to Fig. 6, the total RAT score as determined by module <part-num-ref name="total RAT score as determined by module">700</part-num-ref>
+ is compared to a RAT threshold score (block 602). If the total RAT score is above the RAT threshold score, the requirement is moved to the risk phase (block <part-num-ref name="risk phase (block">603)</part-num-ref>
+ as will hereinafter be described. If the RAT score is below the RAT threshold score, the requirement is rejected (block 308). The RAT threshold score is determined based on the importance of the sources underlying the requirement. Some sources may be of such a nature that the organization may safely ignore a requirement from that source. Moreover, The RAT threshold may <part-num-ref name="RAT threshold may">
+        <confidence value="88">14</confidence>
+      </part-num-ref>
+ <page-break num="15"/>
+also be zero where compliance with standards derived from all sources is determined by the organization to be critical.    </p>
+    <p id="p-65" num="65">[0053] Referring again to Fig. 6, after performing the rationalization process, a standard risk module is launched where the risk associated with each qualifying standard is analyzed (block 603). Risk is the likelihood or probability that a loss of information resources or breach of security will occur if the standard is not complied with. The higher the risk, the greater the incentive is to implement the standard. The consequence of an information security risk is best defined through business impacts. When assessing risk, the analyst must understand and evaluate the business impact if the proposed security requirement is not adopted.</p>
+    <p id="p-66" num="66">[0054<confidence value="5">]</confidence>
+ Referring to Fig. 9, in order to determine risk, the standard risk module <part-num-ref name="standard risk module">900</part-num-ref>
+ is used by first identifying the potential risks (blocks <part-num-ref name="potential risks (blocks">901</part-num-ref>
+ a through <part-num-ref name="through">901</part-num-ref>
+ e) of not complying with a standard. These potential risks may be any risk applicable to the organization. Example risks include damage to the organizations reputation or brand; unauthorized disclosure of consumer, organization or associated business information; financial harm; risk to operations; and unauthorized access to the organization's Information technology assets. Other risks may also apply depending on the specific industry, location of the organization and the forgoing list is made by way of example only.    </p>
+    <p id="p-67" num="67">[0055] Once the potential risks of failing to comply with the rules are identified, the associated business impacts (blocks 902a through 902e) are identified for each risk (examples are given in Fig. 10). These business impacts set forth the real world affects of a failure to comply with a rule. These business impacts are not exhaustive and other business impacts may be identified for the <confidence value="8">l</confidence>
+isted risks or for other risks.    </p>
+    <p id="p-68" num="68">
+      <confidence value="88">15</confidence>
+ <page-break num="16"/>
+[0056] A weight <part-num-ref name="weight">903</part-num-ref>
+ is assigned to each risk. In one embodiment each risk is given a percentage weight out of one-hundred percent for all the risks. In other words the sum of the percentage weights of all risks must equal 100<confidence value="5">%</confidence>
+. The weightings may vary depending upon the importance of each business impact for the organization.    </p>
+    <p id="p-69" num="69">[0057] For each proposed security standard, it is determined if any of the risks may result because of a failure to comply with that proposed standard. For any identified risk, the weight percentage is multiplied by <part-num-ref name="weight percentage is multiplied by">100</part-num-ref>
+ to give a score (block 904a through 904e). The scores for each question are summed to get a total risk score (block 905). The total risk score provides an indication of the risk to the organization for failure to comply with the requirement.    </p>
+    <p id="p-70" num="70">[0058] The risk process described above can be operated as a scripted menu driven computer based operation. The risk module presents a script <part-num-ref name="script">1000,</part-num-ref>
+ an embodiment of which is illustrated in Fig. 10, on a display at a work station that presents a series of questions <part-num-ref name="series of questions">1001</part-num-ref>
+ to an analyst where the answers <part-num-ref name="answers">1002</part-num-ref>
+ to those questions are entered into the system and saved in memory <part-num-ref name="system and saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ to create a repository of all risks for each standard and procedure for the organization. Each question is provided with a "YES" or "NO" answer choice that may me selected by clicking on the appropriate icon on the display. The weights are displayed in field <part-num-ref name="weights are displayed in field">1003</part-num-ref>
+ and the system generates the subtotal scores as previously described that are displayed in field <part-num-ref name="subtotal scores as previously described that are displayed in field">1004.</part-num-ref>
+ The total risk score is calculated as previously described and is displayed in field <part-num-ref name="total risk score is calculated as previously described and is displayed in field">1005.</part-num-ref>
+    </p>
+    <p id="p-71" num="71">[0059] Referring again to Fig. 6, after performing the risk analysis <part-num-ref name="risk analysis">603,</part-num-ref>
+ the operational impact <part-num-ref name="operational impact">604</part-num-ref>
+ associated with each proposed standard is analyzed.    </p>
+    <p id="p-72" num="72">Operational impact is the difficulty, risk or problems associated with implementing a proposed standard. The higher the operational impact, the greater the problem for the organization to implement the standard.</p>
+    <p id="p-73" num="73">
+      <confidence value="88">16</confidence>
+ <page-break num="17"/>
+[0060] Referring to Fig. 11, in order to determine operational impact, the standard operational impact module <part-num-ref name="standard operational impact module">1100</part-num-ref>
+ is set up by first identifying the operational impacts (blocks <part-num-ref name="operational impacts (blocks">
+        <confidence value="6666">1101</confidence>
+      </part-num-ref>
+ a through <part-num-ref name="through">
+        <confidence value="6666">1101</confidence>
+      </part-num-ref>
+ g) required to comply with a standard. These impacts <part-num-ref name="standard. These impacts">
+        <confidence value="6666">1101</confidence>
+      </part-num-ref>
+ a-g may be any impact on the organization in ensuring compliance with the standard. Example operation impacts include is implementation technically feasible; the scope/magnitude of deployment; cost;    </p>
+    <p id="p-74" num="74">ability to test and validate prior to implementation; impact on performance; and is the technology available to the organization. Other operational impacts may also apply depending on the specific industry, location of the organization and the forgoing list is made by way of example only.</p>
+    <p id="p-75" num="75">[0061] Once the operational impacts <part-num-ref name="operational impacts">1101</part-num-ref>
+ are identified, a weight <part-num-ref name="weight">1102</part-num-ref>
+ is assigned to each operational impact 1101a through 1101g. In one embodiment each operational impact is given a percentage weight out of one-hundred percent for all the sources. In other words the sum of the percentage weights of all sources must equal 100%. The weightings may vary depending upon the importance of operational impact.    </p>
+    <p id="p-76" num="76">[0062] Unlike the rationalization and risk assessment analyses, operational impacts <part-num-ref name="rationalization and risk assessment analyses, operational impacts">1101</part-num-ref>
+ may be rated on a three tiered (e.g. high, medium, low) system rather than a two tired (e.g. yes/no) system. The possible "Answers" <part-num-ref name="possible &quot;Answers&quot;">1103</part-num-ref>
+ contains both the answer and the strength of value if selected. Examples of the weight and strength of value (shown in brackets) are shown in Fig. 12 in fields <part-num-ref name="in fields">1202</part-num-ref>
+ and <part-num-ref name="and">1203,</part-num-ref>
+ respectively. For operational impact No. <part-num-ref name="and 1203, respectively. For operational impact No.">2</part-num-ref>
+ the weight of the impact is 9.09% and the strength of the answers is high - 100; medium -50 and low <part-num-ref name="answers is high - 100; medium -50 and low">0.</part-num-ref>
+ For two tiered answers the strength of the answers is yes <part-num-ref name="answers is yes">0</part-num-ref>
+ and no -100 such that for a no answer the weight is multiplied by -100 and a yes answer is zero. To obtain the score for each operational impact the weight is multiplied by the answer's strength (blocks 1104). For example if an analyst answered the second question "medium", then the operational impact score would be (-50) x <part-num-ref name="operational impact score would be (-50) x">
+        <confidence value="88">17</confidence>
+      </part-num-ref>
+ <page-break num="18"/>
+(9.09%) <confidence value="5">=</confidence>
+ -4.545. Summing all of the question scores gives the total impact score, which is used for the final assessment (block 1105).    </p>
+    <p id="p-77" num="77">[0063] The rationalization process described above can be operated as a scripted menu driven computer based operation. A script <part-num-ref name="script">1200</part-num-ref>
+ is presented on a display at a work station, one embodiment of which is shown in Fig. 12, as a series of questions <part-num-ref name="series of questions">1201</part-num-ref>
+ where the answers <part-num-ref name="answers">1203</part-num-ref>
+ to those questions are entered into the system and saved in memory <part-num-ref name="system and saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ to create a repository of all standards and procedures for the organization. Each question is provided with a two-tiered "YES" or "NO" answer choice or a three-tiered "HIGH", "MED" or "LOW" answer choice that may me selected by clicking on the appropriate icon on the display. The weights are displayed in field <part-num-ref name="weights are displayed in field">1204</part-num-ref>
+ and the system generates the subtotal score for each impact as previously described and displays the scores in field <part-num-ref name="scores in field">1206.</part-num-ref>
+ The module calculates a total operational score as previously described and displays this score in field <part-num-ref name="total operational score as previously described and displays this score in field">1205.</part-num-ref>
+    </p>
+    <p id="p-78" num="78">[0064] Referring again to Fig. 6, the RAT, risk and impact scores are used to determine if a proposed standard should be established as a standard for the organization (block 605). Any standard that does not pass the rationalization stage (block <part-num-ref name="rationalization stage (block">602)</part-num-ref>
+ is immediately rejected (block <part-num-ref name="is immediately rejected (block">308)</part-num-ref>
+ and does not have to be scored and risk or impact.    </p>
+    <p id="p-79" num="79">[0065] The logical flow of scoring (block <part-num-ref name="logical flow of scoring (block">605)</part-num-ref>
+ is shown in Fig. 13. Scoring for the risk and impact section is calculated based on the answers to the questions in the risk and impact application modules. The total risk scoring can range from <part-num-ref name="total risk scoring can range from">0</part-num-ref>
+ to <part-num-ref name="to">100,</part-num-ref>
+ while the total impact scoring can range from <part-num-ref name="total impact scoring can range from">0</part-num-ref>
+ to -100. Therefore, the sum of the risk and impact scores is between -100 and <part-num-ref name="risk and impact scores is between -100 and">100.</part-num-ref>
+ This scoring framework is used in order to achieve a balance between risk and impacts. A negative risk and impact total implies that the proposed security requirement may not be worth implementing because of its high impact and low risk. On the other <part-num-ref name="other">
+        <confidence value="88">18</confidence>
+      </part-num-ref>
+ <page-break num="19"/>
+hand, a positive risk and impact total implies that a security standard should be implement because it has a high risk and low impact.    </p>
+    <p id="p-80" num="80">[0066] For each proposed standard, a determination may first be made if a critical operational impact is affected (block 1301). A critical operational impact is an impact that may prevent compliance with the standard regardless of the scoring. If such a critical operational impact is identified, the standard is rejected (block 308). If no critical operational impact is identified, the RAT score is determined as previously described with respect to Figs. 7 and <part-num-ref name="and">8</part-num-ref>
+ (block 1303). If the RAT score is below the threshold (block 1304), the requirement is rejected (block 308). If the RAT score is above the thresho<confidence value="8">l</confidence>
+d (block 1304), the risk and impact analyses are conducted as previously described with respect to Figs. 9 - <part-num-ref name="-">12</part-num-ref>
+ (block 1305).    </p>
+    <p id="p-81" num="81">[0067] The rationalization, risk and impact scores are summed to obtain a total requirement score (block 1306). If the total requirement score is greater than the accept threshold (block 1307), then the proposed requirement is accepted as a standard (b<confidence value="8">l</confidence>
+ock 310). If the total requirement score is above the "reject" threshold, but below the accept threshold (borderline scoring) (block 1310), then proposed requirement is reviewed (block 309). Standards that are reviewed must be reprocessed through risk and impact modules. If the sum is less than the reject threshold, a determination is made if a critical rationalization question was answered "yes" (block 1312). A critical realization question is one where the failure of comp<confidence value="8">l</confidence>
+iance may result in substantial harm to the organization. The use of critical risk, rationalization or impact questions enables the system to accommodate standards or procedures that may otherwise be rejected by the scoring calculations where those standards or procedures are deemed essential or critical to the organization. If one of the critical risks is answered affirmatively, then the proposed standard is reviewed (block 309). If none of the critical risks is answered affirmatively, then the proposed standard is rejected (block 308).    </p>
+    <p id="p-82" num="82">
+      <confidence value="88">19</confidence>
+ <page-break num="20"/>
+[0068] The rationalization process for procedures (block <part-num-ref name="rationalization process for procedures (block">307)</part-num-ref>
+ will now be described with respect to Fig. 14. Security requirements that have been identified as procedures and have passed the pre-rationalization and filtering process (block <part-num-ref name="pre-rationalization and filtering process (block">1401)</part-num-ref>
+ are then passed through the procedure rationalization process. Procedures can be accepted, rejected, or tagged for review.    </p>
+    <p id="p-83" num="83">[0069] A procedure is a detailed, in-depth, step-by-step statement that articulates what is to be done to implement a security standard; essentially how a standard is to be implemented given a specific technology-platform. For this reason, the rationalization and risk process used for standards, described above, are not applied to procedures. Rationalizing procedures is focused on the operational impact on the organization that the procedure introduces.</p>
+    <p id="p-84" num="84">[0070] Given that procedures are technical implementations of standards, every procedure has a respective rationalization and risk associated with it due to the standard it implements. Since a standard is associated with a particular rule, then the procedure that implements that standard is associated with the same rule. Therefore, the rationalization and risk introduced by a standard applies to the procedure that is created to comply with the standard. As a result of this relationship, the rationalization and risk scores for a procedure are obtained from the rationalization and risk scores of the standard(s) to which it maps. To be able to leverage rationalization and risk scores computed for standards in assessing procedures, each procedure must be mapped to the standard or standards is supports (block 1402).</p>
+    <p id="p-85" num="85">[0071] The RAT and risk score for the standard(s) is used as the RAT and risk score for the procedure mapped to that standard(s) (block 1403). If a procedure is mapped to a single standard, the RAT and risk score for that standard is used.</p>
+    <p id="p-86" num="86">However, if a procedure is mapped to more than one standard then several RAT and risk scores will apply to the procedure and an overall RAT and risk score must be computed. There are several methods that can be used to calculate <part-num-ref name="overall RAT and risk score must be computed. There are several methods that can be used to calculate">
+        <confidence value="88">20</confidence>
+      </part-num-ref>
+ <page-break num="21"/>
+these scores. In one embodiment, an advanced mean calculation is used based on the lowest score, the highest score, and the most likely score values. Given a sorted list of RAT and risk scores (in increasing order) the following calculation will provide a fairly accurate representation of the RAT and risk score that applies to the procedure:    </p>
+    <p id="p-87" num="87">R&amp;R - RAT and Risk scores Lowest R&amp;R - R&amp;RL Highest R&amp;R - R&amp;RH Median R&amp;R - R&amp;RM Mean R&amp;R = 1<confidence value="5">/</confidence>
+6( R&amp;RL + (<confidence value="222222">4XR&amp;RM</confidence>
+)+ R&amp;RH <confidence value="8">)</confidence>
+ The median R&amp;R is calculated as follows:    </p>
+    <p id="p-88" num="88">1. Sort the scores in an increasing order.</p>
+    <p id="p-89" num="89">2. If there is an odd number of scores, the median is the center score.</p>
+    <p id="p-90" num="90">3. If there is an even number of scores, add the two middle scores and divide by two.</p>
+    <p id="p-91" num="91">Calculation Example:</p>
+    <p id="p-92" num="92">
+      <confidence value="2">"</confidence>
+ A procedure is mapped to <part-num-ref name="procedure is mapped to">4</part-num-ref>
+ standards with the following RAT and risk scores: <part-num-ref name="following RAT and risk scores:">120,</part-num-ref>
+ <part-num-ref name="following RAT and risk scores: 120,">40,</part-num-ref>
+ <part-num-ref name="following RAT and risk scores: 120, 40,">30,</part-num-ref>
+ and <part-num-ref name="following RAT and risk scores: 120, 40, 30, and">180</part-num-ref>
+ <confidence value="2">"</confidence>
+ The scores in increasing order are <part-num-ref name="scores in increasing order are">30,</part-num-ref>
+ <part-num-ref name="scores in increasing order are 30,">40,</part-num-ref>
+ <part-num-ref name="scores in increasing order are 30, 40,">120,</part-num-ref>
+ and <part-num-ref name="scores in increasing order are 30, 40, 120, and">180</part-num-ref>
+ <confidence value="2">"</confidence>
+ The R&amp;RM= (40+120)/2 = <part-num-ref name="R&amp;RM= (40+120)/2 =">80</part-num-ref>
+ <confidence value="2">"</confidence>
+ The Mean R&amp;R = 1<confidence value="5">/</confidence>
+6*(30 + 4*80 + <part-num-ref name="Mean R&amp;R = 1/6*(30 + 4*80 +">180)</part-num-ref>
+ = 88.33 [0072] Therefore the RAT and risk score that should be used for the procedure to calculate its overall score is 88.33.    </p>
+    <p id="p-93" num="93">
+      <confidence value="88">21</confidence>
+ <page-break num="22"/>
+[0073] In another embodiment, the highest RAT and risk score (i.e. the worst case scenario) is calculated.    </p>
+    <p id="p-94" num="94">[0074] The operational impacts for the procedure is then determined (block 1404). The operational impacts associated with procedures differs from the operational impacts associated with standards. Operational impact is the difficulty, risk or problems associated with implementing a certain procedure.</p>
+    <p id="p-95" num="95">Procedures are more objective than standards and therefore the operational impact questions may be more detailed. The operational impacts and associated score for procedures are determined independently of the operational impact score for the related standard(s). After the operational impacts are determined (block <part-num-ref name="operational impacts are determined (block">1404)</part-num-ref>
+ critical operational impacts are reviewed (block 1405). If a critical operational impact is identified (block 1405), the procedure is rejected (block 308). The critical impact analysis may be used where an organization determines that one of the operational impacts prohibits the implementation of a procedure.    </p>
+    <p id="p-96" num="96">[0075] The operational impact score for the procedure is then determined (block 1406). Referring to Fig. 15, in order to determine operational impact, the procedure operational impact module is set up by first identifying the operational impacts (blocks <part-num-ref name="operational impacts (blocks">1501</part-num-ref>
+ a though <confidence value="5">1</confidence>
+501j) required to comply with the procedure.    </p>
+    <p id="p-97" num="97">These operational impacts may be any impact on the organization that results from instituting or following the procedure. Example operation impacts include implementation technical feasibility; the scope/magnitude of deployment; cost;</p>
+    <p id="p-98" num="98">ability to test and validate prior to implementation; impact on performance; and availability of the technology. Other operational impacts may also apply depending on the specific industry, location of the organization and the forgoing list is made by way of example only.</p>
+    <p id="p-99" num="99">[0076] Once the operational impacts <confidence value="6666">1501</confidence>
+a through 1501j are identified, a weight <part-num-ref name="weight">1502</part-num-ref>
+ is assigned to each operational impact. In one embodiment each <part-num-ref name="is assigned to each operational impact. In one embodiment each">
+        <confidence value="88">22</confidence>
+      </part-num-ref>
+ <page-break num="23"/>
+operational impact is given a percentage weight out of one-hundred percent for all the operational impacts. In other words the sum of the percentage weights of all sources must equal 100%. The weights may vary depending upon the importance of operational impact.    </p>
+    <p id="p-100" num="100">[0077] These operational impacts <confidence value="6666">1501</confidence>
+a through 1501<confidence value="5">j</confidence>
+ may be rated on a two tiered system (yes/no) or a three tiered (i.e. high, medium, low) system. The possible "Answers" <part-num-ref name="possible &quot;Answers&quot;">1503</part-num-ref>
+ contains both the answer and the strength of value if selected. The weight is multiplied by the answers strength (blocks 1504).    </p>
+    <p id="p-101" num="101">Examples of the weight and strength of value (shown in brackets) are shown in Fig. 16 in fields <part-num-ref name="in fields">1602</part-num-ref>
+ and <part-num-ref name="and">1603,</part-num-ref>
+ respectively. For operational impact number <part-num-ref name="and 1603, respectively. For operational impact number">5</part-num-ref>
+ the weight of the impact is 4.17% and the strength of the answers is high - 100;    </p>
+    <p id="p-102" num="102">medium -50 and low 0. To obtain the score for each operational impact the weight is multiplied by the answer's strength (block 1504). For example if an analyst answered question <part-num-ref name="analyst answered question">5</part-num-ref>
+ "medium", then the operational impact score would be (-50) x (4.17%) <confidence value="5">=</confidence>
+ -2.085. Summing all of the question scores gives the total impact score for the procedure, which is used for the final assessment (b<confidence value="8">l</confidence>
+ock 1505).    </p>
+    <p id="p-103" num="103">[0078] The rationalization process described above can be operated as a scripted menu driven computer based operation. A script <part-num-ref name="script">1600</part-num-ref>
+ is presented on a display at a work station, one embodiment of which is shown in Fig. 16, as a series of questions <part-num-ref name="series of questions">1601</part-num-ref>
+ where the answers <part-num-ref name="answers">1603</part-num-ref>
+ to those questions are entered into the system and saved in memory <part-num-ref name="system and saved in memory">104</part-num-ref>
+ or data base <part-num-ref name="or data base">118</part-num-ref>
+ to create a repository of all standards and procedures for the organization. Each question is provided with a two-tiered "YES" or "NO" answer choice or a three-tiered "HIGH", "MED" or "LOW" answer choice that may me selected by clicking on the appropriate icon on the display. The weights are displayed in field <part-num-ref name="weights are displayed in field">1602</part-num-ref>
+ and the system generates the subtotal score for each impact as previously described and displays the scores in field <part-num-ref name="scores in field">1604.</part-num-ref>
+ The module calculates a total operational score for the procedure as previously described and displays this score in field <part-num-ref name="procedure as previously described and displays this score in field">1605.</part-num-ref>
+    </p>
+    <p id="p-104" num="104">
+      <confidence value="88">23</confidence>
+ <page-break num="24"/>
+[0079] Referring again to Fig. 14, the RAT+risk score previously determined is summed with the operational impact score to obtain an overall score (block 1407). If the overall score is greater than an accept threshold (block 1408), then the procedure will be accepted (block 310). If the overall score is less than the accept threshold ("No" in block 1408), then a determination is made whether the Overall score is less than the reject threshold (block 1409). If the overall score is less than the reject threshold ("Yes" in block 1409), the procedure is rejected (block 308). If the score is in between the two thresholds ("No" in block <part-num-ref name="two thresholds (&quot;No&quot; in block">1409</part-num-ref>
+ ), the procedure must be reviewed (block 309).    </p>
+    <p id="p-105" num="105">[0080] Standards and procedures that have been targeted for review must be remediated by either modifying or rejecting the requirement. The remediation steps are determined based on the reason the requirement was sent for review.</p>
+    <p id="p-106" num="106">Every requirement marked for review should have a corresponding reason. The table below outlines the steps necessary for potential reasons.</p>
+    <p id="p-107" num="107">[0081<confidence value="5">]</confidence>
+ In the completely rationalized system, the standards and procedures are rationalized and reviewed and remediated, if needed, the procedures are mapped to the standards, and the standards are mapped to the rules. Referring to Fig. 17, the accepted standards (block <part-num-ref name="accepted standards (block">1701)</part-num-ref>
+ are first mapped to the underlying rule (block <part-num-ref name="underlying rule (block">1702)</part-num-ref>
+ before the procedures are linked to the standards to obtain a repository of mapped standards (block 1708). One advantage of mapping standards to the rules is to be able to link each standard to the regulations and best practices which improve compliance. Ideally, there is a one to one match between a standard and a rule, however there may be cases when a standard either does not map to any rule, or a standard maps to more than one rule. These cases should be reviewed.    </p>
+    <p id="p-108" num="108">[0082] One method to link a standard to a rule is to identify key words from the statement of the standard. The key words are used as search terms of the underlying rule. The rules identified from the search are reviewed and if the <part-num-ref name="">
+        <confidence value="88">24</confidence>
+      </part-num-ref>
+ <page-break num="25"/>
+security requirement of the standard has the same objective as the rule, the standard is linked to the rule.    </p>
+    <p id="p-109" num="109">[0083] The proposed procedures are then linked or mapped to the standards (block 1704). This mapping is the mapping discussed with respect to Fig. 14 as part of the procedure rationalization phase (block 1402). Ideally there should be a one to one mapping between a procedure and a standard; however, there may be cases where implementation of a procedure can realize more than one standard. These cases should be documented. The method for linking the procedures to the standards is similar to the method for linking standards to rules. Key words from the statement of the procedure are identified. The key words are used as search terms of the standards. The standards identified from the search are reviewed and if the procedure statement is the implementation of the standard statement, the procedure is linked to the standard. The procedure is accepted as previously described (block <part-num-ref name="procedure is accepted as previously described (block">1705)</part-num-ref>
+ such that each accepted procedure is mapped to the standard(s) it supports and the mapping is retained in a repository of mapped procedures (block 1706).    </p>
+    <p id="p-110" num="110">[0084] The tool has the ability to map procedures to standards. If no problems were found during the filtering stage and the security requirement is a procedure, a mapping module will be executed. The first screen <part-num-ref name="first screen">1800</part-num-ref>
+ developed by the mapping module is shown in Fig. 18 shows the procedure statement on the left panel <part-num-ref name="left panel">1801.</part-num-ref>
+ The right panel <part-num-ref name="right panel">1802</part-num-ref>
+ is used to input keywords that relate to the procedure. Once the key words are input, a search button <part-num-ref name="search button">1803</part-num-ref>
+ is selected and the linking module searches all standards in the system repository for the keywords.    </p>
+    <p id="p-111" num="111">[0085] Referring to Fig. 19, the mapping module allows a search of the keywords within the "Standards" and identifies any standards that contain the keywords in panel <part-num-ref name="keywords in panel">1901.</part-num-ref>
+ The procedure statement will be displayed in the left panel <part-num-ref name="left panel">1801.</part-num-ref>
+ In panel <part-num-ref name="left panel 1801. In panel">1902</part-num-ref>
+ the standard statement corresponding to the standard that is <part-num-ref name="standard that is">
+        <confidence value="88">25</confidence>
+      </part-num-ref>
+ <page-break num="26"/>
+highlighted in panel <part-num-ref name="highlighted in panel">1901</part-num-ref>
+ is displayed. A side-by-side comparison of the procedure and standard statement can be made to easily identify if the procedure and standard are related. If the procedure statement is in fact an implementation of the current standard statement, then the user can press an enter button <part-num-ref name="enter button">1903</part-num-ref>
+ to automatically map or link the standard with the procedure. The user will press "Done" when the mapping is completed. Once the mapping is complete, every procedure will be linked to its related standard and each standard will be linked to its related rule.    </p>
+    <p id="p-112" num="112">[0086] Once the responses are captured in data base <part-num-ref name="responses are captured in data base">118</part-num-ref>
+ the data can be retrieved by the organization to review and update the data or to monitor the information security standardization of the organization. The data stored can also be reported in a variety of formats. This reporting, for example, can be used to show the standards and procedures of an organization or any subset of information. Standard reports may be automatically developed and presented by a reporting module. A copy of the reports may be distributed to appropriate levels of the organization to monitor and manage the standardization activities of the organization. The standardization process and data base may be updated periodically such as quarterly to ensure that the organization is current in its standards compliance activities. Because the underlying rules, the applicable standards, the related processes and the scores are maintained in the data base a historical record is maintained for organization. Thus, the rationalization methodology provides foundation criteria based decision making, which can be used for historical reference, standards justification and support of the standard or process.    </p>
+    <p id="p-113" num="113">[0087] Specific embodiments of an invention are described herein. One of ordinary skil<confidence value="8">l</confidence>
+ in the computing and networking arts will quickly recognize that the invention has other applications in other environments. In fact, many embodiments and implementations are possible. The following claims are in no <part-num-ref name="following claims are in no">
+        <confidence value="88">26</confidence>
+      </part-num-ref>
+ <page-break num="27"/>
+way intended to limit the scope of the invention to the specific embodiments described above.    </p>
+    <p id="p-114" num="114">
+      <confidence value="88">27</confidence>
+     </p>
+  </description>
+</us-patent-application>
+

applicant/11451023.xml

@@ -0,0 +1,477 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11451023</doc-number>
+        <date>2006-06-12</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">RULE MANAGEMENT USING A CONFIGURATION DATABASE</heading>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">[0001<confidence value="5">]</confidence>
+ The present invention relates in general to the field of computers and other data processing systems, including hardware, software and processes. More particularly, the present invention pertains to the management of the resources of a data processing system using rules and/or policies.    </p>
+    <p id="p-2" num="2">[0002] Enterprise behavior is governed by policies that, in some cases, are translated into rules for computing resources. For example, an enterprise may have an enterprise policy (e.g., a corporate policy) that dictates that passwords used by computer resources (including hardware and software) must be "strong" (difficult to bypass or "break"). Such a policy may translate into a "rule," such as a rule that "passwords must be eight characters in length." [0003<confidence value="5">]</confidence>
+ In some software applications, such a rule is abstracted from software code in the software application. For example, an application might include a function call such as "checkPasswordStrength<confidence value="4">o</confidence>
+". In a case such as this, the function call can invoke a rules engine, which makes adopting policy-based changes easier. Thus, if the password-strength requirement went from six characters to eight characters, applications using this strategy would only have to change one rule (e.g., changing "if (length&gt;6)" to "if (length&gt;8)").    </p>
+    <p id="p-3" num="3">[0004] Unfortunately, the scenario described above rarely exists consistently in the real world.</p>
+    <p id="p-4" num="4">That is, in an ideal world, every enterprise resource (e.g., software applications, hardware, etc) would have a variable or a call routine that would go to a central repository to obtain a current value (e.g., password length must be &lt;eight&gt; characters). However, many applications are hard coded, are overridden by a configuration parameter set by an administrator, are governed by another rule system, etc. For example, a line of code may be hard coded as "password length must be six characters" instead of soft coded as "password length must be &lt;VARIABLE&gt; characters." When a system rule changes from requiring six characters to requiring eight <boundary-data type="header">RSW920060092US<confidence value="4">1</confidence>
+                         - 1 -      </boundary-data>
+      <page-break num="2"/>
+characters for a password, verifying that each and every hard coded application complies with this rule change can be difficult if not unreasonable impractical. If compliance with the rule change is mandatory, such as a requirement to be compliant with an industry standard, a governmental regulation, or a law, failing to amend the hard coding can have serious consequences.    </p>
+    <boundary-data type="header">RSW920060092US1                        - <confidence value="8">2</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-3">SUMMARY OF THE INVENTION</heading>
+    <p id="p-5" num="5">
+      <page-break num="3"/>
+      <confidence value="5">[</confidence>
+0005<confidence value="5">]</confidence>
+ To address the problem described above, a Configuration Management DataBase (CMDB) is utilized when determining if resources, which are modeled in and managed by the CMDB, are in compliance with a newly implemented resource rule. Thus, in one embodiment of a computer-implementable method, system and computer-usable medium, the computer- implementable method includes the step of, in response to detecting a rule change, transmitting a new rule to a rule control logic in a resource management database, wherein the rule change changes a rule for an attribute of a resource in a data processing system, and wherein the resource management database describes attributes of resources in the data processing system.    </p>
+    <p id="p-6" num="6">
+      <confidence value="5">[</confidence>
+0006] The method may include the further step of transmitting the new rule from the rule control logic to a resource manager, wherein the resource manager is a person who has the capacity to implement the new rule in a resource in the data processing system. In embodiment in which the resource management database is a Configuration Management Database (CMDB), the computer-implementable method may include the additional step of transmitting a watch message from the rule control logic to a Configuration Item (CI) in a CMDB, wherein the C<confidence value="5">I</confidence>
+ contains a shadow copy of attribute configurations for resources managed by the CMDB, and wherein the watch message instructs the C<confidence value="5">I</confidence>
+ to watch for a certification entry from the resource manager, and wherein the certification entry identifies the resource as being in compliance with the new rule.    </p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0007] Furthermore, the computer-implementable method may include the steps of: in response to the resource manager implementing the new rule in the resource, receiving a certification entry in the C<confidence value="5">I</confidence>
+ indicating that the resource is in compliance with the new rule; transmitting a certification message from the C<confidence value="5">I</confidence>
+ to a certification control in the CMDB, wherein the certification message indicates that the resource is in compliance with the new rule; and transmitting a compliance summary from the certification control to an enterprise's Information Systems (IS) manager, wherein the compliance summary describes a compliance status for multiple resources in the data processing system, and wherein the compliance status describes whether a resource has or has not implemented the new rule.    </p>
+    <boundary-data type="header">
+      <confidence value="86">RS</confidence>
+W920060092US1                         - <confidence value="8">3</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-8" num="8">
+      <page-break num="4"/>
+[0008] The above, as well as additional purposes, features, and advantages of the present invention will become apparent in the following detailed written description.    </p>
+    <boundary-data type="header">RSW920060092US1                       - <confidence value="8">4</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-9" num="9">
+      <page-break num="5"/>
+[0009] The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further purposes and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, where:    </p>
+    <p id="p-10" num="10">[0010] Figure 1 depicts an exemplary Configuration Management Database (CMDB) contemplated for use by the present invention;</p>
+    <p id="p-11" num="11">
+      <confidence value="5">[</confidence>
+0011] Figure 2 is a flow-chart showing exemplary steps taken in the present invention to determine if enterprise resources are in compliance with one or more C<confidence value="5">I</confidence>
+ rules and/or their associated enterprise policies;    </p>
+    <p id="p-12" num="12">[0012] Figure 3 depicts an exemplary client computer in which the present invention may implemented;</p>
+    <p id="p-13" num="13">[0013] Figure 4 illustrates an exemplary server from which software for executing the present invention may be deployed and/or implemented for the benefit of a user of the client computer shown in Figure 3;</p>
+    <p id="p-14" num="14">[0014<confidence value="5">]</confidence>
+ Figures <confidence value="5">5</confidence>
+a-b show a flow-chart of steps taken to deploy software capable of executing the steps shown and described in Figures 1-2; and [0015<confidence value="5">]</confidence>
+ Figures 6a-b show a flow-chart showing steps taken to execute the steps shown and described in Figures 1-2 using an on-demand service provider.    </p>
+    <boundary-data type="header">RSW920060092US1                         - <confidence value="8">5</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-5">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT</heading>
+    <p id="p-15" num="15">
+      <page-break num="6"/>
+      <confidence value="5">[</confidence>
+0016] In the present invention, a Configuration Management Database (CMDB) is a unified repository of information. An exemplary CMDB, as modified by and used in the present invention, is also capable of storing other data such as rules and policies related to all resources in an Information System (IS). As such, the CMDB allows an enterprise to understand relationships between resources (including both IS hardware and software) and to track their configuration. Included in the CMDB are Configuration Items (CI) and details about relationships between CIs. A C<confidence value="5">I</confidence>
+ is defined as an instance of a resource that has configurable attributes, such as hardware resources (e.g., storage devices, servers, routers, etc.) as well as software resources (applications, databases, etc.).    </p>
+    <p id="p-16" num="16">[0017] Thus, as described herein, the present invention extends the CMDB to include fields such that each resource has a list of rules that are enforced by the enterprise. In one embodiment, this enforcement is performed by the CMDB. Dependencies between a rule and a corporate policy may be stored within or outside the CMDB. When a change in a "policy" (i.e., a high-level rule) or other change (e.g., a change to the technological requirements and/or abilities of an enterprises data processing system) is made, a CMDB linked list (found in a rule control logic) of C<confidence value="5">I</confidence>
+ rules is traversed to find all resources that are or should be implementing the new rule. Owners of those resources are (preferably automatically) asked to certify that the resources comply with the new (changed) rule, preferably within a specified period of time. After the specified period of time, tracked non-compliant resources are marked as out-of-compliance, and reported as such to the enterprise's Information Systems (IS) manager. Indicators of compliance and/or non-compliance can be stored as a CMDB Configuration Item in a certification control database in the CMDB.    </p>
+    <p id="p-17" num="17">Alternatively, compliance tracking information may be performed by directly monitoring certification entries in the C<confidence value="5">I</confidence>
+'s.    </p>
+    <p id="p-18" num="18">[0018] With reference now to the figures, and in particular to Figure 1, an exemplary Configuration Management Database (CMDB) <part-num-ref name="exemplary Configuration Management Database (CMDB)">100,</part-num-ref>
+ having novel modifications that are contemplated by the present invention, is presented. CMDB <part-num-ref name="present invention, is presented. CMDB">100</part-num-ref>
+ manages multiple resources 102a-n, which are software and hardware computer resources in an enterprise's data processing <boundary-data type="header">
+        <confidence value="86">RS</confidence>
+W920060092U<confidence value="54">S1</confidence>
+                         <confidence value="8">-</confidence>
+ <confidence value="8">6</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+system, which may be a network (virtual or actual), a stand-alone computer, or any other Information Technology (IT) environment.     Each resource <part-num-ref name="stand-alone computer, or any other Information Technology (IT) environment.     Each resource">102</part-num-ref>
+ has a corresponding Configuration Item (CI) 104a-n, each of which provides a description of attributes of a particular resource <part-num-ref name="particular resource">102.</part-num-ref>
+ These attributes include, but are not limited to, security requirements, addresses, and other configuration items for a particular resource.    </p>
+    <p id="p-19" num="19">[0019] Consider now, for exemplary purposes, a resource attribute that is related to how long a password should be for a user to access that resource. This resource attribute is described by a <confidence value="86">CI</confidence>
+ rule <part-num-ref name="CI rule">108.</part-num-ref>
+ There may be multiple C<confidence value="5">I</confidence>
+ rules <part-num-ref name="CI rule 108. There may be multiple CI rules">108,</part-num-ref>
+ including the shown CI rules 108a-b. Each CI rule may be linked to a policy <part-num-ref name="policy">106,</part-num-ref>
+ such as the depicted policies 106a-b. For example, assume that CI rule 108b is a rule for a minimum password length ("PasswordLen"). This rule may be changed in response to a change in an enterprise policy 106b, which states that certain or all resources <part-num-ref name="enterprise policy 106b, which states that certain or all resources">102</part-num-ref>
+ in the enterprise must have a "Strong Password" to permit access to that resource.    </p>
+    <p id="p-20" num="20">Note that policy 106 is merely an enterprise directive, while C<confidence value="5">I</confidence>
+ rule<confidence value="66">10</confidence>
+8 creates an actual rule that can be understood by a resource and/or the <confidence value="685">CMD</confidence>
+B <part-num-ref name="CMDB">100.</part-num-ref>
+    </p>
+    <p id="p-21" num="21">
+      <confidence value="5">[</confidence>
+0020] Continuing with Figure 1, a C<confidence value="5">I</confidence>
+ rule <part-num-ref name="CI rule">108</part-num-ref>
+ may be passed to a rule control logic <part-num-ref name="rule control logic">110,</part-num-ref>
+ which controls, inter alia, which resources <part-num-ref name="rule control logic 110, which controls, inter alia, which resources">102</part-num-ref>
+ must implement a particular C<confidence value="5">I</confidence>
+ rule <part-num-ref name="particular CI rule">108.</part-num-ref>
+ For example, rule control logic <part-num-ref name="particular CI rule 108. For example, rule control logic">110</part-num-ref>
+ may determine (e.g., via a lookup table or a linked list contained within rule control logic 110), that Resource <part-num-ref name="linked list contained within rule control logic 110), that Resource">2</part-num-ref>
+ (102b) and Resource n (102n) must both implement CI rule 108b, which requires a resource to use a password of a particular length (e.g., six characters). Upon notification that a CI rule <part-num-ref name="CI rule">108</part-num-ref>
+ has changed (resulting in a new rule), rule control logic <part-num-ref name="new rule), rule control logic">110</part-num-ref>
+ performs two operations: <part-num-ref name="performs two operations:">1)</part-num-ref>
+ rule control logic <part-num-ref name="rule control logic">110</part-num-ref>
+ sends a notification to a resource administrator <part-num-ref name="resource administrator">112</part-num-ref>
+ of the new rule; and <part-num-ref name="new rule; and">2)</part-num-ref>
+ rule control logic <part-num-ref name="rule control logic">110</part-num-ref>
+ creates a certification entry <part-num-ref name="certification entry">114</part-num-ref>
+ in appropriate C<confidence value="5">I</confidence>
+'s <part-num-ref name="in appropriate CI's">104.</part-num-ref>
+ For example, assume that CI rule 108b represents a new rule requiring longer (e.g., eight characters) passwords to be used by a resource <part-num-ref name="resource">102.</part-num-ref>
+ If the affected resources are Resource <part-num-ref name="affected resources are Resource">2</part-num-ref>
+ (102b) and Resource n (102n), then rule control logic <part-num-ref name="(102b) and Resource n (102n), then rule control logic">110</part-num-ref>
+ sends a message to a Resource <part-num-ref name="Resource">2</part-num-ref>
+ administrator (112b) and a Resource n administrator (112n) informing these persons that the respective resources <part-num-ref name="respective resources">102</part-num-ref>
+ under their management need to implement the new C<confidence value="5">I</confidence>
+ rule 108b. These resource administrators <part-num-ref name="new CI rule 108b. These resource administrators">112</part-num-ref>
+ implement the new C<confidence value="5">I</confidence>
+ rule 108b in their respective resources <part-num-ref name="new CI rule 108b in their respective resources">102,</part-num-ref>
+ and also set a flag or other setting in the respective certification entry <boundary-data type="header">RSW920060092US1                          - <confidence value="8">7</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <part-num-ref name="respective certification entry">114</part-num-ref>
+ (114b and 114n in the present example) in a corresponding C<confidence value="5">I</confidence>
+ <part-num-ref name="corresponding CI">104</part-num-ref>
+ (i.e., 104b and 104n) that the new rule has been implemented, thus certifying the particular resource <part-num-ref name="particular resource">102</part-num-ref>
+ as being in compliance with the new C<confidence value="5">I</confidence>
+ rule 108b. To provide a central repository of which resources <part-num-ref name="central repository of which resources">102</part-num-ref>
+ are compliant with new rules <part-num-ref name="are compliant with new rules">108,</part-num-ref>
+ the information in the certification entries <part-num-ref name="certification entries">114</part-num-ref>
+ (including the compliance status described above) may be stored in a certification control <part-num-ref name="certification control">116.</part-num-ref>
+ The certification control <part-num-ref name="certification control">116</part-num-ref>
+ may send an enterprise's IS manager <part-num-ref name="enterprise's IS manager">118</part-num-ref>
+ a compliance summary describing the implementation status of new rules <part-num-ref name="implementation status of new rules">108</part-num-ref>
+ in various resources <part-num-ref name="in various resources">102.</part-num-ref>
+ Note that the IS manager <part-num-ref name="IS manager">118</part-num-ref>
+ may have been forewarned (to watch for these compliances) by sending the new CI rule 108b to the IS manager <part-num-ref name="IS manager">118</part-num-ref>
+ at or near the time that the new C<confidence value="5">I</confidence>
+ rule 108b was sent to the rule control logic <part-num-ref name="rule control logic">110</part-num-ref>
+ and beyond.    </p>
+    <p id="p-22" num="22">
+      <confidence value="5">[</confidence>
+0021<confidence value="5">]</confidence>
+ With reference now to Figure 2, a flow-chart describing the steps reference in Figure 1 (whose components are again reference herein) is presented. After initiator block <part-num-ref name="(whose components are again reference herein) is presented. After initiator block">200,</part-num-ref>
+ a query is made (query block <part-num-ref name="query is made (query block">202)</part-num-ref>
+ to determine if a C<confidence value="5">I</confidence>
+ rule has changed, resulting in a new rule for an attribute of a resource. This rule change may have been the result of a change (block <part-num-ref name="change (block">204)</part-num-ref>
+ to an enterprise policy <part-num-ref name="enterprise policy">106,</part-num-ref>
+ as described in Figure 1. If a C<confidence value="5">I</confidence>
+ rule has changed, then the new rule is sent to the rule control logic <part-num-ref name="rule control logic">110</part-num-ref>
+ (block 206), which sends a message (i.e., creates a certification entry <part-num-ref name="certification entry">114)</part-num-ref>
+ to a C<confidence value="5">I</confidence>
+ <part-num-ref name="CI">104</part-num-ref>
+ that instructs the CI <part-num-ref name="CI">104</part-num-ref>
+ to watch for a certification message from a resource manager that a resource associated with that C<confidence value="5">I</confidence>
+ has implemented the new rule (block 208). Optionally, a new rule notification may be sent to an Information Systems (IS) manager, forewarning the IS manager that a new rule needs to be implemented in one or more resources (block 210).    </p>
+    <p id="p-23" num="23">
+      <confidence value="5">[</confidence>
+0022<confidence value="5">]</confidence>
+ As described at block 212, the appropriate resource manager is notified of the new C<confidence value="5">I</confidence>
+ rule. The resource manager implements the new rule in the appropriate resource (block 214), and makes a certification entry in that resource's C<confidence value="5">I</confidence>
+ indicating that the new rule has been implemented, and thus that resource is in compliance with the new rule (block 216). Note that besides setting an appropriate flag in the certification entry (as described in block 216), the rest of the C<confidence value="5">I</confidence>
+ is also updated (block <part-num-ref name="CI is also updated (block">218)</part-num-ref>
+ to reflect (shadow) the updated configuration of the resource. A certification message is sent from the appropriate certification entry <part-num-ref name="appropriate certification entry">114</part-num-ref>
+ (in the CI <part-num-ref name="CI">104)</part-num-ref>
+ to the certification control <part-num-ref name="certification control">116.</part-num-ref>
+ The certification control <part-num-ref name="certification control">116</part-num-ref>
+ may send a compliance <boundary-data type="header">
+        <confidence value="86">RS</confidence>
+W920060092U<confidence value="5">S</confidence>
+1                         - <confidence value="8">8</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+summary, of the compliance status of some or all enterprise resources, to the enterprise's IS manager (block 222). The process thus ends at terminator block <part-num-ref name="process thus ends at terminator block">224.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">[0023<confidence value="5">]</confidence>
+ With reference now to Figure 3, there is depicted a block diagram of an exemplary client computer <part-num-ref name="exemplary client computer">302,</part-num-ref>
+ in which the present invention may be utilized. Client computer <part-num-ref name="present invention may be utilized. Client computer">302</part-num-ref>
+ includes a processor unit <part-num-ref name="processor unit">304</part-num-ref>
+ that is coupled to a system bus <part-num-ref name="system bus">306.</part-num-ref>
+ A video adapter <part-num-ref name="video adapter">308,</part-num-ref>
+ which drives/supports a display <part-num-ref name="display">310,</part-num-ref>
+ is also coupled to system bus <part-num-ref name="display 310, is also coupled to system bus">306.</part-num-ref>
+ System bus <part-num-ref name="display 310, is also coupled to system bus 306. System bus">306</part-num-ref>
+ is coupled via a bus bridge <part-num-ref name="bus bridge">312</part-num-ref>
+ to an Input/Output (<confidence value="224">11O</confidence>
+) bus <part-num-ref name="Input/Output (11O) bus">314.</part-num-ref>
+ An <confidence value="665">I/O</confidence>
+ interface <part-num-ref name="I/O interface">316</part-num-ref>
+ is coupled to <confidence value="665">I/O</confidence>
+ bus <part-num-ref name="is coupled to I/O bus">314.</part-num-ref>
+ <confidence value="665">I/O</confidence>
+ interface <part-num-ref name="is coupled to I/O bus 314. I/O interface">316</part-num-ref>
+ affords co<confidence value="8">m</confidence>
+munication with various <confidence value="665">I/O</confidence>
+ devices, including a keyboard <part-num-ref name="keyboard">318,</part-num-ref>
+ a mouse <part-num-ref name="mouse">320,</part-num-ref>
+ a Compact Disk - Read Only Memory (CD-ROM) drive <part-num-ref name="Compact Disk - Read Only Memory (CD-ROM) drive">322,</part-num-ref>
+ a floppy disk drive <part-num-ref name="floppy disk drive">324,</part-num-ref>
+ and a flash drive memory <part-num-ref name="flash drive memory">326.</part-num-ref>
+ The format of the ports connected to <confidence value="665">I/0</confidence>
+ interface <part-num-ref name="ports connected to I/0 interface">316</part-num-ref>
+ may be any known to those skilled in the art of computer architecture, including but not limited to Universal Serial Bus (USB) ports.    </p>
+    <p id="p-25" num="25">
+      <confidence value="5">[</confidence>
+0024] Client computer 302 is able to communicate with a service provider server <part-num-ref name="service provider server">402</part-num-ref>
+ via a network <part-num-ref name="network">328</part-num-ref>
+ using a network interface <part-num-ref name="network interface">330,</part-num-ref>
+ which is coupled to system bus <part-num-ref name="network interface 330, which is coupled to system bus">306.</part-num-ref>
+ Network <part-num-ref name="network interface 330, which is coupled to system bus 306. Network">328</part-num-ref>
+ may be an external network such as the Internet, or an internal network such as an Ethernet or a Virtual Private Network (VPN). Using network <part-num-ref name="Virtual Private Network (VPN). Using network">328,</part-num-ref>
+ client computer <part-num-ref name="Virtual Private Network (VPN). Using network 328, client computer">302</part-num-ref>
+ is able to use the present invention to access service provider server <part-num-ref name="present invention to access service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-26" num="26">[0025] A hard drive interface <part-num-ref name="hard drive interface">332</part-num-ref>
+ is also coupled to system bus <part-num-ref name="is also coupled to system bus">306.</part-num-ref>
+ Hard drive interface <part-num-ref name="is also coupled to system bus 306. Hard drive interface">332</part-num-ref>
+ interfaces with a hard drive <part-num-ref name="hard drive">334.</part-num-ref>
+ In a preferred embodiment, hard drive <part-num-ref name="preferred embodiment, hard drive">334</part-num-ref>
+ populates a system memory <part-num-ref name="system memory">336,</part-num-ref>
+ which is also coupled to system bus <part-num-ref name="system memory 336, which is also coupled to system bus">306.</part-num-ref>
+ Data that populates system memory <part-num-ref name="system memory 336, which is also coupled to system bus 306. Data that populates system memory">336</part-num-ref>
+ includes client computer 302's operating system (<confidence value="66">OS</confidence>
+) <part-num-ref name="includes client computer 302's operating system (OS)">338</part-num-ref>
+ and application programs <part-num-ref name="and application programs">344.</part-num-ref>
+    </p>
+    <p id="p-27" num="27">[0026] <confidence value="66">OS</confidence>
+ 338 includes a shell <part-num-ref name="shell">340,</part-num-ref>
+ for providing transparent user access to resources such as application programs <part-num-ref name="shell 340, for providing transparent user access to resources such as application programs">344.</part-num-ref>
+ Generally, shell <part-num-ref name="shell 340, for providing transparent user access to resources such as application programs 344. Generally, shell">340</part-num-ref>
+ is a program that provides an interpreter and an interface between the user and the operating system. More specifically, shell <part-num-ref name="operating system. More specifically, shell">340</part-num-ref>
+ executes commands that are entered into a command line user interface or from a file. Thus, shell <part-num-ref name="file. Thus, shell">340</part-num-ref>
+ (as it is called in UNIX<confidence value="5">®</confidence>
+), also called a command processor in Windows<confidence value="4">®</confidence>
+, is generally the highest level of the operating system software hierarchy and serves as a command interpreter. The shell <boundary-data type="header">
+        <confidence value="86">RS</confidence>
+W920060092U<confidence value="54">S1</confidence>
+                        <confidence value="8">-</confidence>
+ <confidence value="8">9</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel <part-num-ref name="kernel">342)</part-num-ref>
+ for processing. Note that while shell <part-num-ref name="for processing. Note that while shell">340</part-num-ref>
+ is a text-based, line-oriented user interface, the present invention will equally well support other user interface modes, such as graphical, voice, gestural, etc.    </p>
+    <p id="p-28" num="28">[0027] As depicted, OS 338 also includes kernel <part-num-ref name="also includes kernel">342,</part-num-ref>
+ which includes lower levels of functionality for OS <part-num-ref name="also includes kernel 342, which includes lower levels of functionality for OS">338,</part-num-ref>
+ including providing essential services required by other parts of OS <part-num-ref name="also includes kernel 342, which includes lower levels of functionality for OS 338, including providing essential services required by other parts of OS">338</part-num-ref>
+ and application programs <part-num-ref name="and application programs">344,</part-num-ref>
+ including memory management, process and task management, disk management, and mouse and keyboard management.    </p>
+    <p id="p-29" num="29">[0028] Application programs 344 include a browser <part-num-ref name="browser">346.</part-num-ref>
+ Browser <part-num-ref name="browser 346. Browser">346</part-num-ref>
+ includes program modules and instructions enabling a World Wide Web (WWW) client (i.e., client computer <part-num-ref name="client computer">302)</part-num-ref>
+ to send and receive network messages to the Internet using HyperText Transfer Protocol (HTTP) messaging, thus enabling communication with service provider server <part-num-ref name="Internet using HyperText Transfer Protocol (HTTP) messaging, thus enabling communication with service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-30" num="30">[0029] Application programs 344 in client computer 302's system memory also include a Rule Management Program (RMP) <part-num-ref name="Rule Management Program (RMP)">348,</part-num-ref>
+ which includes code for implementing the processes described in Figures 1-2. In one embodiment, client computer <part-num-ref name="processes described in Figures 1-2. In one embodiment, client computer">302</part-num-ref>
+ is able to download RMP <part-num-ref name="is able to download RMP">348</part-num-ref>
+ from service provider server <part-num-ref name="from service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">[0030] The hardware elements depicted in client computer <part-num-ref name="hardware elements depicted in client computer">302</part-num-ref>
+ are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention.    </p>
+    <p id="p-32" num="32">For instance, client computer 302 may include alternate memory storage devices such as magnetic cassettes, Digital Versatile Disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.</p>
+    <p id="p-33" num="33">[0031<confidence value="5">]</confidence>
+ As noted above, RMP 348 can be downloaded to client computer <part-num-ref name="can be downloaded to client computer">302</part-num-ref>
+ from service provider server <part-num-ref name="from service provider server">402,</part-num-ref>
+ shown in exemplary form in Figure 4. Service provider server <part-num-ref name="from service provider server 402, shown in exemplary form in Figure 4. Service provider server">402</part-num-ref>
+ includes a processor unit <part-num-ref name="processor unit">404</part-num-ref>
+ that is coupled to a system bus <part-num-ref name="system bus">406.</part-num-ref>
+ A video adapter <part-num-ref name="video adapter">408</part-num-ref>
+ is also coupled to <boundary-data type="header">RSW920060092US1                        <confidence value="6">-</confidence>
+ <confidence value="88">10</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+system bus <part-num-ref name="is also coupled to system bus">406.</part-num-ref>
+ Video adapter <part-num-ref name="is also coupled to system bus 406. Video adapter">408</part-num-ref>
+ drives/supports a display <part-num-ref name="display">410.</part-num-ref>
+ System bus <part-num-ref name="display 410. System bus">406</part-num-ref>
+ is coupled via a bus bridge <part-num-ref name="bus bridge">412</part-num-ref>
+ to an Input/Output (<confidence value="555">1/0</confidence>
+) bus <part-num-ref name="Input/Output (1/0) bus">414.</part-num-ref>
+ An <confidence value="555">1/0</confidence>
+ interface <part-num-ref name="1/0 interface">416</part-num-ref>
+ is coupled to <confidence value="254">I/O</confidence>
+ bus <part-num-ref name="is coupled to I/O bus">414.</part-num-ref>
+ <confidence value="685">I/O</confidence>
+ interface <part-num-ref name="is coupled to I/O bus 414. I/O interface">416</part-num-ref>
+ affords communication with various <confidence value="686">I/O</confidence>
+ devices, including a keyboard <part-num-ref name="keyboard">418,</part-num-ref>
+ a mouse <part-num-ref name="mouse">420,</part-num-ref>
+ a Compact Disk - Read Only Memory (CD-ROM) drive <part-num-ref name="Compact Disk - Read Only Memory (CD-ROM) drive">422,</part-num-ref>
+ a floppy disk drive <part-num-ref name="floppy disk drive">424,</part-num-ref>
+ and a flash drive memory <part-num-ref name="flash drive memory">426.</part-num-ref>
+ The format of the ports connected to <confidence value="555">1/0</confidence>
+ interface <part-num-ref name="ports connected to 1/0 interface">416</part-num-ref>
+ may be any known to those skilled in the art of computer architecture, including but not limited to Universal Serial Bus (USB) ports.    </p>
+    <p id="p-34" num="34">[0032] Service provider server 402 is able to communicate with client computer <part-num-ref name="is able to communicate with client computer">302</part-num-ref>
+ via network <part-num-ref name="via network">328</part-num-ref>
+ using a network interface <part-num-ref name="network interface">430,</part-num-ref>
+ which is coupled to system bus <part-num-ref name="network interface 430, which is coupled to system bus">406.</part-num-ref>
+ Access to network <part-num-ref name="network interface 430, which is coupled to system bus 406. Access to network">328</part-num-ref>
+ allows service provider server <part-num-ref name="allows service provider server">402</part-num-ref>
+ to execute and/or download RMP <part-num-ref name="to execute and/or download RMP">348</part-num-ref>
+ to client computer <part-num-ref name="to client computer">302.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">[0033] System bus 406 is also coupled to a hard drive interface <part-num-ref name="hard drive interface">432,</part-num-ref>
+ which interfaces with a hard drive <part-num-ref name="hard drive">434.</part-num-ref>
+ In a preferred embodiment, hard drive <part-num-ref name="preferred embodiment, hard drive">434</part-num-ref>
+ populates a system memory <part-num-ref name="system memory">436,</part-num-ref>
+ which is also coupled to system bus <part-num-ref name="system memory 436, which is also coupled to system bus">406.</part-num-ref>
+ Data that populates system memory <part-num-ref name="system memory 436, which is also coupled to system bus 406. Data that populates system memory">436</part-num-ref>
+ includes service provider server 402's operating system <part-num-ref name="includes service provider server 402's operating system">438,</part-num-ref>
+ which includes a shell <part-num-ref name="shell">440</part-num-ref>
+ and a kernel <part-num-ref name="kernel">442.</part-num-ref>
+ Shell <part-num-ref name="kernel 442. Shell">440</part-num-ref>
+ is incorporated in a higher level operating system layer and utilized for providing transparent user access to resources such as application programs <part-num-ref name="higher level operating system layer and utilized for providing transparent user access to resources such as application programs">444,</part-num-ref>
+ which include a browser <part-num-ref name="browser">446,</part-num-ref>
+ and a copy of RMP <part-num-ref name="copy of RMP">348</part-num-ref>
+ described above, which can be deployed to client computer <part-num-ref name="described above, which can be deployed to client computer">302.</part-num-ref>
+    </p>
+    <p id="p-36" num="36">[0034] The hardware elements depicted in service provider server <part-num-ref name="hardware elements depicted in service provider server">402</part-num-ref>
+ are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, service provider server <part-num-ref name="present invention. For instance, service provider server">402</part-num-ref>
+ may include alternate memory storage devices such as flash drives, magnetic cassettes, Digital Versatile Disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.    </p>
+    <p id="p-37" num="37">
+      <confidence value="5">[</confidence>
+0035<confidence value="5">]</confidence>
+ Note further that, in a preferred embodiment of the present invention, service provider server <part-num-ref name="present invention, service provider server">402</part-num-ref>
+ performs all of the functions associated with the present invention (including execution of R<confidence value="5">M</confidence>
+P 348), thus freeing client computer <part-num-ref name="present invention (including execution of RMP 348), thus freeing client computer">302</part-num-ref>
+ from using its resources.    </p>
+    <boundary-data type="header">
+      <confidence value="86">RS</confidence>
+W920060092U<confidence value="5">S</confidence>
+ 1                       - 11 -    </boundary-data>
+    <p id="p-38" num="38">
+      <page-break num="12"/>
+[0036] It should be understood that at least some aspects of the present invention may alternatively be implemented in a computer-useable medium that contains a program product.    </p>
+    <p id="p-39" num="39">Programs defining functions on the present invention can be delivered to a data storage system or a computer system via a variety of signal-bearing media, which include, without limitation, non- writable storage media (e.g., CD-ROM), writable storage media (e.g., hard disk drive, read/write CD ROM, optical media), and communication media, such as computer and telephone networks including Ethernet, the Internet, wireless networks, and like network systems. It should be understood, therefore, that such signal-bearing media when carrying or encoding computer readable instructions that direct method functions in the present invention, represent alternative embodiments of the present invention. Further, it is understood that the present invention may be implemented by a system having means in the form of hardware, software, or a combination of software and hardware as described herein or their equivalent.</p>
+    <p id="p-40" num="40">Software Deployment [0037<confidence value="5">]</confidence>
+ As described above, in one embodiment, the processes described by the present invention, including the functions of RMP <part-num-ref name="functions of RMP">348,</part-num-ref>
+ are performed by service provider server <part-num-ref name="functions of RMP 348, are performed by service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">Alternatively, RMP 348 and the method described herein, and in particular as shown and described in Figures 1-2, can be deployed as a process software from service provider server <part-num-ref name="process software from service provider server">402</part-num-ref>
+ to client computer <part-num-ref name="to client computer">302.</part-num-ref>
+ Still more particularly, process software for the method so described may be deployed to service provider server <part-num-ref name="method so described may be deployed to service provider server">402</part-num-ref>
+ by another service provider server (not shown).    </p>
+    <p id="p-42" num="42">[0038<confidence value="5">]</confidence>
+ Referring then to Figures <confidence value="5">5</confidence>
+a-b, step 500 begins the deployment of the process software.    </p>
+    <p id="p-43" num="43">The first thing is to determine if there are any programs that will reside on a server or servers when the process software is executed (query block 502). If this is the case, then the servers that will contain the executables are identified (block 504). The process software for the server or servers is transferred directly to the servers' storage via File Transfer Protocol (FTP) or some other protocol or by copying though the use of a shared file system (block 506). The process software is then installed on the servers (block 508).</p>
+    <boundary-data type="header">RSW920060092US1                         - <confidence value="88">12</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-44" num="44">
+      <page-break num="13"/>
+[0039] Next, a determination is made on whether the process software is to be deployed by having users access the process software on a server or servers (query block 510). If the users are to access the process software on servers, then the server addresses that will store the process software are identified (block 512).    </p>
+    <p id="p-45" num="45">[0040] A determination is made if a proxy server is to be built (query block <part-num-ref name="proxy server is to be built (query block">514)</part-num-ref>
+ to store the process software. A proxy server is a server that sits between a client application, such as a Web browser, and a real server. It intercepts all requests to the real server to see if it can fulfill the requests itself. If not, it forwards the request to the real server. The two primary benefits of a proxy server are to improve performance and to filter requests. If a proxy server is required, then the proxy server is installed (block 516). The process software is sent to the servers either via a protocol such as FTP or it is copied directly from the source files to the server files via file sharing (block 518). Another embodiment would be to send a transaction to the servers that contained the process software and have the server process the transaction, then receive and copy the process software to the server's file system. Once the process software is stored at the servers, the users via their client computers, then access the process software on the servers and copy to their client computers file systems (block 520). Another embodiment is to have the servers automatically copy the process software to each client and then run the installation program for the process software at each client computer. The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ then exits the process (terminator block 524).    </p>
+    <p id="p-46" num="46">
+      <confidence value="5">[</confidence>
+0041] In query step 526, a determination is made whether the process software is to be deployed by sending the process software to users via e-mail. The set of users where the process software will be deployed are identified together with the addresses of the user client computers (block 528). The process software is sent via e-mail to each of the users' client computers (block 530).    </p>
+    <p id="p-47" num="47">The users then receive the e-mail (block <part-num-ref name="e-mail (block">532)</part-num-ref>
+ and then detach the process software from the e- mail to a directory on their client computers (block 534). The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ then exits the process (terminator block 524).    </p>
+    <boundary-data type="header">RSW920060092US1                           - 13 <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-48" num="48">
+      <page-break num="14"/>
+[0042] Lastly a determination is made as to whether the process software will be sent directly to user directories on their client computers (query block 536). If so, the user directories are identified (block 538). The process software is transferred directly to the user's client computer directory (block 540). This can be done in several ways such as but not limited to sharing of the file system directories and then copying from the sender's file system to the recipient user's file system or alternatively using a transfer protocol such as File Transfer Protocol (FTP). The users access the directories on their client file systems in preparation for installing the process software (block 542). The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ and then exits the process (terminator block 524).    </p>
+    <p id="p-49" num="49">VPN Deployment <confidence value="5">[</confidence>
+0043<confidence value="5">]</confidence>
+ The present software can be deployed to third parties as part of a service wherein a third party VPN service is offered as a secure deployment vehicle or wherein a VPN is build on- demand as required for a specific deployment.    </p>
+    <p id="p-50" num="50">[0044] A virtual private network (VPN) is any combination of technologies that can be used to secure a connection through an otherwise unsecured or untrusted network. VPNs improve security and reduce operational costs. The VPN makes use of a public network, usually the Internet, to connect remote sites or users together. Instead of using a dedicated, real-world connection such as leased line, the VPN uses "virtual" connections routed through the Internet from the company's private network to the remote site or employee. Access to the software via a VPN can be provided as a service by specifically constructing the VPN for purposes of delivery or execution of the process software (i.e. the software resides elsewhere) wherein the lifetime of the VPN is limited to a given period of time or a given number of deployments based on an amount paid.</p>
+    <p id="p-51" num="51">
+      <confidence value="5">[</confidence>
+0045] The process software may be deployed, accessed and executed through either a remote- access or a site-to-site VPN. When using the remote-access VPNs the process software is deployed, accessed and executed via the secure, encrypted connections between a company's private network and remote users through a third-party service provider. The enterprise service <boundary-data type="header">RSW920060092US<confidence value="5">1</confidence>
+                         <confidence value="8">-</confidence>
+ <confidence value="88">14</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+provider (ESP) sets a network access server (NAS) and provides the remote users with desktop client software for their computers. The teleco<confidence value="88">mm</confidence>
+uters can then dial a toll-free number or attach directly via a cable or DSL modem to reach the NAS and use their VPN client software to access the corporate network and to access, download and execute the process software.    </p>
+    <p id="p-52" num="52">[0046] When using the site-to-site VPN, the process software is deployed, accessed and executed through the use of dedicated equipment and large-scale encryption that are used to connect a company's multiple fixed sites over a public network such as the Internet.</p>
+    <p id="p-53" num="53">[0047] The process software is transported over the VPN via tunneling which is the process of placing an entire packet within another packet and sending it over a network. The protocol of the outer packet is understood by the network and both points, called runnel interfaces, where the packet enters and exits the network.</p>
+    <p id="p-54" num="54">Software Integration [0048<confidence value="5">]</confidence>
+ The process software which consists code for implementing the process described herein may be integrated into a client, server and network environment by providing for the process software to coexist with applications, operating systems and network operating systems software and then installing the process software on the clients and servers in the environment where the process software will function.    </p>
+    <p id="p-55" num="55">[0049] The first step is to identify any software on the clients and servers including the network operating system where the process software will be deployed that are required by the process software or that work in conjunction with the process software. This includes the network operating system that is software that enhances a basic operating system by adding networking features.</p>
+    <p id="p-56" num="56">[0050<confidence value="5">]</confidence>
+ Next, the software applications and version numbers will be identified and compared to the list of software applications and version numbers that have been tested to work with the process software. Those software applications that are missing or that do not match the correct <boundary-data type="header">RSW920060092US<confidence value="5">1</confidence>
+                         - 15 <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+version will be upgraded with the correct version numbers. Program instructions that pass parameters from the process software to the software applications will be checked to ensure the parameter lists match the parameter lists required by the process software. Conversely parameters passed by the software applications to the process software will be checked to ensure the parameters match the parameters required by the process software. The client and server operating systems including the network operating systems will be identified and compared to the list of operating systems, version numbers and network software that have been tested to work with the process software. Those operating systems, version numbers and network software that do not match the list of tested operating systems and version numbers will be upgraded on the clients and servers to the required level.    </p>
+    <p id="p-57" num="57">[0051] After ensuring that the software, where the process software is to be deployed, is at the correct version level that has been tested to work with the process software, the integration is completed by installing the process software on the clients and servers.</p>
+    <p id="p-58" num="58">On Demand [0052<confidence value="5">]</confidence>
+ The process software is shared, simultaneously serving multiple customers in a flexible, automated fashion. It is standardized, requiring little customization and it is scalable, providing capacity on demand in a pay-as-you-go model.    </p>
+    <p id="p-59" num="59">[0053<confidence value="4">]</confidence>
+ The process software can be stored on a shared file system accessible from one or more servers. The process software is executed via transactions that contain data and server processing requests that use CPU units on the accessed server. CPU units are units of time such as minutes, seconds, hours on the central processor of the server. Additionally the assessed server may make requests of other servers that require CPU units. CPU units are an example that represents but one measurement of use. Other measurements of use include but are not limited to network bandwidth, memory usage, storage usage, packet transfers, complete transactions etc.    </p>
+    <p id="p-60" num="60">
+      <confidence value="5">[</confidence>
+0054<confidence value="5">]</confidence>
+ When multiple customers use the same process software application, their transactions are differentiated by the parameters included in the transactions that identify the unique customer <boundary-data type="header">RSW920060092US<confidence value="4">1</confidence>
+                          <confidence value="8">-</confidence>
+ <confidence value="88">16</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+and the type of service for that customer. All of the CPU units and other measurements of use that are used for the services for each customer are recorded. When the number of transactions to any one server reaches a number that begins to affect the performance of that server, other servers are accessed to increase the capacity and to share the workload. Likewise when other measurements of use such as network bandwidth, memory usage, storage usage, etc. approach a capacity so as to affect performance, additional network bandwidth, memory usage, storage etc.    </p>
+    <p id="p-61" num="61">are added to share the workload.</p>
+    <p id="p-62" num="62">[0055] The measurements of use used for each service and customer are sent to a collecting server that sums the measurements of use for each customer for each service that was processed anywhere in the network of servers that provide the shared execution of the process software.</p>
+    <p id="p-63" num="63">The summed measurements of use units are periodically multiplied by unit costs and the resulting total process software application service costs are alternatively sent to the customer and or indicated on a web site accessed by the customer which then remits payment to the service provider.</p>
+    <p id="p-64" num="64">[0056] In another embodiment, the service provider requests payment directly from a customer account at a banking or financial institution.</p>
+    <p id="p-65" num="65">[0057] In another embodiment, if the service provider is also a customer of the customer that uses the process software application, the payment owed to the service provider is reconciled to the payment owed by the service provider to minimize the transfer of payments.</p>
+    <p id="p-66" num="66">[0058<confidence value="5">]</confidence>
+ With reference now to Figures 6a-b, initiator block 602 begins the On Demand process.    </p>
+    <p id="p-67" num="67">A transaction is created than contains the unique customer identification, the requested service type and any service parameters that further, specify the type of service (block 604). The transaction is then sent to the main server (block 606). In an On Demand environment the main server can initially be the only server, then as capacity is consumed other servers are added to the On Demand environment.</p>
+    <boundary-data type="header">RSW920060092US1                         - <confidence value="88">17</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-68" num="68">
+      <page-break num="18"/>
+[0059] The server central processing unit (CPU) capacities in the On Demand environment are queried (block 608). The CPU requirement of the transaction is estimated, then the servers available CPU capacity in the On Demand environment are compared to the transaction CPU requirement to see if there is sufficient CPU available capacity in any server to process the transaction (query block 610). If there is not sufficient server CPU available capacity, then additional server CPU capacity is allocated to process the transaction (block 612). If there was already sufficient Available CPU capacity then the transaction is sent to a selected server (block 614).    </p>
+    <p id="p-69" num="69">[0060] Before executing the transaction, a check is made of the remaining On Demand environment to determine if the environment has sufficient available capacity for processing the transaction. This environment capacity consists of such things as but not limited to network bandwidth, processor memory, storage etc. (block 616). If there is not sufficient available capacity, then capacity will be added to the On Demand environment (block 618). Next the required software to process the transaction is accessed, loaded into memory, then the transaction is executed (block 620).</p>
+    <p id="p-70" num="70">[0061] The usage measurements are recorded (block 622). The usage measurements consist of the portions of those functions in the On Demand environment that are used to process the transaction. The usage of such functions as, but not limited to, network bandwidth, processor memory, storage and CPU cycles are what is recorded. The usage measurements are summed, multiplied by unit costs and then recorded as a charge to the requesting customer (block 624).</p>
+    <p id="p-71" num="71">[0062] If the customer has requested that the On Demand costs be posted to a web site (query block 626), then they are posted (block 628). If the customer has requested that the On Demand costs be sent via e-mail to a customer address (query block 630), then these costs are sent to the customer (block 632). If the customer has requested that the On Demand costs be paid directly from a customer account (query block 634), then payment is received directly from the customer account (block 636). The On Demand process is then exited at terminator block <part-num-ref name="On Demand process is then exited at terminator block">638.</part-num-ref>
+    </p>
+    <boundary-data type="header">RSW920060092US<confidence value="4">1</confidence>
+                        - 18 <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-72" num="72">
+      <page-break num="19"/>
+      <confidence value="5">[</confidence>
+0063<confidence value="5">]</confidence>
+ The present invention thus provides for a computer-implementable method, system and computer-usable medium for managing rules through the use of a configuration database. In one embodiment, the computer-implementable method includes the step of, in response to detecting a rule change, transmitting a new rule to a rule control logic in a resource management database, wherein the rule change changes a rule for an attribute of a resource in a data processing system, and wherein the resource management database describes attributes of resources in the data processing system. The method may include the further step of transmitting the new rule from the rule control logic to a resource manager, wherein the resource manager is a person who has the capacity to implement the new rule in a resource in the data processing system. In embodiment in which the resource management database is a Configuration Management Database (CMDB), the computer-implementable method may include the additional step of transmitting a watch message from the rule control logic to a Configuration Item (CI) in a CMDB, wherein the C<confidence value="5">I</confidence>
+ contains a shadow copy of attribute configurations for resources managed by the CMDB, and wherein the watch message instructs the C<confidence value="5">I</confidence>
+ to watch for a certification entry from the resource manager, and wherein the certification entry identifies the resource as being in compliance with the new rule. Furthermore, the computer-implementable method may include the steps of: in response to the resource manager implementing the new rule in the resource, receiving a certification entry in the C<confidence value="5">I</confidence>
+ indicating that the resource is in compliance with the new rule; transmitting a certification message from the C<confidence value="5">I</confidence>
+ to a certification control in the CMDB, wherein the certification message indicates that the resource is in compliance with the new rule; and transmitting a compliance summary from the certification control to a CMDB manager, wherein the compliance summary describes a compliance status for multiple resources in the data processing system, and wherein the compliance status describes whether a resource has or has not implemented the new rule.    </p>
+    <p id="p-73" num="73">[0064] Note further that, as described above, instructions used in each embodiment of a computer-usable medium may be deployed from a service provider to a user. This deployment may be made in an "on-demand" basis as described herein.</p>
+    <p id="p-74" num="74">[0065] While the present invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in <boundary-data type="header">RSW920060092US1                        <confidence value="6">-</confidence>
+ <confidence value="88">19</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="20"/>
+form and detail may be made therein without departing from the spirit and scope of the invention. For example, while the invention has been described as creating a new rule in response to a change to a C<confidence value="5">I</confidence>
+ rule and/or an enterprise's policy (as defined above), it should be understood that the new rule may be initially created in response to a change to an enterprise's policy or to a creation of a new enterprise policy. Furthermore, as used in the specification and the appended claims, the term "computer" or "system" or "computer system" or "computing device" includes any data processing system including, but not limited to, personal computers, servers, workstations, network computers, main frame computers, routers, switches, Personal Digital Assistants (PDA's), telephones, and any other system capable of processing, transmitting, receiving, capturing and/or storing data.    </p>
+    <boundary-data type="header">RSW920060092US<confidence value="5">1</confidence>
+                         <confidence value="8">-</confidence>
+ <confidence value="88">20</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11456904.xml

@@ -0,0 +1,584 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11456904</doc-number>
+        <date>2006-07-12</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <heading id="h-1">COAXIAL WELD<confidence value="8">I</confidence>
+NG CABLE ASSEMBLY    </heading>
+    <heading id="h-2">TECHNICAL FIELD</heading>
+    <p id="p-1" num="1">
+      <confidence value="5">[</confidence>
+0001<confidence value="5">]</confidence>
+ Certain embodiments of the present invention relate to cable assemblies. More particularly, certain embodiments of the present invention relate to coaxial welding cable assemblies and systems and methods for producing the same.    </p>
+    <heading id="h-3">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-2" num="2">
+      <confidence value="5">[</confidence>
+0002<confidence value="5">]</confidence>
+ There are many types of welding systems used for a variety of applications. Typical prior art welding systems include a power supply, such as phase control, inverter and converter based power supplies, and a controller that controls the output of the power supply.    </p>
+    <p id="p-3" num="3">Welding systems reside at the core of the modern industrial age. From massive automated automobile assembly operations to manual, portable environments, these systems facilitate joining in ever more complicated manufacturing operations.</p>
+    <p id="p-4" num="4">
+      <confidence value="5">[</confidence>
+0003<confidence value="5">]</confidence>
+ One such example of a welding system includes an electric ar<confidence value="5">c</confidence>
+ welding system. Such a system may involve movement of a consumable electrode, for example, toward a work- piece while current is passed through the electrode and across an ar<confidence value="5">c</confidence>
+ developed between the electrode and the work-piece. The electrode may be a non-consumable or consumable type, wherein portions of the electrode may be melted and deposited on the work-piece.    </p>
+    <p id="p-5" num="5">
+      <confidence value="5">[</confidence>
+0004<confidence value="5">]</confidence>
+ In certain ar<confidence value="5">c</confidence>
+ welding applications, a supply of welding wire is typically pulled from a drum by a wire feeder and pushed through a welding cable and then through a welding gun which is movable along a work-piece. The welding gun typically includes a tubular contact tip allowing a welding current to be conducted to the wire moving through a wire receiving passage in the contact tip so the current between the wire and work-piece melts the wire for deposition of the metal onto the work-piece.    </p>
+    <p id="p-6" num="6">
+      <confidence value="5">[</confidence>
+0005<confidence value="5">]</confidence>
+ In electric ar<confidence value="5">c</confidence>
+ welding technology, a power source passes a current between an electrode and a work-piece. Of<confidence value="8">t</confidence>
+en, the electrode is a continuous welding wire drawn from a supply of welding wire, such as a drum or reel, and passed through a contact tip on its way to being melted and deposited onto the work-piece. In such a welding procedure, the power source of the welder includes a first stud connected to the electrode, usually through the contact tip, and a second stud connected to the work-piece. Connections are by welding <boundary-data type="header">
+        <confidence value="5">1</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+cables, which cables may be quite long and include a variety of impedance variables, such as inductive reactance based upon length, position, and shape of the cables.    </p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0006<confidence value="5">]</confidence>
+ When performing a welding process, the power supply receives a current command to create a particular pulse wave between the electrode and work-piece. Such a welder must accurately control the pulse shape or waveform by controlling the voltage to a pulse width modulator operated at a frequency typically exceeding about <part-num-ref name="frequency typically exceeding about">20</part-num-ref>
+ Khz. To assure the desired welding operation constituting specific waveforms between the electrode and work-piece, the command signal is created based upon a feedback from the actual welding operation. The feedback typically involves the ar<confidence value="5">c</confidence>
+ current and/or ar<confidence value="5">c</confidence>
+ voltage.    </p>
+    <p id="p-8" num="8">
+      <confidence value="5">[</confidence>
+0007<confidence value="5">]</confidence>
+ To control the welding process, welding power sources that provide waveform control have been developed. These power sources deliver a series of selectively shaped electrical power waveforms to the weld. The power waveform is optimized for a selected ar<confidence value="5">c</confidence>
+ welding process, weld metal, wire feed speed, and weld joint.    </p>
+    <p id="p-9" num="9">
+      <confidence value="5">[</confidence>
+0008<confidence value="5">]</confidence>
+ Prior art controllers use a number of feedback parameters, including output current and output voltage. When output voltage is the feedback parameter, it is known in the prior art to feedback either power supply voltage or voltage from sense leads connected to the work-piece or bench, and the wire feed motor. Power supply voltage, as used herein, includes output voltage in or near the power supply, such as on the output studs. Voltage sense lead, as used herein, includes one or more leads used to sense output voltage remotely from the power supply, such as at the work-piece and/or the wire feeder.    </p>
+    <p id="p-10" num="10">
+      <confidence value="5">[</confidence>
+0009<confidence value="5">]</confidence>
+ The power supply voltage may differ from a sense lead voltage because of losses in the welding cable. Often, the power supply voltage is sufficient to control the power supply.    </p>
+    <p id="p-11" num="11">Other times a more accurate voltage feedback is desired, and sense leads are used.</p>
+    <p id="p-12" num="12">
+      <confidence value="5">[</confidence>
+0010<confidence value="5">]</confidence>
+ Sense leads typically connect to a specially designated sensor on the welding power supply. The negative voltage sense lead is typically clamped or clipped onto the work-piece or workbench, and the positive voltage sense lead is typically connected to the wire feed motor. The sense leads of<confidence value="8">t</confidence>
+en lay on the ground between the welding power supply and the work-piece. Certain non-commercial prior art welding systems use a separate ar<confidence value="5">c</confidence>
+ voltage sense wire that is clipped to a point near the welding electrode to more accurately measure <confidence value="885">arc</confidence>
+ voltage. Prior art commercial systems use a similar work-piece sense lead which is clipped to the work-piece.    </p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-13" num="13">
+      <page-break num="3"/>
+      <confidence value="5">[</confidence>
+0011<confidence value="5">]</confidence>
+ Typically, to assure an accurate feedback of ar<confidence value="5">c</confidence>
+ voltage, it is common practice to use remote voltage sensing leads directed from the controller of the power source to the electrode or contact tip and the work-piece. The voltage of these leads determines the command signal to the power source from the controller.    </p>
+    <p id="p-14" num="14">
+      <confidence value="5">[</confidence>
+0012<confidence value="5">]</confidence>
+ Fig. <confidence value="5">1</confidence>
+ is an exemplary illustration of a cross-sectional view of a coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">100,</part-num-ref>
+ in accordance with the prior art. Such a coaxial welding cable may be connected between a power source of a welding system and an electrode (or wirefeeder) and work-piece as described above.    </p>
+    <p id="p-15" num="15">
+      <confidence value="5">[</confidence>
+0013<confidence value="5">]</confidence>
+ The cable assembly <part-num-ref name="cable assembly">100</part-num-ref>
+ includes a central electrical conductor <part-num-ref name="central electrical conductor">110</part-num-ref>
+ having an outer, electrically insulating layer <part-num-ref name="outer, electrically insulating layer">115.</part-num-ref>
+ Positioned around the insulated central conductor <part-num-ref name="insulated central conductor">110,</part-num-ref>
+ <part-num-ref name="insulated central conductor 110,">115</part-num-ref>
+ is a plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">120,</part-num-ref>
+ each having an outer electrically insulating layer <part-num-ref name="outer electrically insulating layer">125.</part-num-ref>
+ The entire assembly is then wrapped in an electrically insulating jacket <part-num-ref name="electrically insulating jacket">130.</part-num-ref>
+ Such a cable assembly, as constructed for welding applications, is typically heavy and stiff because of the multiple conductors and associated multiple layers of insulating material.    </p>
+    <p id="p-16" num="16">
+      <confidence value="5">[</confidence>
+0014<confidence value="5">]</confidence>
+ Therefore, there remains a need in the art for reducing the weight and increasing the flexibility of such coaxial welding cables.    </p>
+    <p id="p-17" num="17">
+      <confidence value="5">[</confidence>
+0015<confidence value="5">]</confidence>
+ Further limitations and disadvantages of conventional, traditional, and proposed approaches will become apparent to one of skill in the art, through comparison of such systems and methods with the present invention as set forth in the remainder of the present application with reference to the drawings.    </p>
+    <heading id="h-4">BRIEF SUMMARY OF THE INVENTION</heading>
+    <p id="p-18" num="18">
+      <confidence value="5">[</confidence>
+0016<confidence value="5">]</confidence>
+ A first embodiment of the present invention comprises a coaxial cable assembly. The cable assembly includes a central electrical conductor length having a first cross-sectional area and a first electrically insulating jacket surrounding the central electrical conductor length. The cable assembly also includes a plurality of peripheral electrical conductor lengths surrounding the insulated central electrical conductor length, wherein the central electrical conductor length is electrically insulated from the plurality of peripheral electrical conductor lengths only by the first electrically insulating jacket, and wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as the first cross-sectional area of the central electrical conductor length. The cable assembly <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+further includes a second electrically insulating jacket surrounding the plurality of peripheral electrical conductor lengths to contain the insulated central electrical conductor length and the plurality of peripheral electrical conductor lengths.    </p>
+    <p id="p-19" num="19">
+      <confidence value="5">[</confidence>
+0017<confidence value="5">]</confidence>
+ A second embodiment of the present invention comprises a coaxial cable assembly.    </p>
+    <p id="p-20" num="20">The cable assembly includes a central electrical conductor length having a first cross- sectional area. The cable assembly also includes a plurality of peripheral electrical conductor lengths surrounding the central conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as the first cross-sectional area of the central electrical conductor length. The cable assembly further includes a plurality of first electrically insulating jackets, wherein each of the plurality of peripheral electrical conductor lengths is surrounded by one of the plurality of first electrically insulating jackets, and wherein the central electrical conductor length is electrically insulated from the plurality of peripheral electrical conductor lengths only by the plurality of first electrically insulating jackets. The cable assembly also includes a second electrically insulating jacket surrounding the plurality of insulated peripheral electrical conductor lengths to contain the central electrical conductor length and the plurality of insulated peripheral electrical conductor lengths.</p>
+    <p id="p-21" num="21">
+      <confidence value="5">[</confidence>
+0018<confidence value="5">]</confidence>
+ Another embodiment of the present invention comprises a system for constructing a coaxial cable assembly. The system includes a means for wrapping a plurality of electrically un-insulated peripheral electrical conductor lengths around an electrically insulated central electrical conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central electrical conductor length. The system also includes a means for applying an electrically insulating jacket around the plurality of peripheral electrical conductor lengths to contain the peripheral electrical conductor lengths and the electrically insulated central electrical conductor length.    </p>
+    <p id="p-22" num="22">
+      <confidence value="5">[</confidence>
+0019<confidence value="5">]</confidence>
+ A further embodiment of the present invention comprises a system for constructing a coaxial cable assembly. The system includes a means for wrapping a plurality of electrically insulated peripheral electrical conductor lengths around an electrically un-insulated central electrical conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+electrical conductor length. The system also includes a means for applying an electrically insulating jacket around the plurality of peripheral electrical conductor lengths to contain the peripheral conductor lengths and the electrically un-insulated central electrical conductor length.    </p>
+    <p id="p-23" num="23">
+      <confidence value="5">[</confidence>
+0020<confidence value="5">]</confidence>
+ These and other advantages and novel features of the present invention, as well as details of illustrated embodiments thereof, will be more fully understood from the following description and drawings.    </p>
+    <heading id="h-5">BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS</heading>
+    <p id="p-24" num="24">
+      <confidence value="5">[</confidence>
+0021<confidence value="5">]</confidence>
+ Fig. <confidence value="5">1</confidence>
+ is an exemplary illustration of a cross-sectional view of a coaxial welding cable assembly, in accordance with the prior art.    </p>
+    <p id="p-25" num="25">
+      <confidence value="5">[</confidence>
+0022<confidence value="5">]</confidence>
+ Fig. 2 is an exemplary illustration of a first embodiment of a coaxial welding cable assembly, in accordance with various aspects of the present invention.    </p>
+    <p id="p-26" num="26">
+      <confidence value="5">[</confidence>
+0023<confidence value="5">]</confidence>
+ Fig. 3 is an exemplary illustration of a second embodiment of a coaxial welding cable assembly, in accordance with various aspects of the present invention.    </p>
+    <p id="p-27" num="27">
+      <confidence value="5">[</confidence>
+0024<confidence value="5">]</confidence>
+ Fig. 4 is an exemplary illustration of a third embodiment of a coaxial welding cable assembly, in accordance with various aspects of the present invention.    </p>
+    <p id="p-28" num="28">
+      <confidence value="5">[</confidence>
+0025<confidence value="5">]</confidence>
+ Fig. 5 is a flowchart of an embodiment of a method for constructing the coaxial welding cable assembly of Fig. 2, in accordance with various aspects of the present invention.    </p>
+    <p id="p-29" num="29">
+      <confidence value="5">[</confidence>
+0026<confidence value="5">]</confidence>
+ Fig. 6 is a flowchart of an embodiment of a method for constructing the coaxial welding cable assembly of Fig. 3, in accordance with various aspects of the present invention.    </p>
+    <p id="p-30" num="30">
+      <confidence value="5">[</confidence>
+0027<confidence value="5">]</confidence>
+ Fig. 7 is an exemplary illustration of an embodiment of a system for constructing a coaxial cable assembly, in accordance with various aspects of the present invention.    </p>
+    <heading id="h-6">DETAILED DESCRIPTION OF THE INVENTION</heading>
+    <p id="p-31" num="31">
+      <confidence value="5">[</confidence>
+0028<confidence value="5">]</confidence>
+ Fig. 2 is an exemplary illustration of a first embodiment of a coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">200,</part-num-ref>
+ in accordance with various aspects of the present invention. Coaxial weld cables exhibit substantially less inductance per unit length than traditional welding cables. A low inductance cable allows the passage of dynamic current waveforms with minimal distortion. The cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ has a central electrical conductor <part-num-ref name="central electrical conductor">210,</part-num-ref>
+ having a first pre- defined cross-sectional area which is relatively uniform, running the length of the cable <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+assembly <part-num-ref name="cable assembly">200.</part-num-ref>
+ In accordance with an embodiment of the present invention, the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ is substantially cylindrical in shape, having a substantially circular cross-sectional area. As an example, the cross-sectional area of the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ may be approximately 0.2 square inches (when the diameter is about 0.5 inches). The central electrical conductor may be made of any number of different types of conductive electrical materials such as, for example, copper. Alternatively, the cross-section of the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ may be in the form of other shapes as well such as, for example, a rectangular shape.    </p>
+    <p id="p-32" num="32">
+      <confidence value="5">[</confidence>
+0029<confidence value="5">]</confidence>
+ The cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ also has a first electrically insulating jacket <part-num-ref name="first electrically insulating jacket">215</part-num-ref>
+ surrounding the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ The insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ covers the outer surface of the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ along the length of the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ In accordance with an embodiment of the present invention, the insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ may be applied to the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ such that the insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ adheres to the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ For example, the insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ may be a coating that is applied to the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ Alternatively, the insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ may be a sleeve that slides over the central electrical conductor <part-num-ref name="central electrical conductor">210,</part-num-ref>
+ but does not actually adhere as a coating would. The insulating jacket <part-num-ref name="insulating jacket">215</part-num-ref>
+ may be made of a plastic material or some other electrically insulating material, in accordance with various embodiments of the present invention.    </p>
+    <p id="p-33" num="33">
+      <confidence value="5">[</confidence>
+0030<confidence value="5">]</confidence>
+ The cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ also includes a plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ surrounding the insulated central electrical conductor <part-num-ref name="insulated central electrical conductor">210,</part-num-ref>
+ <part-num-ref name="insulated central electrical conductor 210,">215</part-num-ref>
+ and running the length of the cable assembly <part-num-ref name="cable assembly">200.</part-num-ref>
+ In accordance with an embodiment of the present invention, each of the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ is substantially cylindrical in shape, having a substantially circular cross-sectional area. The plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ are positioned or wrapped around the insulated central electrical conductor <part-num-ref name="insulated central electrical conductor">210.</part-num-ref>
+ As an example, the cross-sectional area of each of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220</part-num-ref>
+ may be approximately 0.008 square inches (when the diameter is about <part-num-ref name="diameter is about">80</part-num-ref>
+ thousandths of an inch). The peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220</part-num-ref>
+ may be made of any number of different types of conductive electrical materials such as, for example, copper. Alternatively, the cross-section of each of the peripheral electrical conductors may be in the form of other shapes as well such as, for example, a triangular shape.    </p>
+    <boundary-data type="header">
+      <confidence value="8">6</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-34" num="34">
+      <page-break num="7"/>
+      <confidence value="5">[</confidence>
+0031<confidence value="5">]</confidence>
+ In the embodiment of Fig. 2, the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220</part-num-ref>
+ are not individually electrically insulated. The central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ is electrically insulated from the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ only by the first electrically insulating jacket <part-num-ref name="first electrically insulating jacket">215.</part-num-ref>
+ The coaxial cable assembly <part-num-ref name="coaxial cable assembly">200</part-num-ref>
+ is capable of being electrically connected between a welding power source and a welding wire feeder and a work-piece to be welded. Such connections may be accomplished via electrical connectors attached to the ends of the cable assembly <part-num-ref name="cable assembly">200.</part-num-ref>
+ The electrical connectors are attached to the cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ such that the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ remains electrically insulated from the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">
+      <confidence value="5">[</confidence>
+0032<confidence value="5">]</confidence>
+ The central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ may be used as (i.e., serve as) an electrode lead in a welding procedure and the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ may be used as a work lead in a welding procedure. Alternatively, the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ may be used as (i.e., serve as) a work lead and the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ may be used as an electrode lead.    </p>
+    <p id="p-36" num="36">
+      <confidence value="5">[</confidence>
+0033<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, the sum of the cross- sectional areas of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220</part-num-ref>
+ is approximately equal to the cross- sectional area of the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ Such a configuration helps to maintain a uniform resistance path through the cable assembly <part-num-ref name="cable assembly">200,</part-num-ref>
+ which is desirable. Based on the cross-sectional areas in the examples above, approximately <part-num-ref name="examples above, approximately">25</part-num-ref>
+ peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">220</part-num-ref>
+ would be positioned around the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ to make the cross-sectional areas equal.    </p>
+    <p id="p-37" num="37">
+      <confidence value="5">[</confidence>
+0034<confidence value="5">]</confidence>
+ The cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ also has a second electrically insulating jacket <part-num-ref name="second electrically insulating jacket">230</part-num-ref>
+ surrounding the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ along the length of the cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ to contain the insulated central electrical conductor <part-num-ref name="insulated central electrical conductor">210,</part-num-ref>
+ <part-num-ref name="insulated central electrical conductor 210,">215</part-num-ref>
+ and the plurality of un-insulated peripheral electrical conductors <part-num-ref name="plurality of un-insulated peripheral electrical conductors">220.</part-num-ref>
+ The insulating jacket <part-num-ref name="insulating jacket">230</part-num-ref>
+ may be made of a plastic material or some other electrically insulating material, in accordance with various embodiments of the present invention.    </p>
+    <p id="p-38" num="38">
+      <confidence value="5">[</confidence>
+0035<confidence value="5">]</confidence>
+ In the configuration of Fig. 2, the central conductor <part-num-ref name="central conductor">210</part-num-ref>
+ is insulated from the plurality of peripheral conductors <part-num-ref name="plurality of peripheral conductors">220</part-num-ref>
+ and the entire assembly is insulated from the outside world by insulating jacket <part-num-ref name="outside world by insulating jacket">230,</part-num-ref>
+ without having to individually insulate each peripheral conductor <part-num-ref name="outside world by insulating jacket 230, without having to individually insulate each peripheral conductor">220</part-num-ref>
+ as in the prior art configuration of Fig. 1. As a result, the coaxial cable assembly <part-num-ref name="coaxial cable assembly">200</part-num-ref>
+ of Fig.    </p>
+    <boundary-data type="header">
+      <confidence value="8">7</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-39" num="39">
+      <page-break num="8"/>
+2 weighs substantially less and is more flexible than the cable assembly <part-num-ref name="cable assembly">100</part-num-ref>
+ of Fig. 1, since less insulating material is used in the configuration of Fig. 2.    </p>
+    <p id="p-40" num="40">
+      <confidence value="5">[</confidence>
+0036<confidence value="5">]</confidence>
+ Fig. 3 is an exemplary illustration of a second embodiment of a coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">300,</part-num-ref>
+ in accordance with various aspects of the present invention. The cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ has a central electrical conductor <part-num-ref name="central electrical conductor">310,</part-num-ref>
+ having a first pre-defined cross-sectional area which is relatively uniform, running the length of the cable assembly <part-num-ref name="cable assembly">300.</part-num-ref>
+ In accordance with an embodiment of the present invention, the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ is substantially cylindrical in shape, having a substantially circular cross-sectional area. As an example, the cross-sectional area of the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ may be approximately 0.2 square inches (when the diameter is about 0.5 inches). The central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ may be made of any number of different types of conductive electrical materials such as, for example, copper. Alternatively, the cross-section of the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ may be in the form of other shapes as well such as, for example, a rectangular shape.    </p>
+    <p id="p-41" num="41">
+      <confidence value="5">[</confidence>
+0037<confidence value="5">]</confidence>
+ Unlike the cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ of Fig. 2, the cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ does not have a first electrically insulating jacket surrounding the central electrical conductor <part-num-ref name="central electrical conductor">310.</part-num-ref>
+ The cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ also includes a plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">320</part-num-ref>
+ surrounding the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ and running the length of the cable assembly <part-num-ref name="cable assembly">300.</part-num-ref>
+ Each of the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">320</part-num-ref>
+ are electrically insulated with an insulating jacket <part-num-ref name="insulating jacket">325.</part-num-ref>
+ Each of the insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ surrounds a corresponding peripheral electrical conductor. Each insulating jacket <part-num-ref name="corresponding peripheral electrical conductor. Each insulating jacket">325</part-num-ref>
+ covers the outer surface of a corresponding peripheral electrical conductor <part-num-ref name="corresponding peripheral electrical conductor">320</part-num-ref>
+ along the length of the corresponding peripheral electrical conductor <part-num-ref name="corresponding peripheral electrical conductor">320.</part-num-ref>
+ In accordance with an embodiment of the present invention, the insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ may be applied to the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ such that the insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ adhere to the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320.</part-num-ref>
+    </p>
+    <p id="p-42" num="42">For example, the insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ may be a coating that is applied to the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320.</part-num-ref>
+ Alternatively, the insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ may be sleeves that slide over each corresponding peripheral electrical conductor <part-num-ref name="may be sleeves that slide over each corresponding peripheral electrical conductor">320,</part-num-ref>
+ but does not actually adhere as a coating would. The insulating jackets <part-num-ref name="insulating jackets">325</part-num-ref>
+ may be made of a plastic material or some other electrically insulating material, in accordance with various embodiments of the present invention.    </p>
+    <boundary-data type="header">
+      <confidence value="8">8</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-43" num="43">
+      <page-break num="9"/>
+      <confidence value="5">[</confidence>
+0038<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, each of the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">320</part-num-ref>
+ is substantially cylindrical in shape, having a substantially circular cross-sectional area. The plurality of insulated peripheral electrical conductors <part-num-ref name="plurality of insulated peripheral electrical conductors">320</part-num-ref>
+ are positioned or wrapped around the un-insulated central electrical conductor <part-num-ref name="un-insulated central electrical conductor">310.</part-num-ref>
+ As an example, the cross-sectional area of each of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ may be approximately 0.008 square inches (when the diameter is about <part-num-ref name="diameter is about">80</part-num-ref>
+ thousandths of an inch). The peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ may be made of any number of different types of conductive electrical materials such as, for example, copper.    </p>
+    <p id="p-44" num="44">Alternatively, the cross-section of each of the peripheral electrical conductors may be in the form of other shapes as well such as, for example, a triangular shape.</p>
+    <p id="p-45" num="45">
+      <confidence value="5">[</confidence>
+0039<confidence value="5">]</confidence>
+ In the embodiment of Fig. 3, the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ is not electrically insulated. Each of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ are electrically insulated from the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ only by the insulating jackets <part-num-ref name="insulating jackets">325.</part-num-ref>
+ The coaxial cable assembly <part-num-ref name="coaxial cable assembly">300</part-num-ref>
+ is capable of being electrically connected between a welding power source and a welding wire feeder and a work-piece to be welded. Such connections may be accomplished via electrical connectors attached to the ends of the cable assembly <part-num-ref name="cable assembly">300.</part-num-ref>
+ The electrical connectors are attached to the cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ such that the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ remains electrically insulated from the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320.</part-num-ref>
+    </p>
+    <p id="p-46" num="46">
+      <confidence value="5">[</confidence>
+0040<confidence value="5">]</confidence>
+ The central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ may be used as an electrode lead in a welding procedure and the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">320</part-num-ref>
+ may be used as a work lead in a welding procedure. Alternatively, the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ may be used as a work lead and the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">320</part-num-ref>
+ may be used as an electrode lead.    </p>
+    <p id="p-47" num="47">
+      <confidence value="5">[</confidence>
+0041<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, the sum of the cross- sectional areas of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ is approximately equal to the cross- sectional area of the central electrical conductor <part-num-ref name="central electrical conductor">310.</part-num-ref>
+ Such a configuration helps to maintain a uniform resistance path through the cable assembly <part-num-ref name="cable assembly">300,</part-num-ref>
+ which is desirable. Based on the cross-sectional areas in the examples above, approximately <part-num-ref name="examples above, approximately">25</part-num-ref>
+ peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">320</part-num-ref>
+ would be positioned around the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ to make the cross-sectional areas equal.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-48" num="48">
+      <page-break num="10"/>
+      <confidence value="5">[</confidence>
+0042<confidence value="5">]</confidence>
+ The cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ also has a second electrically insulating jacket <part-num-ref name="second electrically insulating jacket">330</part-num-ref>
+ surrounding the plurality of insulated peripheral electrical conductors <part-num-ref name="plurality of insulated peripheral electrical conductors">320,</part-num-ref>
+ <part-num-ref name="plurality of insulated peripheral electrical conductors 320,">325</part-num-ref>
+ along the length of the cable assembly <part-num-ref name="cable assembly">300</part-num-ref>
+ to contain the un-insulated central electrical conductor <part-num-ref name="un-insulated central electrical conductor">310</part-num-ref>
+ and the plurality of insulated peripheral electrical conductors <part-num-ref name="plurality of insulated peripheral electrical conductors">320,</part-num-ref>
+ <part-num-ref name="plurality of insulated peripheral electrical conductors 320,">325.</part-num-ref>
+ The insulating jacket <part-num-ref name="insulating jacket">330</part-num-ref>
+ may be made of a plastic material or some other electrically insulating material, in accordance with various embodiments of the present invention.    </p>
+    <p id="p-49" num="49">
+      <confidence value="5">[</confidence>
+0043<confidence value="5">]</confidence>
+ In the configuration of Fig. 3, the central conductor <part-num-ref name="central conductor">310</part-num-ref>
+ is insulated from the plurality of peripheral conductors <part-num-ref name="plurality of peripheral conductors">320</part-num-ref>
+ by the insulating jackets <part-num-ref name="insulating jackets">325,</part-num-ref>
+ and the entire assembly is insulated from the outside world by insulating jacket <part-num-ref name="outside world by insulating jacket">330,</part-num-ref>
+ without having to individually insulate the central electrical conductor <part-num-ref name="central electrical conductor">310</part-num-ref>
+ as in the prior art configuration of Fig. 1. As a result, the coaxial cable assembly <part-num-ref name="coaxial cable assembly">300</part-num-ref>
+ of Fig. 3 weighs substantially less and is more flexible than the cable assembly <part-num-ref name="cable assembly">100</part-num-ref>
+ of Fig. 1, since less insulating material is used in the configuration of Fig. 3.    </p>
+    <p id="p-50" num="50">
+      <confidence value="5">[</confidence>
+0044<confidence value="5">]</confidence>
+ Fig. 4 is an exemplary illustration of a third embodiment of a coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">400,</part-num-ref>
+ in accordance with various aspects of the present invention. The cable assembly <part-num-ref name="cable assembly">400</part-num-ref>
+ of Fig. 4 is very similar to the cable assembly <part-num-ref name="cable assembly">200</part-num-ref>
+ of Fig. 2, having a central electrical conductor <part-num-ref name="central electrical conductor">410</part-num-ref>
+ with an insulating jacket <part-num-ref name="insulating jacket">415,</part-num-ref>
+ a plurality of un-insulated peripheral electrical conductors <part-num-ref name="plurality of un-insulated peripheral electrical conductors">420</part-num-ref>
+ surrounding the insulated central electrical conductor <part-num-ref name="insulated central electrical conductor">410,</part-num-ref>
+ <part-num-ref name="insulated central electrical conductor 410,">415,</part-num-ref>
+ and an insulating jacket <part-num-ref name="insulating jacket">430</part-num-ref>
+ containing the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">420</part-num-ref>
+ and the insulated central electrical conductor <part-num-ref name="insulated central electrical conductor">410,</part-num-ref>
+ <part-num-ref name="insulated central electrical conductor 410,">415.</part-num-ref>
+ However, the cable assembly <part-num-ref name="cable assembly">400</part-num-ref>
+ also includes a conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ having a pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442</part-num-ref>
+ serving as sense leads or communication leads, and running the length of the cable assembly <part-num-ref name="cable assembly">400.</part-num-ref>
+    </p>
+    <p id="p-51" num="51">
+      <confidence value="5">[</confidence>
+0045<confidence value="5">]</confidence>
+ The conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ is located within the cable assembly <part-num-ref name="cable assembly">400</part-num-ref>
+ as part of the grouping of the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">420</part-num-ref>
+ around the central electrical conductor <part-num-ref name="central electrical conductor">410.</part-num-ref>
+ The pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442</part-num-ref>
+ are electrically insulated from each other by an insulating material <part-num-ref name="insulating material">443</part-num-ref>
+ of the conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ which separates the conductor leads <part-num-ref name="conductor leads">441,</part-num-ref>
+ <part-num-ref name="conductor leads 441,">442.</part-num-ref>
+ A conductive electrical shield <part-num-ref name="conductive electrical shield">444</part-num-ref>
+ surrounds the pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442</part-num-ref>
+ and is electrically insulated from the pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442</part-num-ref>
+ also by the insulating material <part-num-ref name="insulating material">443.</part-num-ref>
+ In addition, the shield <part-num-ref name="shield">444</part-num-ref>
+ is electrically insulated from the peripheral electrical conductors <part-num-ref name="peripheral electrical conductors">420</part-num-ref>
+ by an insulating jacket <part-num-ref name="insulating jacket">445</part-num-ref>
+ of the conductor lead assembly <part-num-ref name="conductor lead assembly">440.</part-num-ref>
+ The conductive shield <part-num-ref name="conductive shield">444</part-num-ref>
+ prevents electrical interference, which may be <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+generated from the other conductors <part-num-ref name="other conductors">410,</part-num-ref>
+ <part-num-ref name="other conductors 410,">420</part-num-ref>
+ or other external sources, from reaching the pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442.</part-num-ref>
+ As a result, signals being transmitted over the pair of conductor leads <part-num-ref name="pair of conductor leads">441,</part-num-ref>
+ <part-num-ref name="pair of conductor leads 441,">442</part-num-ref>
+ will not be corrupted by outside electrical interference since the conductor leads <part-num-ref name="conductor leads">441,</part-num-ref>
+ <part-num-ref name="conductor leads 441,">442</part-num-ref>
+ are electrically shielded.    </p>
+    <p id="p-52" num="52">
+      <confidence value="5">[</confidence>
+0046<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, the conductor leads <part-num-ref name="conductor leads">441,</part-num-ref>
+ <part-num-ref name="conductor leads 441,">442</part-num-ref>
+ act as sense leads for sensing (i.e., measuring) a voltage or a current of an ar<confidence value="5">c</confidence>
+ formed between an electrode and a work-piece during a welding procedure. Sense leads typically connect at one end to a specially designated sensor on a welding power supply. At the other end, the negative voltage sense lead (e.g., <part-num-ref name="">441)</part-num-ref>
+ is typically clamped or clipped onto the work- piece or workbench, and the positive voltage sense lead (e.g., <part-num-ref name="">442)</part-num-ref>
+ is typically connected to the wire feed motor.    </p>
+    <p id="p-53" num="53">
+      <confidence value="5">[</confidence>
+0047<confidence value="5">]</confidence>
+ In accordance with an alternative embodiment of the present invention, the conductor leads <part-num-ref name="conductor leads">441,</part-num-ref>
+ <part-num-ref name="conductor leads 441,">442</part-num-ref>
+ act as communication leads to transmit control or command signals between, for example, a power source and a wire feeder.    </p>
+    <p id="p-54" num="54">
+      <confidence value="5">[</confidence>
+0048<confidence value="5">]</confidence>
+ In accordance with a further alternative embodiment of the present invention, such a conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ may be integrated into the cable assembly configuration <part-num-ref name="cable assembly configuration">300</part-num-ref>
+ of Fig. 3 and serve as sense leads or communication leads.    </p>
+    <p id="p-55" num="55">
+      <confidence value="5">[</confidence>
+0049<confidence value="5">]</confidence>
+ In accordance with another alternative embodiment of the present invention, the conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ may include only one conductor lead (e.g., 441). In accordance with a further alternative embodiment of the present invention, the conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ may include more than two conductor leads, depending on the exact applications of sensing and/or communication.    </p>
+    <p id="p-56" num="56">
+      <confidence value="5">[</confidence>
+0050<confidence value="5">]</confidence>
+ Fig. 5 is a flowchart of an embodiment of a method <part-num-ref name="method">500</part-num-ref>
+ for constructing the coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">200</part-num-ref>
+ of Fig. 2, in accordance with various aspects of the present invention. In step <part-num-ref name="present invention. In step">510,</part-num-ref>
+ a plurality of electrically un-insulated peripheral electrical conductor lengths are wrapped around an electrically insulated central electrical conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central electrical conductor length.    </p>
+    <p id="p-57" num="57">In step 520, an electrically insulating jacket is applied around the plurality of peripheral electrical conductor lengths to contain the peripheral electrical conductor lengths and the electrically insulated central electrical conductor length.</p>
+    <boundary-data type="header">
+      <confidence value="88">11</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+    <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+    <p id="p-58" num="58">
+      <page-break num="12"/>
+      <confidence value="5">[</confidence>
+0051<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, a system for performing the method <part-num-ref name="method">500</part-num-ref>
+ of Fig. 5 comprises a means for wrapping a plurality of electrically un- insulated peripheral conductor lengths around an electrically insulated central conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central electrical conductor length, and a means for applying an electrically insulating jacket around the plurality of peripheral electrical conductor lengths to contain the peripheral conductor lengths and the electrically insulated central electrical conductor length.    </p>
+    <p id="p-59" num="59">
+      <confidence value="5">[</confidence>
+0052<confidence value="5">]</confidence>
+ As an example, the means for wrapping a plurality of electrically un-insulated peripheral conductor lengths around an electrically insulated central conductor length includes a robotic system <part-num-ref name="robotic system">700</part-num-ref>
+ having a first clamp <part-num-ref name="first clamp">710</part-num-ref>
+ capable of holding a first end of a central electrical conductor length <part-num-ref name="central electrical conductor length">210</part-num-ref>
+ in place and a first set of ends of a plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ in place, a second clamp <part-num-ref name="second clamp">720</part-num-ref>
+ capable of holding a second end of the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ in place, and a rotatable clamp <part-num-ref name="rotatable clamp">730</part-num-ref>
+ to hold the second set of ends of the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ and to rotate such that the plurality of peripheral electrical conductors <part-num-ref name="plurality of peripheral electrical conductors">220</part-num-ref>
+ wrap or wind around the central electrical conductor <part-num-ref name="central electrical conductor">210.</part-num-ref>
+ Similarly, a conductor lead assembly <part-num-ref name="conductor lead assembly">440</part-num-ref>
+ may be included with the plurality of peripheral electrical conductor lengths <part-num-ref name="plurality of peripheral electrical conductor lengths">220</part-num-ref>
+ to be wrapped around the central electrical conductor <part-num-ref name="central electrical conductor">210</part-num-ref>
+ at the same time.    </p>
+    <p id="p-60" num="60">
+      <confidence value="5">[</confidence>
+0053<confidence value="5">]</confidence>
+ Continuing with the example, the means for applying an electrically insulating jacket around the plurality of peripheral electrical conductor lengths includes a sliding clamp <part-num-ref name="sliding clamp">740</part-num-ref>
+ capable of clamping to a first end of an insulating jacket <part-num-ref name="insulating jacket">230</part-num-ref>
+ and sliding along the length of the central conductor <part-num-ref name="central conductor">210</part-num-ref>
+ and peripheral conductors <part-num-ref name="and peripheral conductors">220</part-num-ref>
+ to apply the insulating jacket <part-num-ref name="insulating jacket">230</part-num-ref>
+ over the conductors <part-num-ref name="conductors">210,</part-num-ref>
+ <part-num-ref name="conductors 210,">220.</part-num-ref>
+    </p>
+    <p id="p-61" num="61">
+      <confidence value="5">[</confidence>
+0054<confidence value="5">]</confidence>
+ Fig. 6 is a flowchart of an embodiment of a method <part-num-ref name="method">600</part-num-ref>
+ for constructing the coaxial welding cable assembly <part-num-ref name="coaxial welding cable assembly">300</part-num-ref>
+ of Fig. 3, in accordance with various aspects of the present invention. In step <part-num-ref name="present invention. In step">610,</part-num-ref>
+ a plurality of electrically insulated peripheral electrical conductor lengths are wrapped around an electrically un-insulated central electrical conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central electrical conductor length.    </p>
+    <p id="p-62" num="62">In step 620, an electrically insulating jacket is applied around the plurality of peripheral <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <boundary-data type="header">AKR - 109070.4</boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">Attorney Docket No. 201990.00008</boundary-data>
+electrical conductor lengths to contain the peripheral electrical conductor lengths and the electrically un-insulated central electrical conductor length.    </p>
+    <p id="p-63" num="63">
+      <confidence value="5">[</confidence>
+0055<confidence value="5">]</confidence>
+ In accordance with an embodiment of the present invention, a system for performing the method <part-num-ref name="method">600</part-num-ref>
+ of Fig. 6 comprises a means for wrapping a plurality of electrically insulated peripheral conductor lengths around an electrically un-insulated central conductor length, wherein a total cross-sectional area of the plurality of peripheral electrical conductor lengths is approximately the same as a cross-sectional area of the central electrical conductor length, and a means for applying an electrically insulating jacket around the plurality of peripheral electrical conductor lengths to contain the peripheral conductor lengths and the electrically un-insulated central electrical conductor length. The robotic system <part-num-ref name="robotic system">700</part-num-ref>
+ of Fig. 7, or similar system, may be used to perform the method <part-num-ref name="method">600</part-num-ref>
+ of Fig. 6, in accordance with an embodiment of the present invention.    </p>
+    <p id="p-64" num="64">
+      <confidence value="5">[</confidence>
+0056<confidence value="5">]</confidence>
+ In summary, coaxial cable assemblies for welding applications, and methods and systems for constructing same assemblies, are disclosed. The cable assemblies reduce the amount of insulating material used within the cable assemblies, thereby making the cable assemblies lighter in weight and more flexible, and providing a relatively uniform resistance path through the cable.    </p>
+    <p id="p-65" num="65">
+      <confidence value="5">[</confidence>
+0057<confidence value="5">]</confidence>
+ While the invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.    </p>
+    <boundary-data type="header">
+      <confidence value="88">13</confidence>
+    </boundary-data>
+    <boundary-data type="header">AKR - 109070.4</boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11468107.xml

@@ -0,0 +1,456 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11468107</doc-number>
+        <date>2006-08-29</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">UNITED STATES</heading>
+    <heading id="h-2">PATENT APPLICATION</heading>
+    <p id="p-1" num="1">for </p>
+    <heading id="h-3">A SYSTEM AND METHOD FOR MANAGING A</heading>
+    <heading id="h-4">PLURALITY OF DATABASE SYSTEMS</heading>
+    <p id="p-2" num="2">NCR Docket No. 12162 submitted by </p>
+    <heading id="h-5">DOUGLAS P. BROWN</heading>
+    <heading id="h-6">ANITA RICHARDS</heading>
+    <p id="p-3" num="3">on behalf of Teradata a Division of NCR Corporation Dayton, Ohio <boundary-data type="header">
+        <confidence value="8">1</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+A System and Method for Managing a Plurality of Database Systems Cross Reference to Other Applications [0001] This application claims priority under <part-num-ref name="Plurality of Database Systems Cross Reference to Other Applications [0001] This application claims priority under">35</part-num-ref>
+ U.S.C. <confidence value="5">§</confidence>
+119(e) to the following co-pending and <boundary-data type="line-number">5   </boundary-data>
+commonly-assigned patent application, which is incorporated herein by reference: Provisional Application Serial No. 60/715,815, entitled "A SYSTEM AND METHOD FOR MANAGING A PLURALITY OF DATABASE SYSTEMS," filed on September <part-num-ref name="PLURALITY OF DATABASE SYSTEMS,&quot; filed on September">9,</part-num-ref>
+ <part-num-ref name="PLURALITY OF DATABASE SYSTEMS,&quot; filed on September 9,">2005,</part-num-ref>
+ attorney's docket number <part-num-ref name="PLURALITY OF DATABASE SYSTEMS,&quot; filed on September 9, 2005, attorney's docket number">12162.</part-num-ref>
+    </p>
+    <p id="p-4" num="4">[0002] This application incorporates by way of cross reference the subject matter disclosed in: United <boundary-data type="line-number">10   </boundary-data>
+States Patent Application Serial No. 10/730,348, filed December <part-num-ref name="subject matter disclosed in: United States Patent Application Serial No. 10/730,348, filed December">8,</part-num-ref>
+ <part-num-ref name="subject matter disclosed in: United States Patent Application Serial No. 10/730,348, filed December 8,">2003,</part-num-ref>
+ entitled Administering the Workload of a Database System Using Feedback, by Douglas P. Brown, Anita Richards, Bhashyam Ramesh, Caroline M. Ballinger and Richard D. Glick, NCR Docket No. 11167; United States Patent Application Serial No. 10/786,448, filed February <part-num-ref name="Database System Using Feedback, by Douglas P. Brown, Anita Richards, Bhashyam Ramesh, Caroline M. Ballinger and Richard D. Glick, NCR Docket No. 11167; United States Patent Application Serial No. 10/786,448, filed February">25,</part-num-ref>
+ <part-num-ref name="Database System Using Feedback, by Douglas P. Brown, Anita Richards, Bhashyam Ramesh, Caroline M. Ballinger and Richard D. Glick, NCR Docket No. 11167; United States Patent Application Serial No. 10/786,448, filed February 25,">2004,</part-num-ref>
+ entitled Guiding the Development of Workload Group Definition Classifications, by Douglas P. Brown, Bhashyam Ramesh and Anita <boundary-data type="line-number">15   </boundary-data>
+Richards, NCR Docket No. 11569; and United States Patent Application Serial No. 10/889,796, filed July <part-num-ref name="Development of Workload Group Definition Classifications, by Douglas P. Brown, Bhashyam Ramesh and Anita Richards, NCR Docket No. 11569; and United States Patent Application Serial No. 10/889,796, filed July">13,</part-num-ref>
+ <part-num-ref name="Development of Workload Group Definition Classifications, by Douglas P. Brown, Bhashyam Ramesh and Anita Richards, NCR Docket No. 11569; and United States Patent Application Serial No. 10/889,796, filed July 13,">2004,</part-num-ref>
+ entitled Administering Workload Groups, by Douglas P. Brown, Anita Richards, and Bhashyam Ramesh, NCR Docket No. <part-num-ref name="Development of Workload Group Definition Classifications, by Douglas P. Brown, Bhashyam Ramesh and Anita Richards, NCR Docket No. 11569; and United States Patent Application Serial No. 10/889,796, filed July 13, 2004, entitled Administering Workload Groups, by Douglas P. Brown, Anita Richards, and Bhashyam Ramesh, NCR Docket No.">11560,</part-num-ref>
+ and United States Patent Application Serial No.    </p>
+    <p id="p-5" num="5">10/915,609, filed August 10, 2004, entitled Regulating the Workload of a Database System, by Douglas P. Brown, Anita Richards, and Bhashyam Ramesh, NCR Docket No. <part-num-ref name="Database System, by Douglas P. Brown, Anita Richards, and Bhashyam Ramesh, NCR Docket No.">11561.</part-num-ref>
+    </p>
+    <p id="p-6" num="6">
+      <boundary-data type="line-number">20                                         </boundary-data>
+Back<confidence value="68">gr</confidence>
+ound [0003] Any discussion of the prior art throughout the specification should in no way be considered as an admission that such prior art is widely known or forms part of common general knowledge in the field.    </p>
+    <p id="p-7" num="7">[0004] As database management systems (DBMS) continue to increase in function and expand into <boundary-data type="line-number">25   </boundary-data>
+new application areas, the diversity of database workloads is increasing as well. In addition to the classic relational DBMS workload consisting of short transactions running concurrently with long decision support queries, workloads comprising of an even wider range of system demands are emerging. New complex data types, such as image files, audio files, video files and other large objects, and new active data warehouse requirements, such as capacity on demand, data replication, <boundary-data type="line-number">30   </boundary-data>
+fault-tolerance, dual active query processing, recursion, user defined types (UDFs), external UDFs, and so on, result in widely varying memory, processor, disk and network demands on database systems.    </p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-8" num="8">
+      <page-break num="3"/>
+[0005] In general, a DBMS has a number of operational characteristics. These include physical statistics, such as CPU usage, query response times and performance statistics. In some DBMS, the operational characteristics include rule sets under which the database operates, relating to the likes of resource consumption and request prioritization. Varying these rule sets often has an effect on other <boundary-data type="line-number">5 </boundary-data>
+physical characteristics, for example altering performance statistics. Ideally, a DBMS should be able to accept performance goals for a workload and dynamically adjust its own performance based on whether or not these goals are being met. Closed-loop system management (CLSM) is a technology directed towards this ideal. Under some known CLSM-type systems, incoming queries are split into workload groups, each workload group having respective performance goals. The DBMS is <boundary-data type="line-number">10 </boundary-data>
+responsive to these whether or not these goals are met for selectively switching between predetermined rule sets or adjusting performance controls.    </p>
+    <p id="p-9" num="9">[0006] It is known to operate multi-system environments, wherein a plurality of databases, database systems, or DBMS operate in parallel. For example: DBMS that use Massively Parallel Processing (MPP) architecture across multiple systems or a Symmetric Multiprocessing (SMP) architecture. In <boundary-data type="line-number">
+        <confidence value="66">15</confidence>
+       </boundary-data>
+particular, it is known to operate a "dual-active" system wherein a plurality of databases operate in parallel and intercommunicate. For example, by way of inter process communication mechanisms such as TCP/IP, UDP, BYNET networks, and the like. It will be appreciated that managing complex workloads and performance goals performance objectives across the board in a multi-system environment is difficult.    </p>
+    <p id="p-10" num="10">
+      <boundary-data type="line-number">20                                            </boundary-data>
+Summary [0007] It is an object of the present invention to overcome or ameliorate at least one of the disadvantages of the prior art, or to provide a useful alternative.    </p>
+    <p id="p-11" num="11">[0008] In accordance with a first aspect of the invention, there is provided a system for managing a plurality of database systems, the system including:</p>
+    <p id="p-12" num="12">
+      <boundary-data type="line-number">25         </boundary-data>
+[0009] an interface for obtaining data indicative of one or more operational characteristics of each of the database systems; and [0010] a monitor that is responsive to the data for providing a signal indicative of an instruction to adjust one or more of the operational characteristics of a selected one of the database systems.    </p>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-13" num="13">
+      <page-break num="4"/>
+[0011] In accordance with a second aspect of the invention, there is provided a method for managing a plurality of database systems, the method including the steps of<confidence value="5">:</confidence>
+    </p>
+    <p id="p-14" num="14">[0012] obtaining data indicative of one or more operational characteristics of each of the database systems; and <boundary-data type="line-number">5          </boundary-data>
+[0013] being responsive to the data for providing an instruction to adjust one or more of the operational characteristics of a selected one of the database systems.    </p>
+    <p id="p-15" num="15">[0014] In accordance with a further aspect of the invention, there is provided method for administering the workload of a plurality of database systems as one or more requests are received by a management system, the method including:</p>
+    <p id="p-16" num="16">
+      <boundary-data type="line-number">10         </boundary-data>
+[0015] sorting the one or more requests into one or more workload groups, each workload group having an associated level of service desired from the database system;    </p>
+    <p id="p-17" num="17">[0016] selecting a database system to process the or each request to achieve the levels of service associated with each of the workload groups;</p>
+    <p id="p-18" num="18">[0017] executing the one or more requests to achieve the levels of service associated with each <boundary-data type="line-number">
+        <confidence value="66">15</confidence>
+                </boundary-data>
+of the workload groups;    </p>
+    <p id="p-19" num="19">[0018] assigning system resources of one or more of the database systems to the one or more workload groups as necessary to provide the level of service associated with each workload group;</p>
+    <p id="p-20" num="20">[0019] monitoring the execution of requests to detect a deviation from the level of service <boundary-data type="line-number">20          </boundary-data>
+greater than a short-term threshold and, if such a deviation is detected:    </p>
+    <p id="p-21" num="21">[0020] adjusting the assignment of system resources of one or more of the database systems to workload groups to reduce the deviation; and [0021] monitoring on a long-term basis to detect deviations from the expected level of service greater than a long-term threshold, and if such a deviation is detected:</p>
+    <p id="p-22" num="22">
+      <boundary-data type="line-number">25                </boundary-data>
+[0022] adjusting the execution of requests to better provide the expected level of service.    </p>
+    <boundary-data type="header">
+      <confidence value="8">4</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-23" num="23">
+      <page-break num="5"/>
+Brief Description of the Drawings [0023] The benefits and advantages of the present invention will become apparent to those skilled in the art to which this invention relates from the subsequent description of exemplary embodiments and the appended claims, taken in conjunction with the accompanying drawings, in which:    </p>
+    <p id="p-24" num="24">
+      <boundary-data type="line-number">5 </boundary-data>
+[0024] Fig. 1 is a schematic representation of a system according to the invention.    </p>
+    <p id="p-25" num="25">[0025] Figure 2 is schematic representation of a multi system regulator;</p>
+    <p id="p-26" num="26">[0026] Figure 3 is an architectural diagram of a multi-system regulator; and [0027] Figure 4 is a high level architectural flow diagram of a multi-system regulator receiving sub- system CLSM regulator information using a binary cascade tree.</p>
+    <p id="p-27" num="27">
+      <boundary-data type="line-number">10                                      </boundary-data>
+Detailed Description [0028] Referring to the drawings, it will be appreciated that, in the different figures, corresponding features have been denoted by corresponding reference numerals.    </p>
+    <p id="p-28" num="28">[0029] Referring initially to Figure 1, there is provided a system <part-num-ref name="system">1</part-num-ref>
+ for managing a plurality of database systems, referred to as databases <part-num-ref name="plurality of database systems, referred to as databases">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ System <part-num-ref name="and 3. System">1</part-num-ref>
+ includes an interface <part-num-ref name="interface">4</part-num-ref>
+ for obtaining data <part-num-ref name="for obtaining data">5</part-num-ref>
+ <boundary-data type="line-number">15 </boundary-data>
+indicative of one or more operational characteristics of each of databases <part-num-ref name="indicative of one or more operational characteristics of each of databases">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ A monitor <part-num-ref name="monitor">6</part-num-ref>
+ is responsive to the data <part-num-ref name="data">5</part-num-ref>
+ for providing a signal <part-num-ref name="signal">7</part-num-ref>
+ indicative of an instruction to adjust one or more of the operational characteristics of a selected one of databases <part-num-ref name="selected one of databases">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ In Figure 1, for the sake of illustration, the selected database is database <part-num-ref name="selected database is database">2.</part-num-ref>
+    </p>
+    <p id="p-29" num="29">[0030] In the present disclosure, the term "database" is used in a general sense, and is meant to include <boundary-data type="line-number">20 </boundary-data>
+the wider range of components used in conjunction with a database in a database system or DBMS. In some embodiments databases <part-num-ref name="database system or DBMS. In some embodiments databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ are simple tables of data, whereas in other embodiments they include complex DMBS. For the sake of the present example, databases <part-num-ref name="present example, databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ are database systems that make use of CLSM-type architecture, and each includes a CLSM-type regulator. An example of such a database system is Teradata V2R6. Teradata is a trademark of NCR Corporation.    </p>
+    <p id="p-30" num="30">
+      <boundary-data type="line-number">25 </boundary-data>
+At a high level, system <part-num-ref name="high level, system">1</part-num-ref>
+ operates as a feedback response mechanism for a domain defined by a plurality of databases. It is responsive to the performance of the domain insofar as database requests are preformed within predefined threshold requirements. System <part-num-ref name="domain insofar as database requests are preformed within predefined threshold requirements. System">1</part-num-ref>
+ is responsive to data indicative of this performance for adjusting settings, such as resource consumption rules and query prioritization <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+settings. In many embodiments, this is used to better ensure that the available resources are utilized in a manner conducive to efficiently processing a variable workload.    </p>
+    <p id="p-31" num="31">[0031] It will be appreciated that the terms "workload class", "workload group" and workload definition" are substantially synonymous. That is, the terms each relate to the same general <boundary-data type="line-number">5   </boundary-data>
+identification structure used to separate requests for prioritization, processing and performance monitoring in a CLSM database system.    </p>
+    <p id="p-32" num="32">[0032] In the present example, each of databases <part-num-ref name="present example, each of databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ analyze its performance and inherently adjusts its respective operational characteristics in response to the analysis. The analysis includes determining whether a particular class of queries are processed in accordance with one or more service <boundary-data type="line-number">
+        <confidence value="66">10</confidence>
+         </boundary-data>
+level goals (SLGs) assigned to that class of queries. It will be appreciated that, in the present embodiment, this is achieved through the CLSM architecture of database <part-num-ref name="CLSM architecture of database">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ In brief, each database separates incoming queries into workload groups in accordance with predefined principles.    </p>
+    <p id="p-33" num="33">Each workload group has assigned to it one or more respective service level goals (SLGs). The database maintains logs and obtains data to determine whether or not SLGs are being met for particular <boundary-data type="line-number">
+        <confidence value="86">15</confidence>
+         </boundary-data>
+workload groups, and makes adjustments to operational characteristics in response. The typical objective is to adjust available settings such that the SLGs are met. This commonly includes using throttles and/or a query delay manager to adjust arrival rates of queries.    </p>
+    <p id="p-34" num="34">[0033] The precise nature of how workload groups are defined and settings adjusted is generally beyond the scope of the present disclosure, and various aspects are dealt with is detail in the cross- <boundary-data type="line-number">20   </boundary-data>
+referenced applications.    </p>
+    <p id="p-35" num="35">[0034] Other embodiments are used with databases that use alternate architectures to analyze their performance and inherently adjust their respective operational characteristics in response to the analysis.</p>
+    <p id="p-36" num="36">[0035] In the present example, operational characteristics include performance statistics, rule sets <boundary-data type="line-number">25   </boundary-data>
+under which a database is operating, physical attributes, and so on. Some particular examples are set out below.    </p>
+    <p id="p-37" num="37">[0036] Memory - the amount of system and subsystem memory currently being used. It is possible that the system will include some memory that is shared among all of the subsystems.</p>
+    <boundary-data type="header">
+      <confidence value="8">6</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-38" num="38">
+      <page-break num="7"/>
+[0037] The number of available AMP worker tasks (AWTs). An AWT is a thread or task within an AMP for performing the work assigned by a dispatcher. Each AMP has a predetermined number of AWTs in a poo<confidence value="8">l</confidence>
+ available for processing. When a task is assigned to an AMP, one or more AWTs are assigned to complete the task. When the task is complete, the <boundary-data type="line-number">5          </boundary-data>
+AWTs are released back into the pool. As an AMP is assigned tasks to perform, its available AWTs are reduced. As it completes tasks, its available AWTs are increased.    </p>
+    <p id="p-39" num="39">[0038] FSG Cache - the amount of FSG cache that has been consumed. The FSG cache is physical memory that buffers data as it is being sent to or from the data storage facilities.</p>
+    <p id="p-40" num="40">[0039] Arrival rates - the rate at which requests are arriving. Arrival rates are often broken <boundary-data type="line-number">10          </boundary-data>
+down and used as a resource management tool on a workload basis. Typically, throttles are used to delay the processing of queries and thereby adjust arrival rates.    </p>
+    <p id="p-41" num="41">[0040] Co-existence - the co-existence of multiple types of processors and or processor types.</p>
+    <p id="p-42" num="42">For example, a where first node runs on a <part-num-ref name="">386</part-num-ref>
+ processor and others run on <part-num-ref name="processor and others run on">486</part-num-ref>
+ or <part-num-ref name="or">586</part-num-ref>
+ processors.    </p>
+    <p id="p-43" num="43">
+      <boundary-data type="line-number">15         </boundary-data>
+[0041] Skew <confidence value="6">-</confidence>
+ the degree to which data (and therefore processing) is concentrated in one or more AMPs as compared to the other AMPs.    </p>
+    <p id="p-44" num="44">[0042] Blocking/locking - the degree to which data access are blocked or locked because other processes are accessing data.</p>
+    <p id="p-45" num="45">[0043] Spool - the degree of consumption of disk space allocated to temporary storage.</p>
+    <p id="p-46" num="46">
+      <boundary-data type="line-number">20          </boundary-data>
+[0044] Disk failures, such as clique failures.    </p>
+    <p id="p-47" num="47">[0045] Node failures.</p>
+    <p id="p-48" num="48">[0046<confidence value="5">]</confidence>
+ System 1 includes an input <part-num-ref name="input">8</part-num-ref>
+ for receiving a request <part-num-ref name="request">9</part-num-ref>
+ from a user <part-num-ref name="user">10.</part-num-ref>
+ Although user <part-num-ref name="user 10. Although user">10</part-num-ref>
+ is illustrated as a person, it will be appreciated that various hardware and software devices also provide requests <part-num-ref name="person, it will be appreciated that various hardware and software devices also provide requests">9.</part-num-ref>
+    </p>
+    <p id="p-49" num="49">
+      <boundary-data type="line-number">25   </boundary-data>
+[0047] Request 9 is typically a database query, such as a tactical query. In the present embodiment databases <part-num-ref name="present embodiment databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ define a dual-active domain. As such, either of databases <part-num-ref name="dual-active domain. As such, either of databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ is capable of <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+handling a request <part-num-ref name="request">9.</part-num-ref>
+ Despite this, it will be appreciated that one of the databases is often able to handle a request <part-num-ref name="request">9</part-num-ref>
+ more efficiently given its operational characteristics. As such, a processor <part-num-ref name="processor">12</part-num-ref>
+ is responsive to interface <part-num-ref name="is responsive to interface">4</part-num-ref>
+ for selecting one of databases to process a received request <part-num-ref name="received request">9.</part-num-ref>
+ An output <part-num-ref name="output">13</part-num-ref>
+ provides the request the selected database for processing. In Figure 1 output <part-num-ref name="output">13</part-num-ref>
+ is shown to be <boundary-data type="line-number">5   </boundary-data>
+providing requests to both database <part-num-ref name="is shown to be providing requests to both database">2</part-num-ref>
+ and database <part-num-ref name="and database">3.</part-num-ref>
+ This is meant to illustrate the provision of at least two discrete requests, and not a single request being provided to both databases. In the present embodiment, output <part-num-ref name="present embodiment, output">13</part-num-ref>
+ provides request <part-num-ref name="provides request">9</part-num-ref>
+ in accordance with a predetermined query prioritization protocol, such as that administered by an implementation of Teradata Priority Scheduler Facility (PSF) or a similar component. Monitor <part-num-ref name="similar component. Monitor">6</part-num-ref>
+ adjusts this predetermined query prioritization protocol in response <boundary-data type="line-number">10   </boundary-data>
+to data <part-num-ref name="adjusts this predetermined query prioritization protocol in response to data">5.</part-num-ref>
+ For example in an embodiment where PSF is used, monitor <part-num-ref name="embodiment where PSF is used, monitor">12</part-num-ref>
+ adjusts the PSF settings such a class weights in accordance with the functionality of a standard Teradata CLSM regulator.    </p>
+    <p id="p-50" num="50">[0048] Processor 12 categorizes the request into one of a plurality of predetermined workload groups.</p>
+    <p id="p-51" num="51">As previously mentioned, each workload group has respective SLGs. These SLGs relate to response times and the like - generally levels of service that are expected from databases <part-num-ref name="like - generally levels of service that are expected from databases">2</part-num-ref>
+ or <part-num-ref name="or">3</part-num-ref>
+ in the <boundary-data type="line-number">15   </boundary-data>
+processing of a request <part-num-ref name="request">9.</part-num-ref>
+ In determining which database should be selected to process a request <part-num-ref name="request">9,</part-num-ref>
+ processor <part-num-ref name="request 9, processor">12</part-num-ref>
+ is responsive to operational characteristics that indicate ability of a particular database to process a request belonging to a particular workload group in accordance with the service level goals of that workload group. For example, each database is operated under one of a group of predetermined system resource consumption rules sets. Processor <part-num-ref name="group of predetermined system resource consumption rules sets. Processor">12</part-num-ref>
+ is initiated to recognize a particular rule set as <boundary-data type="line-number">20   </boundary-data>
+being particularly suited to handling a certain workload mix.    </p>
+    <p id="p-52" num="52">[0049] As a simple example, consider two generic exemplary workload groups - tactical queries and background queries. A rule set A is most suitable for handling tactical queries, and a rule set B is most suitable for handling background queries. For the sake of the example, interface <part-num-ref name="example, interface">5</part-num-ref>
+ has obtained data indicative of database <part-num-ref name="has obtained data indicative of database">2</part-num-ref>
+ operating under rule set A, and database <part-num-ref name="and database">3</part-num-ref>
+ operating under rule set B. A <boundary-data type="line-number">25   </boundary-data>
+tactical query is received by interface <part-num-ref name="tactical query is received by interface">4,</part-num-ref>
+ and recognized as a tactical query by processor <part-num-ref name="tactical query by processor">12.</part-num-ref>
+ Processor <part-num-ref name="tactical query by processor 12. Processor">12</part-num-ref>
+ is then responsive to interface <part-num-ref name="is then responsive to interface">4</part-num-ref>
+ for selecting database <part-num-ref name="for selecting database">2</part-num-ref>
+ to process that tactical query.    </p>
+    <p id="p-53" num="53">[0050] The above example is over simplistic to a degree. In some circumstances, interface <part-num-ref name="degree. In some circumstances, interface">4</part-num-ref>
+ obtains other operational characteristics of database <part-num-ref name="obtains other operational characteristics of database">2</part-num-ref>
+ that suggest it is not meeting SLGs for tactical queries, in spite of the local CLSM regulator's operation. In such a case, processor <part-num-ref name="case, processor">12</part-num-ref>
+ selects database <part-num-ref name="selects database">3</part-num-ref>
+ for <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+the tactical query. In practical terms, tactical queries are directed to database <part-num-ref name="tactical query. In practical terms, tactical queries are directed to database">3</part-num-ref>
+ until interface <part-num-ref name="until interface">4</part-num-ref>
+ obtains data to which processor <part-num-ref name="obtains data to which processor">12</part-num-ref>
+ is responsive for altering the procedure.    </p>
+    <p id="p-54" num="54">[0051<confidence value="5">]</confidence>
+ In some circumstances interface 4 obtains operational characteristics of databases <part-num-ref name="obtains operational characteristics of databases">2</part-num-ref>
+ and <part-num-ref name="and">3</part-num-ref>
+ - such as AMP worker task (AWT) congestion - and in response throttles queries to adjust request <boundary-data type="line-number">5   </boundary-data>
+arrival rates until the AWT resources become available. It will be appreciated that CLSM architecture supports the ability to delay incoming requests using a query delay manager and/or delay queue.    </p>
+    <p id="p-55" num="55">[0052] Monitor 6 is responsive to processor <part-num-ref name="is responsive to processor">12</part-num-ref>
+ for providing a signal <part-num-ref name="signal">7.</part-num-ref>
+ Using the above example, when processor <part-num-ref name="above example, when processor">12</part-num-ref>
+ begins to send a stream of tactical queries to database <part-num-ref name="stream of tactical queries to database">3,</part-num-ref>
+ the workload mix of database <part-num-ref name="workload mix of database">3</part-num-ref>
+ changes. As such, rule set B is not necessarily the optimal choice - in the present example <boundary-data type="line-number">10   </boundary-data>
+a rule set C is more suitable. In such a case, monitor <part-num-ref name="case, monitor">6</part-num-ref>
+ takes the pro-active step of sending a signal <part-num-ref name="signal">7</part-num-ref>
+ to database <part-num-ref name="to database">3,</part-num-ref>
+ and in response database <part-num-ref name="to database 3, and in response database">3</part-num-ref>
+ adapts for operation under rules set C.    </p>
+    <p id="p-56" num="56">[0053] Processor 12 is responsive to whether SLGs for requests <part-num-ref name="is responsive to whether SLGs for requests">9</part-num-ref>
+ are being met across the domain defined collectively by databases <part-num-ref name="domain defined collectively by databases">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ To this end, monitor <part-num-ref name="and 3. To this end, monitor">6</part-num-ref>
+ takes on a functionality similar to that of a CLSM reg<confidence value="8">u</confidence>
+lator and adjusts operational characteristic such as rule sets for either or both of <boundary-data type="line-number">15   </boundary-data>
+databases <part-num-ref name="CLSM regulator and adjusts operational characteristic such as rule sets for either or both of databases">2</part-num-ref>
+ and <part-num-ref name="and">3.</part-num-ref>
+ It will be appreciated that this assists in the provision of a domain wide approach to workload administration.    </p>
+    <p id="p-57" num="57">[0054] It will be appreciated that, at a high level, system <part-num-ref name="high level, system">1</part-num-ref>
+ functions in a similar manner to a CLSM reg<confidence value="8">u</confidence>
+lator. That is, it monitors on a short-term basis the execution of requests to detect a deviation from the SLGs, and where a sufficient deviation is detected the assignment system resources to particular <boundary-data type="line-number">20   </boundary-data>
+workload groups across the plurality of databases is adjusted to reduce the deviation.    </p>
+    <p id="p-58" num="58">[0055] Referring to Fig<confidence value="5">u</confidence>
+res 2, 3 and <part-num-ref name="and">4,</part-num-ref>
+ embodiments will now be described with reference to a plurality of dual-active Teradata V2R6 databases. The embodiment makes use of various Teradata components, such as Teradata Workload Analyzer and Priority Scheduler Facility. Those skilled in the art will recognize that similar embodiments are implemented using alternate hardware and software <boundary-data type="line-number">25   </boundary-data>
+components.    </p>
+    <p id="p-59" num="59">[0056] Managing system resources on the basis of individual systems and requests does not, in general, satisfactorily manage complex workloads and SLGs across a domain of databases in a multi- system environment. To automatically achieve workload goals across multi-systems, performance goals must first be defined across the domain and managed and reg<confidence value="8">u</confidence>
+lated across the domain.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-60" num="60">
+      <page-break num="10"/>
+[0057] Teradata's CLSM functionality is known to manage workloads on an individual system basis.    </p>
+    <p id="p-61" num="61">Under the present embodiment, a modified CLSM analyzer and CLSM regulator are implemented to enhance the known CLSM architecture. That is, by extending the functionality of the CLSM- administrator and CLSM regulator components in accordance with the general notions of system <part-num-ref name="general notions of system">1,</part-num-ref>
+ <boundary-data type="line-number">5   </boundary-data>
+complex workloads are manageable across a domain. The modified CLSM regulator is in the form of a multi-system regulator <part-num-ref name="multi-system regulator">50.</part-num-ref>
+ The function of regulator <part-num-ref name="function of regulator">50</part-num-ref>
+ is to control and manage existing CLSM regulators <part-num-ref name="is to control and manage existing CLSM regulators">52</part-num-ref>
+ across all sub-systems <part-num-ref name="across all sub-systems">53</part-num-ref>
+ in a domain <part-num-ref name="domain">54.</part-num-ref>
+ The new functionality extends the existing CLSM goal oriented workload management infrastructure, which is capable of managing various types of workloads.    </p>
+    <p id="p-62" num="62">
+      <boundary-data type="line-number">10   </boundary-data>
+[0058] Although Figure 2 depicts an implementation using a single regulator <part-num-ref name="single regulator">50</part-num-ref>
+ for the entire domain <part-num-ref name="entire domain">54,</part-num-ref>
+ in some exemplary systems one or more backup regulators <part-num-ref name="entire domain 54, in some exemplary systems one or more backup regulators">50</part-num-ref>
+ are also provided for circumstances where the primary multi-system regulator malfunctions.    </p>
+    <p id="p-63" num="63">[0059] Referring to Figure 3, multi-system regulator 50 includes an exception monitor <part-num-ref name="exception monitor">55</part-num-ref>
+ for detecting workload exceptions, which are recorded in a log <part-num-ref name="log">59.</part-num-ref>
+ For example, recorded exceptions typically <boundary-data type="line-number">
+        <confidence value="66">15</confidence>
+       </boundary-data>
+include such things as CPU and <confidence value="225">11O</confidence>
+ exceeding known predetermined thresholds. A system condition monitor <part-num-ref name="system condition monitor">56</part-num-ref>
+ is provided to detect system conditions - such as node failures. These collectively define an exception attribute monitor <part-num-ref name="exception attribute monitor">57.</part-num-ref>
+    </p>
+    <p id="p-64" num="64">[0060] In practice, regulator 50 receives requests, and assig<confidence value="8">n</confidence>
+s these into their respective workload groups and priority classes at <part-num-ref name="receives requests, and assigns these into their respective workload groups and priority classes at">60.</part-num-ref>
+ The assigned requests are then passed through a workload query <boundary-data type="line-number">20   </boundary-data>
+manager, also known as a delay manager at <part-num-ref name="delay manager at">61.</part-num-ref>
+ The delay manager provides throttling functionality.    </p>
+    <p id="p-65" num="65">In particular, it is responsive to workload rules 58 and exception monitor <part-num-ref name="and exception monitor">55</part-num-ref>
+ for either passing a request on or placing it in a queue until predetermined conditions are met. It will be appreciated that this allows for arrival rates to be adjusted. If passed, the requests are split into their priority classes for handling by PSF <part-num-ref name="requests are split into their priority classes for handling by PSF">62.</part-num-ref>
+ PSF <part-num-ref name="requests are split into their priority classes for handling by PSF 62. PSF">62</part-num-ref>
+ is responsive to the priority classes for providing the requests in <boundary-data type="line-number">25   </boundary-data>
+accordance with predefined principles for processing at <part-num-ref name="requests in accordance with predefined principles for processing at">63.</part-num-ref>
+ These principles are updated over time in response to system monitor <part-num-ref name="requests in accordance with predefined principles for processing at 63. These principles are updated over time in response to system monitor">56</part-num-ref>
+ and exception monitor <part-num-ref name="and exception monitor">55.</part-num-ref>
+ PSF reports observed system conditions to monitor <part-num-ref name="and exception monitor 55. PSF reports observed system conditions to monitor">56</part-num-ref>
+ and throughput information to monitor <part-num-ref name="and throughput information to monitor">55,</part-num-ref>
+ which are responsive to such information for updating the principles under which PSF operates.    </p>
+    <p id="p-66" num="66">[0061] Each regulator 52 uses a set of user-defined rules, or heuristics, to guide a feedback mechanism <part-num-ref name="feedback mechanism">30</part-num-ref>
+  that manages the throughput of a workload for each workload group defined in the Teradata system. In <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+general, multi-system regulator <part-num-ref name="Teradata system. In general, multi-system regulator">50</part-num-ref>
+ provides a single view of managing workloads and the associated rules across multiple systems. Meanwhile, regulators <part-num-ref name="associated rules across multiple systems. Meanwhile, regulators">52</part-num-ref>
+ continue to support workloads in a Closed Loop System Environment running on each sub-system <part-num-ref name="Closed Loop System Environment running on each sub-system">53</part-num-ref>
+ defined in domain <part-num-ref name="defined in domain">54.</part-num-ref>
+    </p>
+    <p id="p-67" num="67">[0062<confidence value="5">]</confidence>
+ Multi system regulator 50 manages PSF settings and workload groups by controlling sub- <boundary-data type="line-number">5   </boundary-data>
+system CLSM regulators and/or adjusting workload rules in order to achieve SLGs. It also monitors operational characteristics such as system conditions, exceptions, system failures, workload exceptions and the like. Further, it controls the amount of work allowed into each subsystem <part-num-ref name="amount of work allowed into each subsystem">53</part-num-ref>
+ to meet SLGs across domain <part-num-ref name="to meet SLGs across domain">54.</part-num-ref>
+    </p>
+    <p id="p-68" num="68">[0063] Regulator 50 gathers system resource information by broadcasting to all regulators <part-num-ref name="gathers system resource information by broadcasting to all regulators">52</part-num-ref>
+ in <boundary-data type="line-number">10 </boundary-data>
+domain <part-num-ref name="in domain">54</part-num-ref>
+ a request that they report their current resource consumption. This will be recognized as the functionality of interface <part-num-ref name="functionality of interface">4</part-num-ref>
+ in the previous example.    </p>
+    <p id="p-69" num="69">[0064] In some embodiments each subsystem 53 has its own subsystems, and so on. An example of this is shown in Figure 4, which illustrates a binary tree structure. In such embodiments, each regulator <part-num-ref name="binary tree structure. In such embodiments, each regulator">52</part-num-ref>
+ gathers information related to its resource consumption, as well as that of its children <boundary-data type="line-number">
+        <confidence value="66">15</confidence>
+       </boundary-data>
+regulators <part-num-ref name="gathers information related to its resource consumption, as well as that of its children regulators">52,</part-num-ref>
+ and reports the aggregated compiled resource consumption information to its parent regulator <part-num-ref name="aggregated compiled resource consumption information to its parent regulator">52,</part-num-ref>
+ or regulator <part-num-ref name="aggregated compiled resource consumption information to its parent regulator 52, or regulator">50</part-num-ref>
+ in the case for first level regulators <part-num-ref name="case for first level regulators">52.</part-num-ref>
+ In some cases each regulator <part-num-ref name="case for first level regulators 52. In some cases each regulator">52</part-num-ref>
+ waits until it has received resource consumption information from its children before forwarding the compiled resource consumption information to its parent. In that way, the resource consumption information is compiled from the bottom of the tree to the top. When regulator <part-num-ref name="top. When regulator">50</part-num-ref>
+ compiles its <boundary-data type="line-number">20 </boundary-data>
+resource consumption information with that which is reported by all of regulators <part-num-ref name="compiles its resource consumption information with that which is reported by all of regulators">52,</part-num-ref>
+ it will have complete system conditions and resource consumption information for domain <part-num-ref name="compiles its resource consumption information with that which is reported by all of regulators 52, it will have complete system conditions and resource consumption information for domain">54.</part-num-ref>
+ Regulator <part-num-ref name="compiles its resource consumption information with that which is reported by all of regulators 52, it will have complete system conditions and resource consumption information for domain 54. Regulator">50</part-num-ref>
+ will analyze the aggregated information to apply resource consumption rules and make resource adjustments based on multiple sets of system information.    </p>
+    <p id="p-70" num="70">[0065] In the example shown in Figure 4, the tree is a binary tree. It will be understood that other <boundary-data type="line-number">25 </boundary-data>
+types of trees will fall within the scope of this broad invention. In particular: n-ary trees in a broader context. Further, while the tree in Figure 4 is symmetrical, symmetry is not a limitation. Indeed, the example of Figure 4 is provided for the purposes of convenient representation only, and is not intended to be limiting in any way.    </p>
+    <boundary-data type="header">
+      <confidence value="66">11</confidence>
+    </boundary-data>
+    <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+    <p id="p-71" num="71">
+      <page-break num="12"/>
+[0066] In another example system, each regulator 52 communicates its resource consumption information directly to the regulator <part-num-ref name="regulator">50.</part-num-ref>
+ Regulator <part-num-ref name="regulator 50. Regulator">50</part-num-ref>
+ compiles the information, adds system level resource consumption information - to the extent there is any - and makes its resource adjustments based on the resulting set of information.    </p>
+    <p id="p-72" num="72">
+      <boundary-data type="line-number">5   </boundary-data>
+[0067] Each CLSM     regulator 52 monitors and controls, in a closed loop fashion, workload performance information for a single subsystem <part-num-ref name="single subsystem">53.</part-num-ref>
+ For example, this includes throughput information received from a dispatcher processor. The performance information is compared to SLGs <part-num-ref name="performance information is compared to SLGs">58.</part-num-ref>
+ In the example of throughput information, the level of desired throughput defined in SLGs <part-num-ref name="level of desired throughput defined in SLGs">58</part-num-ref>
+ is compared to the actual level of throughput occurring for a particular workload. Multi system regulator <part-num-ref name="particular workload. Multi system regulator">50</part-num-ref>
+ then <boundary-data type="line-number">10   </boundary-data>
+adjusts resource allocation weights to better meet the workload rules.    </p>
+    <p id="p-73" num="73">[0068] Multi-system regulator 50 receives system conditions from the sub-system CLSM regulators <part-num-ref name="sub-system CLSM regulators">52,</part-num-ref>
+ and compares the conditions to the SLGs. In response regulator <part-num-ref name="SLGs. In response regulator">50</part-num-ref>
+ adjusts the system resource allocation weights to better meet the system conditions.    </p>
+    <p id="p-74" num="74">[0069<confidence value="5">]</confidence>
+ In another example, multi-system regulator 50 receives system conditions from sub-system <boundary-data type="line-number">15   </boundary-data>
+regulators <part-num-ref name="receives system conditions from sub-system regulators">52,</part-num-ref>
+ and compares the known arrival rates to the system conditions. In response, regulator <part-num-ref name="system conditions. In response, regulator">50</part-num-ref>
+ adjusts the arrival rates by adjusting throttling values to better meet the system conditions.    </p>
+    <p id="p-75" num="75">[0070] Generally speaking, regulators 52 provide real-time closed-loop control over subsystem resources, the loop having a fairly narrow bandwidth - typically the order of milliseconds, seconds, or minutes. Regulator <part-num-ref name="order of milliseconds, seconds, or minutes. Regulator">50</part-num-ref>
+ provides real-time closed-loop control over domain <part-num-ref name="provides real-time closed-loop control over domain">54,</part-num-ref>
+ the loop having a much <boundary-data type="line-number">20   </boundary-data>
+larger bandwidth - typically the order of minutes, hours, or days.    </p>
+    <p id="p-76" num="76">[0071] Further, while regulators 52 controls subsystem resources and regulator <part-num-ref name="controls subsystem resources and regulator">50</part-num-ref>
+ controls system resources across the domain, in many cases subsystem resources and system resources are the same.    </p>
+    <p id="p-77" num="77">The multi-system regulator has a higher level view of the state of the system wide resources because it is aware, at a higher level of the state of resources of all subsystems, while each CLSM regulator is <boundary-data type="line-number">25   </boundary-data>
+generally only aware of the state of its own resources.    </p>
+    <p id="p-78" num="78">[0072] There are a number of techniques by which regulator <part-num-ref name="number of techniques by which regulator">50</part-num-ref>
+ implements its adjustments to the allocation of system resources. For example, and as illustrated in Figure 2, regulator <part-num-ref name="allocation of system resources. For example, and as illustrated in Figure 2, regulator">50</part-num-ref>
+ communicates adjustments directly to regulators <part-num-ref name="communicates adjustments directly to regulators">52.</part-num-ref>
+ Regulators <part-num-ref name="communicates adjustments directly to regulators 52. Regulators">52</part-num-ref>
+ then apply the relevant rule adjustments.    </p>
+    <p id="p-79" num="79">Alternatively, regulator 50 communicates adjustments to regulators <part-num-ref name="communicates adjustments to regulators">52</part-num-ref>
+ by passing them down a tree, <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">NCR Docket No. 12162</boundary-data>
+such as that in Figure 4. In either case, regulators <part-num-ref name="tree, such as that in Figure 4. In either case, regulators">52</part-num-ref>
+ incorporate resource rule adjustments ordered by regulator <part-num-ref name="incorporate resource rule adjustments ordered by regulator">50</part-num-ref>
+ in the various subsystems.    </p>
+    <p id="p-80" num="80">[0073] Regulator 50 is adaptable for use where regulators <part-num-ref name="is adaptable for use where regulators">52</part-num-ref>
+ include on either or both of a Teradata Database nodes and a non-Trusted Parallel Nodes - such as a node running UNIX, Linux or Windows.    </p>
+    <p id="p-81" num="81">
+      <boundary-data type="line-number">5   </boundary-data>
+It will be appreciated that in cases where non-Trusted Parallel Nodes are involved, regulator 50 effectively adopts its inherent CLSM-type approach across non CLSM-type database systems. That is, although a particular database system that includes a regulator <part-num-ref name="regulator">52</part-num-ref>
+ does not inherently operate under CLSM, when under the influence of regulator <part-num-ref name="influence of regulator">50</part-num-ref>
+ is does to an extent.    </p>
+    <p id="p-82" num="82">[0074] These techniques for communication between the regulators <part-num-ref name="regulators">50</part-num-ref>
+ and <part-num-ref name="and">52</part-num-ref>
+ are accomplished by <boundary-data type="line-number">10   </boundary-data>
+various methods, which will be recog<confidence value="8">n</confidence>
+ized by those skilled in the art. For example: running a single process across all of the nodes and all of the dispatchers, by multiple processes where each process executes on a separate PE, or by processes that can run on more than one, but not all, of the PEs.    </p>
+    <p id="p-83" num="83">[0075] Given that regulator 50 has access to the resource consumption information from all of regulators <part-num-ref name="resource consumption information from all of regulators">52,</part-num-ref>
+ it can make resource adjustments that are mindful of meeting the system workload rules.    </p>
+    <p id="p-84" num="84">
+      <boundary-data type="line-number">15   </boundary-data>
+It is capable of, for example, adjusting the resources allocated to a particular workload group on a system-wide basis, to make sure that the workload rules for that workload groups are met. It is further able to identify bottlenecks in performance and allocate resources and or adjust throttles to alleviate the bottleneck. Also, it selectively deprives resources from a workload group that is idling system resources. In general, regulator <part-num-ref name="workload group that is idling system resources. In general, regulator">50</part-num-ref>
+ provides a single system view of meeting workload rules while the <boundary-data type="line-number">20   </boundary-data>
+regulators <part-num-ref name="regulators">52</part-num-ref>
+ continue to support workload administration in a closed loop system environments.    </p>
+    <p id="p-85" num="85">[0076] It will be appreciated that the illustrated regulator <part-num-ref name="illustrated regulator">50</part-num-ref>
+ is capable of monitoring the performance and operational characteristics of a plurality of subsystems <part-num-ref name="plurality of subsystems">53</part-num-ref>
+ across a domain <part-num-ref name="domain">54.</part-num-ref>
+ From this it provides a domain-wide approach to resource and performance management.    </p>
+    <p id="p-86" num="86">[0077] Although the present invention has been described with particular reference to certain preferred <boundary-data type="line-number">25   </boundary-data>
+embodiments thereof, variations and modifications of the present invention can be effected within the spirit and scope of the following claims.    </p>
+    <boundary-data type="header">
+      <confidence value="88">13</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11477975.xml

@@ -0,0 +1,401 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11477975</doc-number>
+        <date>2006-06-29</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">18179ROUS<confidence value="448">O1U</confidence>
+                                         <confidence value="5">1</confidence>
+3528-268US    </boundary-data>
+    <heading id="h-1">Q-IN-Q ETHERNET RINGS</heading>
+    <heading id="h-2">CROSS-REFERENCE TO RELATED APPLICATIONS</heading>
+    <p id="p-1" num="1">[0001]  This is the first application filed for the present invention.</p>
+    <heading id="h-3">TECHNICAL FIELD</heading>
+    <p id="p-2" num="2">[0002]  The present invention relates generally to Ethernet and, in particular, to Ethernet rings for Metro Area Networks.</p>
+    <heading id="h-4">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-3" num="3">[0003]  Because of its "flood-and-learn" nature, standard Ethernet (IEEE 802.3) is generally unsuitable for network topologies where there is more than one path between any two nodes. The existence of a parallel path creates a loop around which the Ethernet frames circle endlessly, thus overburdening the network.    Therefore, Ethernet is best suited to a tree topology rather than a ring.     However, ring topologies are desirable for deploying Ethernet in Metro Area Networks where ring topologies are desirable, e.g. for resiliency.</p>
+    <p id="p-4" num="4">[0004]  Deployment of large (metro area) Ethernet rings is hindered, however, by the fact that Ethernet rings are prone to endlessly loop unless protocols such as IEEE 802.<confidence value="5">1</confidence>
+D Spanning Tree Protocol (STP) or IEEE 802.1W Rapid Reconfiguration are used to detect and disable parallel branches that create loops.   While Spanning Tree Protocol and Rapid Reconfiguration can eliminate loops on Ethernet rings, these protocols introduce recovery lags in the order of tens of seconds, i.e. the time to recover from a fault in the ring is unacceptably high for customers who expect seamless connectivity and undetectable fault correction.    </p>
+    <boundary-data type="header">
+      <confidence value="8">1</confidence>
+    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="86">18</confidence>
+179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US    </boundary-data>
+    <p id="p-5" num="5">
+      <page-break num="2"/>
+      <confidence value="5">I</confidence>
+n  other words, customers    expect  connectivity  to  be restored within approximately 50 ms (like SONET does).    </p>
+    <p id="p-6" num="6">[0005]  A further shortcoming of current Ethernet ring technology as defined in 802.17 is that the MAC-PHY chip that determines which direction to send traffic around the ring  is a specialized component where innovation and available bandwidth typically lags other, simpler, Ethernet PHY implementations. Thus, even if all the other components of the Ethernet switches are capable of handling higher rates, as is currently achievable, the ring MAC-PHY chip limits the overall bit-rate of the ring.</p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0006]  Thus, it remains highly desirable to provide a simple, resilient and high-speed virtual ring for frame- based traffic such as Ethernet, particularly for Metro Area Networks<confidence value="8">.</confidence>
+    </p>
+    <heading id="h-5">SUMMARY OF THE INVENTION</heading>
+    <p id="p-8" num="8">[0007]  An aspect of the present invention is to provide a simple, resilient and high-speed virtual ring for frame- based traffic such as Ethernet that redresses one or more of the deficiencies in the prior art as described above.</p>
+    <p id="p-9" num="9">The resilient virtual ring has a plurality       of nodes interconnected by working and protection virtual paths. The virtual ring will have a working path in which traffic flows in one direction, and a protection path in which the traffic flows in the opposite direction. It is conceivable to have multiple virtual rings which have the same routing for the working path and for the protection paths. It is similarly possible to envision multiple virtual rings where the routing is a mirror image, the routing of one or more rings protection path corresponding to the routing of the working path or path of other rings. It is similarly <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US      </boundary-data>
+possible to consider a node to simultaneously be a ring node on several topologically disjoint rings at the same time. Each virtual ring    implements a unique Ethernet broadcast domain.   Each virtual ring is implemented via configured connectivity for a set of VLANs. Traffic upon insertion into the ring is tagged using ring tags which serve to identify the originating station on the ring and are associated with the specific broadcast domain. These tags are removed when the traffic leaves the ring.     For Ethernet, these ring tags are VLAN IDs (VIDs) and the insertion of VLAN tags is described in IEEE standard 802.<confidence value="5">l</confidence>
+ad.  When traffic enters the ring, the ingress node tags the traffic with a working-path VID which        also identifies the entry point to the ring.    </p>
+    <p id="p-10" num="10">[0008] It should be noted that the virtual ring mechanism uses VLAN tagging, and configured <confidence value="5">V</confidence>
+LAN forwarding. This behaviour can be deployed on nodes in conjunction with other styles of Ethernet forwarding such as spanning tree or  static   configuration  of   MAC  tables  via   simply partitioning the VLAN space.    </p>
+    <p id="p-11" num="11">[0009]  Ring  nodes   perform  normal   Ethernet  bridging operations,  in   particular  populating   the  forwarding database via source learning. Although traffic in each broadcast domain is distinguished by a plurality of VLAN IDs  (one per ring node for each of the working and protection paths), Shared VLAN Learning (SVL) permits the set of ring nodes to use a common set of learned MAC forwarding information. In order to preserve directionality around the ring, "port aliasing" is performed to record a port direction that is opposite to the port direction that would normally be learned by the node in traditional bridge operation.    For example, in    an  Emulated  LAN  (ELAN) <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US      </boundary-data>
+implementation, MAC addresses are only learned in one direction around the ring, i.e. on the working path.     A packet observed as arriving on one ring port has source learning recorded as if the packet arrived on the other ring port.    In this way, although the ring physically attaches to the node via two distinct ports, it logically appears as a single port. For ELAN, MAC learning is disabled on all protection-path VIDs.    </p>
+    <p id="p-12" num="12">[0010]  Traffic only ingresses or egresses the ring via the working  path.   This   is  achieved   by  standard   VLAN configuration such that off-ring ports associated with the ring broadcast domain are not blocked for the set of working  VLANs  associated   with  the  ring.   Copies  of broadcast, multicast or packets for which the path to the destination is unknown by the ring nodes will typically egress the ring at all ports     associated with the ring broadcast domain. A copy of such packets will traverse the ring back to the node of origin where the ring tag allows such packets to be identified as having circumnavigated the ring and consequently discarded at the originating node (termed "source stripping"). Packets directed around the ring may also encounter ring nodes which have "learned" off-ring connectivity, at which point the packet will be removed from   the ring and forwarded to     the off-ring destination (termed "destination stripping")<confidence value="5">.</confidence>
+    </p>
+    <p id="p-13" num="13">[0011]  In the event of a failure in a span between two nodes in the ring, the ring folds as a resiliency mechanism to isolate the failed span. To enable ring folding, each node has a cross-connect for cross-connecting the working path to the protection path, which is implemented by VLAN translation, the working VLAN is mapped 1:1 to a protection VLAN forwarded in the reverse direction to the working <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                          13528-268US      </boundary-data>
+path. Thus, if a span fails, the two end nodes immediately adjacent to the span failure isolate the failure by cross- connecting their working and protection paths. This cross- connection folds the ring to thus transfer traffic from the working path onto the protection path at the first of the two end nodes immediately adjacent the failure.         The traffic is then carried over the protection path all the way to the second of the two end nodes immediately adjacent the failure whereupon the traffic is cross-connected back onto the working path for egress from the working path. In this  way,   "learned"  forwarding  information  used   for destination stripping, and tag information associated with source stripping is fully applicable independent of the fault status of the ring, and a ring failure is transparent to all nodes not immediately adjacent to the failure (which perform the selector operation of mapping the working to the protection paths).    </p>
+    <p id="p-14" num="14">[0012]  Therefore,      existing      specified      bridge implementations employing the tagging of ring traffic using Q-in-Q stacking, VLAN translation and by using Shared VLAN Learning in combination with port aliasing       (to permit source  learning  to be applied    to  a broadcast domain implemented as a unidirectional ring path), a virtual Ethernet ring can be constructed that does not suffer from the shortcomings that hamper prior-art implementations.</p>
+    <p id="p-15" num="15">Moreover, the ring is made resilient by virtue of the cross-connects at each node which allow the ring to fold to isolate a span failure.    Even once the ring has folded, traffic continues to ingress to or egress from the working path only.</p>
+    <p id="p-16" num="16">[0013]  Accordingly, an aspect of the present invention provides a method of routing frame-based traffic over a <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">18179ROUS<confidence value="448">O1U</confidence>
+                                         <confidence value="5">1</confidence>
+3528-268US      </boundary-data>
+resilient virtual ring having a commonly routed working path and a protection path per ring node. The method includes the steps of defining, for each node of the ring, a plurality of unique ring tags that uniquely identify each one of the nodes and whether the working path or the protection path is to carry the traffic, and tagging frames in the virtual ring with one of the ring tags to uniquely identify both the node that has tagged the frames and whether the traffic is being carried over the working path or the protection path.    </p>
+    <p id="p-17" num="17">[0014]  The frame-based traffic can be Ethernet, in which case the ring tags are VLAN IDs (VIDs) that are tagged to the Ethernet frames using Q-in-Q VLAN stacking.</p>
+    <p id="p-18" num="18">[0015]  Another aspect of the present invention provides a resilient  virtual  ring  having  a   plurality  of  nodes interconnected by a working path and a protection path, each of the plurality of nodes including ingress and egress ports for frame-based traffic entering and leaving the virtual ring, wherein each node comprises a plurality of ring tags for uniquely tagging traffic in the ring, the ring tags identifying both the node that has tagged the traffic and whether the traffic is carried by the working path or the protection path. Where the frame-based traffic are Ethernet frames, Q-in<confidence value="5">-</confidence>
+Q VLAN stacking enables tagging of the frames with unique VLAN IDs (VIDs)<confidence value="8">.</confidence>
+    </p>
+    <heading id="h-6">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-19" num="19">[0016]  Further features and advantages of the present invention will become apparent from the following detailed description,  taken  in   combination  with  the  appended drawings, in which:</p>
+    <boundary-data type="header">
+      <confidence value="8">6</confidence>
+    </boundary-data>
+    <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US    </boundary-data>
+    <p id="p-20" num="20">
+      <page-break num="7"/>
+[0017]  FIG. <confidence value="4">l</confidence>
+A is a schematic illustration of an Ethernet <confidence value="8686">VLAN</confidence>
+ ring configured for 1:1 protection for ELAN or Source Specific Broadcast (SSB) in accordance with an embodiment of the present invention;    </p>
+    <p id="p-21" num="21">[0018]  FIG. <confidence value="5">1</confidence>
+B is an enlarged schematic illustration of Node A of FIG. <confidence value="4">l</confidence>
+A operating in a fault-free state;    </p>
+    <p id="p-22" num="22">[0019]  FIG. <confidence value="5">1</confidence>
+C is an enlarged schematic illustration of Nodes B, C and D of FIG. <confidence value="4">l</confidence>
+A operating in a fault-free state;    </p>
+    <p id="p-23" num="23">[0020]  FIG. 2A is a schematic illustration of how the Ethernet VLAN ring of FIG. <confidence value="4">l</confidence>
+A folds in response to a failure in the span between Nodes C and D;    </p>
+    <p id="p-24" num="24">[0021]  FIG. 2B   is  a   schematic  illustration  of  the operation of Node C during ring folding;</p>
+    <p id="p-25" num="25">[0022]  FIG. 2C   is  a   schematic  illustration  of  the operation of Node D during ring folding;</p>
+    <p id="p-26" num="26">[0023]  FIG. 3A is a schematic illustration of an Ethernet VLAN  ring  configured  for  1:1 protection   for  SSM  in accordance  with   another  embodiment   of  the   present invention;</p>
+    <p id="p-27" num="27">[0024]  FIG. 3B is an enlarged schematic illustration of Node A of FIG. 3A operating in a fault-free state;</p>
+    <p id="p-28" num="28">[0025]  FIG. 3C is an enlarged schematic illustration of Nodes B, C and D of FIG. 3A operating in a fault-free state;</p>
+    <p id="p-29" num="29">[0026]  FIG. 4A is a schematic illustration of how the Ethernet VLAN ring of FIG. 3A folds in response to a failure in the span between Nodes C and D;</p>
+    <boundary-data type="header">
+      <confidence value="8">7</confidence>
+    </boundary-data>
+    <boundary-data type="header">18179ROUS<confidence value="45">O1</confidence>
+U                                          13528-26<confidence value="588">8US</confidence>
+    </boundary-data>
+    <p id="p-30" num="30">
+      <page-break num="8"/>
+[0027]  FIG.  4<confidence value="5">B</confidence>
+  is   a  schematic  illustration  of   the operation of Node C during ring folding;    </p>
+    <p id="p-31" num="31">[0028]  FIG.  4C  is   a  schematic  illustration  of   the operation of Node D during ring folding;</p>
+    <p id="p-32" num="32">[0029]  FIG. 5A is a schematic illustration of an Ethernet VLAN ring configured for 1+1 protection in accordance with another embodiment of the present invention;</p>
+    <p id="p-33" num="33">[0030]  FIG. 5<confidence value="5">B</confidence>
+ is an enlarged schematic illustration of Node A of FIG. 5A operating in a fault-free state;    </p>
+    <p id="p-34" num="34">[0031]  FIG. 5C is an enlarged schematic illustration of Nodes B, C and D of FIG. 5A operating in a fault-free state; and [0032]  FIG. 6 is a schematic illustration of an Ethernet ring node in accordance with an embodiment of the present invention.</p>
+    <p id="p-35" num="35">[0033]  It will be noted that throughout the appended drawings, like features are identified by like reference numerals.</p>
+    <heading id="h-7">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT</heading>
+    <p id="p-36" num="36">[0034]  In general, and as will be elaborated below with respect to the specific embodiments illustrated in Figures 1-6, the present invention provides both a resilient, virtual ring for frame-based traffic such as, preferably, Ethernet as well as a method of routing frame-based (e.g.</p>
+    <p id="p-37" num="37">Ethernet) traffic over a resilient, virtual ring. Although the  embodiments   described  below   are  implemented   in Ethernet, it should be understood that the invention could be applied to other frame-based networks.</p>
+    <boundary-data type="header">
+      <confidence value="8">8</confidence>
+    </boundary-data>
+    <boundary-data type="header">18179ROUS<confidence value="448">O1U</confidence>
+                                         <confidence value="5">1</confidence>
+3528-268US    </boundary-data>
+    <p id="p-38" num="38">
+      <page-break num="9"/>
+[0035<confidence value="5">]</confidence>
+  A  resilient, virtual   Ethernet  ring  designated generally by   reference numeral <part-num-ref name="resilient, virtual   Ethernet  ring  designated generally by   reference numeral">10</part-num-ref>
+ in    FIG. <confidence value="4">l</confidence>
+A has a plurality of nodes (labelled A, B, C and D) interconnected by a working path <part-num-ref name="working path">12</part-num-ref>
+ and a protection path <part-num-ref name="protection path">14</part-num-ref>
+ per ring node, FIG. <confidence value="4">l</confidence>
+A being an exemplar of a single instance of what would be replicated once per node on the ring. Each path being implemented via VLAN configuration (the blocking and u<confidence value="8">n</confidence>
+blocking of ports). As will be appreciated by those of ordinary skill in the art, the virtual ring can be virtualized from a non-ring topology such as a mesh; in other words, there does need to be an actual physical ring architecture for   implementation of this virtual ring.    </p>
+    <p id="p-39" num="39">Furthermore, it should be understood that, while four nodes are illustrated, this is merely presented by way        of example, i.e. the number of nodes on the ring can vary.</p>
+    <p id="p-40" num="40">[0036<confidence value="5">]</confidence>
+  Each of the plurality of nodes A-D may include ingress ports and egress ports for traffic entering and leaving the virtual ring, respectively. Similarly, the virtual  ring  may   transit  nodes  which  do   not  have ingress/egress ports but do participate in ring behaviour.    </p>
+    <p id="p-41" num="41">Associated with each node is a set of ring tags for tagging the frames of traffic in the ring.      In other words, a plurality of unique ring tags are defined for each node of the ring.   The ring tags identify whether the associated ring path is the working path or the protection path and the unique identity of the ring node on that path. So a set of VLAN tags (one per ring station) is associated with the working path of a unidirectional ring and a corresponding set of tags is associated with the protection path of a unidirectional ring.   The routing of the protection path being congruent with the working path, the forwarding direction is thus simply the reverse of that of the working path.</p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="86">18</confidence>
+179ROUS<confidence value="44">O1</confidence>
+U                                          13528-268US    </boundary-data>
+    <p id="p-42" num="42">
+      <page-break num="10"/>
+      <confidence value="5">[</confidence>
+0037]  In the preferred embodiment, the ring tags are virtual local area network identifiers or VLAN IDs (VIDs) <confidence value="8">f</confidence>
+or tagging Ethernet frames in the ring.      Thus, in the generalized case, each node in the ring has a unique set of W-VID and P-VID identifiers that are used to tag traffic in the ring so as to identify the node that has tagged the traffic as well as which of the working path and protection path is carrying the traffic.    The VIDs identify both a specific virtual ring (i.e. in a trivial topology case "east" or "west"), whether the traffic is carried on the working path or on the protection path, and the node originating traffic onto that ring.     It should be noted that, as the technique permits the virtualization of V<confidence value="588">LAN</confidence>
+ tagged rings, a node could conceivably participate in many disjoint  virtual   rings   and  be   provisioned  with   a corresponding set of VLAN tags to participate in each ring.    </p>
+    <p id="p-43" num="43">[0038]  The Ethernet frames can be tagged using Q-in-Q stacking (also written as QinQ).    Q-in-Q stacking is an encapsulation protocol defined in IEEE 802.<confidence value="4">l</confidence>
+ad which is hereby incorporated by reference.    </p>
+    <p id="p-44" num="44">[0039<confidence value="5">]</confidence>
+  For  the  purposes   of  this   specification,  the expression "west", "westward" or "westbound" shall mean clockwise around the ring whereas the expressions "east", "eastward" or   "eastbound" shall mean    counter-clockwise around the ring.    </p>
+    <p id="p-45" num="45">
+      <confidence value="5">[</confidence>
+0040]  In the preferred embodiment, the virtual Ethernet ring is constructed so that traffic entering the ring is forwarded along the working path, and may only leave the ring via the working path, traffic on the protection path is  constrained   to  the   ring  to  prevent   undesirable duplication to off-ring nodes. Traffic is never inserted directly into the protection path, so the fact that it is <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US      </boundary-data>
+an uninterrupted ring with no egress is a non-issue.    </p>
+    <p id="p-46" num="46">Traffic is only cross-connected onto the protection path when the ring structure has been broken due to a fault.</p>
+    <p id="p-47" num="47">Thus, in the preferred embodiment, the frame-based traffic entering a given node is tagged with a VID that identifies that the traffic is being inserted onto the working path and the point of insertion. Furthermore, in the preferred embodiment, the ring is said to be "unidirectional" because the working path is unidirectional in the arbitrarily chosen direction around the ring while the protection path is also unidirectional albeit in the opposite direction around the ring. The actual association of traffic from an off-ring point to a particular ring-based broadcast domain is performed by normal Ethernet classification means as specified in 802.<confidence value="5">l</confidence>
+ad whereby either tag or port information is used as a ring selector. Similarly a ring node may implement ports wholly not associated with ring behaviour.    </p>
+    <p id="p-48" num="48">[0041]  Thus, when traffic enters the ring at a node (hereinafter an "ingress node"), each packet entering the ring is tagged with a unique VID identifying to the switch fabric that the traffic is to be inserted onto the working path of a specific virtual ring. Since the working path is unidirectional, no routing decision needs to be made at the ingress node, which therefore obviates the need for a direction-determining MAC-PHY chip at the ingress node which, as noted above, is not only an expensive component but only limits bit-rate. It should be noted that VLANs are bi-directional, but uni-directionality is an artefact of how VLANs are used to create ring paths. As only a single node may insert traffic tagged with the VID of a specific working VLAN, and that VLAN will be blocked for the port corresponding  to  the   return  path  once   traffic  has <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">18179ROUS<confidence value="44">O1</confidence>
+U                                          13528-268US      </boundary-data>
+circumnavigated the ring, there will be only one egress port for the VLAN from the ring node.    </p>
+    <p id="p-49" num="49">[0042]  Moreover, since the traffic entering the ring is tagged with a VID that is unique, and port blocking for that VID is performed on the return port for the virtual ring, the ingress node will perform "source stripping", i.e. discarding traffic that has returned "unclaimed" to the ingress node.    In other words, traffic is discarded (stripped out) if none of the other nodes in the ring recognize the destination MAC address or if the packet was intended to be replicated to all ring nodes.      In other words, if traffic has circled back around the entire ring without being   claimed by any other node, then it is discarded by the ingress node (because the working VLAN is blocked on the port of return).     Thus, the ingress node discards received traffic that is tagged with the ring tag assigned by the ingress node when the traffic first entered the ring.</p>
+    <p id="p-50" num="50">[0043] Source stripping thus ensures that traffic does not loop endlessly around the ring.    If another node on the ring recognizes the MAC address as being one that is served by that node, then the node (acting as an "egress node", that is) forwards the packet to a non-ring port. It should be noted that the actual forwarding behaviour of ring nodes is that of standard <part-num-ref name="actual forwarding behaviour of ring nodes is that of standard">802</part-num-ref>
+ bridge forwarding. Broadcast, multicast and unknown packets are forwarded on both ring ports and replicated on local non-ring ports which are configured to participate in the ring broadcast domain. A ring node may have a MAC forwarding entry for a given destination address that points to a ring port or points to an of<confidence value="8">f</confidence>
+-ring port.   In the scenario where a MAC forwarding entry exists for an "off-ring" port, the ring node will (as <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="45">O1</confidence>
+U                                          13528-268US      </boundary-data>
+an   artefact   of   normal   bridge   operation)   perform "destination stripping" such that the packet only traverses a portion of the overall ring.    </p>
+    <p id="p-51" num="51">[0044]  In accordance with a preferred embodiment of the present invention, each node also includes a "port aliasing module" for receiving the learned MAC addresses and for recording in the forwarding table a port direction that is opposite to an actual port direction detected by the node.</p>
+    <p id="p-52" num="52">As   the  ring/broadcast  domain   is  unidirectional,   it logically is a single port but in actual implementation is an ingress and an egress. Normal Ethernet source learning will attempt to associate learned MAC addresses of traffic received from other ring nodes with the ingress port, while the desirable behaviour    is to   actually  associate  the forwarding for those MAC addresses to the egress port for the ring as the only viable path around the ring is unidirectional.   Port aliasing permits the translation of learned  information  from  ingress  to  egress   prior  to forwarding of traffic. This may be done prior to or subsequent to insertion of learned information into the local forwarding database.    Precisely when the value is aliased is an implementation issue.</p>
+    <p id="p-53" num="53">[0045]  FIG. <confidence value="4">l</confidence>
+A is a schematic illustration of an Ethernet VLA<confidence value="5">N</confidence>
+ ring configured for 1:1 protection for Emulated LAN (ELAN) or Source Specific Broadcast (SSB) in accordance with an embodiment of the present invention.       In this example, the ring <part-num-ref name="ring">10</part-num-ref>
+ has working and protection paths interconnecting four nodes A, B, C and D. In this example, traffic inserted at A is tagged with a Working VID (W-VID) corresponding to a configured working path routed A, B, C, D. There is also configured a protection VID        (P-VID) configured in the reverse direction D, C, B, A with <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="45">O1</confidence>
+U                                         13528-268US      </boundary-data>
+corresponding port membership for the VIDs being configured on the ring nodes.       In  this example, the VIDs are referenced with respect to Node A.   Similar and co-routed (but different VIDs) would of course also be assigned for Nodes B, C and D. For Emulated LAN (ELAN), a total of two VIDs per virtual ring per ring node are required. For Source Specific Multicast (emulation of a p2mp, i.e. a point-to-multipoint, tree over the ring), a total of <part-num-ref name="total of">4</part-num-ref>
+ VIDs per  virtual  ring   are  required. For   Source  Specific Broadcast (SSB), a total of two VIDs per virtual ring are required, in this case Working and Protection.       In a simple variant, the VID can further identify which of the two directions around the ring the traffic is carried.    </p>
+    <p id="p-54" num="54">Thus, in this particular variant, a West Working VID, West Protection VID, East Working VID and East Protection VID are defined for each node and, depending on which of the two directions is arbitrarily chosen for the working path, either the west VIDs or the east VIDs are used.</p>
+    <p id="p-55" num="55">[0046]  FIG. <confidence value="5">1</confidence>
+B is an enlarged schematic illustration of Node A of FIG. <confidence value="4">l</confidence>
+A operating in a fault-free state. In this example, Node A adds a ring tag to all the Ethernet frames (traffic) entering the ring.   In this case, the ring tag added to the frames is W-VID because the traffic is being routed on the working path.   As shown in FIG. <confidence value="686">1B,</confidence>
+ Node A passes the P-VID and blocks the W-VID on the east port.    </p>
+    <p id="p-56" num="56">[0047<confidence value="4">]</confidence>
+  FIG. <confidence value="5">1</confidence>
+C is an enlarged schematic illustration of Nodes B, C and D of FIG. <confidence value="4">l</confidence>
+A operating in a fault-free state.  In this example, Nodes B, C and D pass the P-VID (as did Node A) but these nodes pass the W-VID and takes a copy, removing the ring tag (VID) when the traffic is taken off the ring.    </p>
+    <boundary-data type="header">
+      <confidence value="88">14</confidence>
+    </boundary-data>
+    <boundary-data type="header">
+      <confidence value="5">1</confidence>
+8179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US    </boundary-data>
+    <p id="p-57" num="57">
+      <page-break num="15"/>
+[0048]  Accordingly,  large    (metro-sized),  simple   and inexpensive Ethernet rings can be implemented using 802.<confidence value="588">1Q-</confidence>
+ compliant  hardware,  i.e. using    Q-tagging  to  form   a resilient QinQ ring whose behaviour appears to be that of an  802.<confidence value="5">1</confidence>
+Q-compliant bridge.     Furthermore, as will be described below, these rings can be made resilient.    </p>
+    <p id="p-58" num="58">[0049]  Resiliency (1:1 Protection) [0050]  The virtual Ethernet ring is made resilient (or "fault-tolerant") by virtue of its ring topology (which is an inherently resilient topology because it is capable of ring folding to isolate a span failure), the presence of a protection path providing 1:1 protection, and the presence of  cross-connects  at  each  node  that  are   capable  of "hairpinning" the traffic when the ring folds, as is explained in the following paragraphs.</p>
+    <p id="p-59" num="59">[0051] Each node in the ring has its own cross-connect for cross-connecting the working path to the protection path.</p>
+    <p id="p-60" num="60">This enables ring folding in response to a failure detected in a span of the ring.    Detecting a span failure can be done using any known span failure detection mechanism such as described in IEEE 802.<confidence value="5">1</confidence>
+ag or 802.3ah EFM      ("Ethernet First Mile")<confidence value="5">,</confidence>
+ which are hereby incorporated by reference.    </p>
+    <p id="p-61" num="61">Folding the ring isolates the span failure and, due to the availability of the protection path, ensures that traffic continues to be forwarded seamlessly to destination nodes.</p>
+    <p id="p-62" num="62">[0052]  As shown in FIG. 2A, the ring <part-num-ref name="ring">10</part-num-ref>
+ can fold in response to a span failure <part-num-ref name="span failure">16</part-num-ref>
+ by cross-connecting the working path <part-num-ref name="working path">12</part-num-ref>
+ and the protection path <part-num-ref name="protection path">14</part-num-ref>
+ at the two "end nodes" <part-num-ref name="two &quot;end nodes&quot;">18,</part-num-ref>
+ <part-num-ref name="two &quot;end nodes&quot; 18,">20</part-num-ref>
+ immediately on either side of the span failure. This will be referred to herein as "hairpinning" since the traffic takes what can be visualized as a <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="44">O1</confidence>
+U                                          13528-26<confidence value="588">8US</confidence>
+      </boundary-data>
+"hairpin curve" (as shown in FIG. 2A) as it is switched from the working path onto the protection path at the first end node <part-num-ref name="first end node">18,</part-num-ref>
+ i.e. the last node that the traffic encounters on the working path just before the span failure.       The traffic is then carried all the way back to the second end node <part-num-ref name="second end node">20</part-num-ref>
+ on the protection path (in the opposite direction) at which point this same traffic is then "hairpinned" again (i.e. cross-connected) back onto the working path.     The failed  span   provides   the  "selector"   synchronization mechanism for the protection switch. The net effect of the cross connecting at both ring nodes adjacent to the failure is that the protection path acts as a "bypass" to loop the traffic back to the working path while preserving the unidirectionality of the ring. Folding the ring using this double-hairpin   arrangement   not   only   preserves   the unidirectionality of the working path but also ensures that traffic can only ingress or egress the ring from the working path.    In other words, the working path always remains the working path even after a span fault.    </p>
+    <p id="p-63" num="63">[0053<confidence value="5">]</confidence>
+  As shown in FIG. 2B, the first end node <part-num-ref name="first end node">18</part-num-ref>
+ (i.e.    </p>
+    <p id="p-64" num="64">Node C in this example) cross-connects W-VID to P-VID (to thus effect a port egress translation).      Similarly, as shown in FIG. 2C, the second end node <part-num-ref name="second end node">20</part-num-ref>
+ (i.e. Node D in this example) cross-connects P-VID to W-VID (to thus effect a port ingress translation)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-65" num="65">[0054]  A useful attribute of this arrangement is that protection switching is "hitless" with respect to MAC learning for ELAN and SSM.      In other words, the ring folding preserves the topology with respect to learned MAC addresses.</p>
+    <p id="p-66" num="66">[0055]   As another example, FIGs. 3A-3C and FIGs. 4A-4C illustrate respectively the operation and folding of a <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="148">Q1U</confidence>
+                                         <confidence value="5">1</confidence>
+3528-268US      </boundary-data>
+virtual Ethernet ring configured for 1:1 protection to enable Source-Specific Multicast    (SSM).   In  SSM, the configuration of connectivity is constrained such that only the source node (termed root)has connectivity to all other ring nodes (termed leaves), i.e. the other ring nodes can only communicate with the source.   The SSM head-end only needs to know that a given ring node is interested, but does not need to know which one.     Two working VIDs are required, one for the head-end to the leaves, and the other for the leaves to the head-end.   Two protection VIDs are required,  one   for  the  working   VID  (root   to  leaf connectivity) and one for the working return VID (leaf to root connectivity). As shown in these figures, the working path <part-num-ref name="working path">12</part-num-ref>
+ has a protection path <part-num-ref name="protection path">14,</part-num-ref>
+ and the return path <part-num-ref name="return path">22</part-num-ref>
+ is protected by a protection return <part-num-ref name="protection return">24.</part-num-ref>
+    </p>
+    <p id="p-67" num="67">[0056]  Therefore, for a given SSM virtual ring, there are four paths, and four VIDs are defined for the ring. These VIDs can be designated as follows: Working (W-VID), Working Return (WR-<confidence value="5">V</confidence>
+ID), Protection (P-VID) and Protection Return     </p>
+    <heading id="h-8">(PR-VID)<confidence value="8">.</confidence>
+    </heading>
+    <p id="p-68" num="68">[0057]  As shown in FIG. 3B, Node A operates in a fault- free state by passing P-VID and PR-VID while blocking W-VID on the east port.  Traffic entering the ring at Node A is tagged with W-VID  and sent onto the ring via the west port of Node A (assuming, for this example, a westward working direction) while return traffic is taken off the ring on </p>
+    <heading id="h-9">WR-VID.</heading>
+    <p id="p-69" num="69">[0058]  As shown in FIG. 3C, Nodes B, C and D operate in a fault-free state by also passing P-VID and PR-VID. At each of Nodes B, C and D, the node passes W-VID and takes a copy (stripping the VID as the traffic egresses the ring). Each <boundary-data type="header">
+        <confidence value="88">17</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="45">O1</confidence>
+U                                          13528-268US      </boundary-data>
+of these nodes also passes WR-VID and inserts traffic onto W-VID by assigning a ring tag (W-VID).    </p>
+    <p id="p-70" num="70">[0059]  As shown in FIG<confidence value="5">s</confidence>
+. 4A-4C, the Ethernet ring <part-num-ref name="Ethernet ring">10</part-num-ref>
+ folds in response to a failure <part-num-ref name="failure">16</part-num-ref>
+ in the span, e.g. between Nodes C and D. As shown in FIG. 4B, Node C (the first end node <part-num-ref name="first end node">18)</part-num-ref>
+ cross-connects W-VID to P-VID and WR-VID to PR-VID (to thus effect a port egress translation) . As shown in FIG.    </p>
+    <p id="p-71" num="71">4C, Node D (the second end node <part-num-ref name="second end node">20)</part-num-ref>
+ cross-connects P-VID to W-VID (to thus effect a port ingress translation).    </p>
+    <p id="p-72" num="72">[0060]  Accordingly, a highly resilient, unidirectional, virtual Ethernet ring can be created having one protection path per working path, thus providing 1:1 protection for either   ELAN   and   SSB   implementations   or   an   SSM implementation.</p>
+    <p id="p-73" num="73">[0061]  Resiliency (1+1 Protection) [0062]  In another embodiment, as shown in FIG<confidence value="5">s</confidence>
+. 5A-5C, a 1+1 protection arrangement can be implemented by sending ("bi-casting") traffic in opposite directions on both the working and protection paths <part-num-ref name="working and protection paths">12,</part-num-ref>
+ <part-num-ref name="working and protection paths 12,">14</part-num-ref>
+ of the ring <part-num-ref name="ring">10.</part-num-ref>
+      In this 1+1 protection scenario, the ingress node not only sends the same traffic (i.e. the same frames) in opposite directions around the ring, but it also sends Connectivity Fault Management (CFM) heartbeats in both directions around the ring. The CFM heartbeats enable a destination node on the ring to select one of the two received copies of the bi-cast traffic based on the characteristics of the CFM heartbeats received at the destination node.    </p>
+    <p id="p-74" num="74">[0063]  As shown in FIG. 5B, Node A adds ring tags as traffic enters the ring as is bi-cast onto both the W-VID and P-VID. Node A also blocks P-VID and W-VID on the east <boundary-data type="header">
+        <confidence value="88">18</confidence>
+      </boundary-data>
+      <page-break num="19"/>
+      <boundary-data type="header">
+        <confidence value="66">18</confidence>
+179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US      </boundary-data>
+port. As shown in FIG. 5C, each one of Nodes B, C and D has a selector that uses IEEE 802.<confidence value="5">l</confidence>
+ag and G.8031 to select which of the two sets of bi-cast traffic it will treat as the working-path traffic. The VID is stripped when traffic exits the ring.  Each node passes W-VID and takes a copy.    </p>
+    <p id="p-75" num="75">Each node also passes P-VID and takes a copy.</p>
+    <p id="p-76" num="76">[0064]  VID Seizing [0065]  At initialization of the ring, a range of VLANs is delegated to the operation of the ring, and the appropriate ring connectivity is configured via configuring of port membership for the V<confidence value="5">L</confidence>
+AN set on each ring node. Each node may then self-discover and seize a set of unique ring tags (the subset of tags in the range delegated to the ring that will be used by the specific ring node).    At each node, ring tags are randomly selected and tested.   To test the ring tags, the node attempts to ping itself with a frame tagged with the selected working path ring tag.     If the ring tag is not in use by any node in the ring, the node will be able to ping itself (i.e. there is uninterrupted connectivity around the ring). Otherwise, if the selected ring tag is already in use by another node in the ring, the node will not be able to ping itself because the actual owner of that selected working ring tag (i.e. another node) will have blocked the port for that ring tag in order to do source stripping.    </p>
+    <p id="p-77" num="77">[0066]  For a virtual Ethernet ring (e<confidence value="88">.g</confidence>
+. ELAN), each node would need to seize two unique VIDs. VID discovery and seizing is done by randomly selecting a potentially usable VID associated with a specific ring at each node being initialized, sending the potentially usable VID around the ring to try to ping oneself and then seizing the VID if it returns unclaimed to the node that sent the VID.     These <boundary-data type="header">
+        <confidence value="88">19</confidence>
+      </boundary-data>
+      <page-break num="20"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="56">01</confidence>
+U                                          13528-268US      </boundary-data>
+steps are repeated until the node being initialized has pinged itself at least twice. The seizing is complete when a  block  of  <part-num-ref name="block  of">2</part-num-ref>
+   VIDs  are  "owned"  by  the  node   being initialized.    </p>
+    <p id="p-78" num="78">[0067]  When the entire ring powers up at once, it is important to institute random delays in the self-discovery process to avoid "race conditions".    Thus, a given node should wait a random period of time before selecting a ring tag and attempting to ping itself<confidence value="8">.</confidence>
+    </p>
+    <p id="p-79" num="79">[0068]  Moreover, to be safe, the node should ping itself a couple of times with the same ring tag to be certain that the VID is truly not in use and thus can legitimately be seized.   When the node seizes a ring tag, it modifies the configuration for the seized range of ring tags from the default to the owned state.</p>
+    <p id="p-80" num="80">[0069]  Node Implementation [0070]  FIG. 6 schematically illustrates, by way of example only, an Ethernet ring node ("Node X") in accordance with an embodiment of the present invention.   As shown in FIG.</p>
+    <p id="p-81" num="81">6, Node X has a routing switch <part-num-ref name="routing switch">30</part-num-ref>
+ (e.g. Nortel <part-num-ref name="Nortel">8608</part-num-ref>
+ or equivalent) and a switch fabric module <part-num-ref name="switch fabric module">40</part-num-ref>
+ (e.g. Nortel <part-num-ref name="Nortel">8692</part-num-ref>
+ or equivalent). The routing switch <part-num-ref name="routing switch">30</part-num-ref>
+ has an ingress port <part-num-ref name="ingress port">32</part-num-ref>
+ and an egress port <part-num-ref name="egress port">34</part-num-ref>
+ for traffic entering and exiting the ring. The routing switch <part-num-ref name="routing switch">34</part-num-ref>
+ includes a mapping module <part-num-ref name="mapping module">36</part-num-ref>
+ (or other such means) for mapping a C-VID (Customer VID) received on the ingress port to a ring VID and pushing the frames to the switch fabric module <part-num-ref name="switch fabric module">40.</part-num-ref>
+ The routing switch <part-num-ref name="routing switch">34</part-num-ref>
+ also includes a VID-stripping module <part-num-ref name="VID-stripping module">38</part-num-ref>
+ (or other such means) for stripping the ring VID from the traffic before it exits the ring via the egress port <part-num-ref name="egress port">34.</part-num-ref>
+    </p>
+    <boundary-data type="header">
+      <confidence value="88">20</confidence>
+    </boundary-data>
+    <boundary-data type="header">1817<confidence value="8858854">9ROUS01</confidence>
+U                                          13528-268US    </boundary-data>
+    <p id="p-82" num="82">
+      <page-break num="21"/>
+[0071]  As further illustrated in FIG. 6, the switch fabric module <part-num-ref name="switch fabric module">40</part-num-ref>
+ includes forwarding memory <part-num-ref name="includes forwarding memory">42,</part-num-ref>
+ a port<confidence value="2">,</confidence>
+ aliasing module <part-num-ref name="port, aliasing module">44,</part-num-ref>
+ and a 802.<confidence value="5">1</confidence>
+Q bridge <part-num-ref name="802.1Q bridge">46.</part-num-ref>
+ The memory <part-num-ref name="memory">42</part-num-ref>
+ maintains the forwarding table, e.g. the Forwarding Information Base, into which MAC addresses and port directions are stored.    </p>
+    <p id="p-83" num="83">The port aliasing module 44, as mentioned above, stores a port direction that is opposite to the actual learned direction.    This    port    aliasing     preserves    the unidirectionality of the ring.   Traffic is switched by the <confidence value="86">.1</confidence>
+Q bridge <part-num-ref name=".1Q bridge">48</part-num-ref>
+ onto either the West PHY <part-num-ref name="West PHY">50</part-num-ref>
+ or the East PHY <part-num-ref name="East PHY">52.</part-num-ref>
+    </p>
+    <p id="p-84" num="84">[0072]  Applications of the Virtual Ethernet Ring [0073]  The ring is able to support a variety of Ethernet applications, including E<confidence value="5">L</confidence>
+INE, E-TREE, Emulated LAN (ELAN)<confidence value="8">,</confidence>
+ Source-Specific   Multicast   (SSM),  and   Source-Specific Broadcast (SSB)<confidence value="5">.</confidence>
+   In the ELINE and E-TREE -scenarios, the ring serves as a Provider Backbone Bridge (PBB) within a Provider  Backbone  Transport  (PBT)  network, which    are described   in   U.S.    Patent   Application   Publication 2005/0220096 entitled TRAFFIC ENGINEERING IN FRAME-BASED CARRIER NETWORKS published Oct. <part-num-ref name="Provider  Backbone  Transport  (PBT)  network, which    are described   in   U.S.    Patent   Application   Publication 2005/0220096 entitled TRAFFIC ENGINEERING IN FRAME-BASED CARRIER NETWORKS published Oct.">6,</part-num-ref>
+ <part-num-ref name="Provider  Backbone  Transport  (PBT)  network, which    are described   in   U.S.    Patent   Application   Publication 2005/0220096 entitled TRAFFIC ENGINEERING IN FRAME-BASED CARRIER NETWORKS published Oct. 6,">2005,</part-num-ref>
+ which is hereby incorporated by reference.   For ELINE and E-TREE, the P<confidence value="68">BT</confidence>
+ provides e2e PS (end-to-end protection switching) so the ring must not interfere with the PBT VID range.   For ELAN, the ring operates as a resilient distributed switch.    For SSM, the ring acts to resiliently fan out a dynamically varying set of (S,G) multicast groups to a set of ring nodes.  For SSM, the ring must also provide a constrained return path for IGMP snooping/filtering. For SSB, the ring acts to resiliently fan out an invariant bundle of (S,G) multicast groups to a set of ring nodes, but unlike SSM, no <boundary-data type="header">
+        <confidence value="88">21</confidence>
+      </boundary-data>
+      <page-break num="22"/>
+      <boundary-data type="header">
+        <confidence value="86">18</confidence>
+179ROUS<confidence value="44">O1</confidence>
+U                                         13528-268US      </boundary-data>
+return path is required.   The virtual ring should be able to support all of these applications simultaneously.    </p>
+    <p id="p-85" num="85">[0074]  Node Configurations for Specific Implementations [0075]  In order to simultaneously accommodate different applications or "behaviours", e.g. ELAN, SSM and SSB, a range of VIDs is designated for each type of application or "behaviour", i.e. a range of VIDs is designated for ELAN, another range of VIDs for SSM and yet another range of VIDs for SSB.   The default is for each node to pre-configure each range and then, as required, seize specific VIDs in each range.</p>
+    <p id="p-86" num="86">[0076]  For ELINE  (such as Provider Backbone Transport, which  offers  its own   end<confidence value="5">-</confidence>
+to-end  resiliency), a   fixed network VID range is assigned.    </p>
+    <p id="p-87" num="87">[0077]  Emulated LAN (ELAN) can be enabled by specifying, in a generalized case, only two VIDs per ring node, namely a Working VID (W-VID) and a Protection VID (P-VID). In the specific case where the VIDs are to further identify ring direction, four VIDs are defined per ring node, e.g. a West Working VID, a West Protection VID, an East Working VID and an East Protection VID. Each node needs to both relay and take a copy of Working VIDs.    Each node simply needs to connect Protection VIDs between ring ports.   MAC learning is disabled on the Protection VIDs.</p>
+    <p id="p-88" num="88">[0078]  Source Specific Multicast (SSM) can be enabled by specifying four VIDs per SSM ring     (for the generalized case), i.e. a Working VID, Working Return VID, Protection VID and Protection Return VID.    Each node needs to both relay and take a copy of Working VIDs. Each node needs to <boundary-data type="header">
+        <confidence value="88">22</confidence>
+      </boundary-data>
+      <page-break num="23"/>
+      <boundary-data type="header">18179ROUS<confidence value="448">O1U</confidence>
+                                         <confidence value="5">1</confidence>
+3528-268US      </boundary-data>
+connect Protection and Working Return VIDs together.   MAC learning is disabled on all VIDs.    </p>
+    <p id="p-89" num="89">[0079]  Source Specific Broadcast (SSB) can be enabled by specifying two VIDs per source node (W-VID and P-VID) per ring. Each node needs to both relay and take a copy of Working VIDs. Each node simply needs to connect Protection VIDs between ring ports. MAC learning is disabled on all VIDs.</p>
+    <p id="p-90" num="90">[0080]  The embodiments of the invention described above are intended to be exemplary only.      The scope of the invention is therefore intended to be limited solely by the scope of the appended claims.</p>
+    <boundary-data type="header">
+      <confidence value="88">23</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11482481.xml

@@ -0,0 +1,140 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11482481</doc-number>
+        <date>2009-09-14</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">
+      <confidence value="888">-2-</confidence>
+    </boundary-data>
+    <p id="p-1" num="1">In the Specification:</p>
+    <p id="p-2" num="2">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">25,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 25, line">22,</part-num-ref>
+ and continuing on page <part-num-ref name="paragraph beginning on page 25, line 22, and continuing on page">26</part-num-ref>
+ as follows:    </p>
+    <p id="p-3" num="3">Fig. 6 is a block diagram illustrating basic structure of a queue <part-num-ref name="queue">600.</part-num-ref>
+ Queue <part-num-ref name="queue 600. Queue">600</part-num-ref>
+ may be used to form the basis of all other defined queues used in a queue network according to an embodiment of the present invention. Work item propagation through the queue network to fruition is accomplished through subscriptions made on queues. Queue <part-num-ref name="queue network to fruition is accomplished through subscriptions made on queues. Queue">600</part-num-ref>
+ has a queue name or title <part-num-ref name="queue name or title">601.</part-num-ref>
+ Queue <part-num-ref name="queue name or title 601. Queue">600</part-num-ref>
+ has a first-in-first-out (FIFO) queue structure <part-num-ref name="first-in-first-out (FIFO) queue structure">602</part-num-ref>
+ although this is not specifically required in order to practice the present invention. In another embodiment the structure may entertain priority assignment or it may be a virtual queue. Queue <part-num-ref name="virtual queue. Queue">600</part-num-ref>
+ accepts work items queued therein through a queue input <part-num-ref name="queue input">603.</part-num-ref>
+ Work items are de-queued through a queue output <part-num-ref name="queue output">604.</part-num-ref>
+    </p>
+    <p id="p-4" num="4">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">27,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 27, line">15,</part-num-ref>
+ as follows:    </p>
+    <p id="p-5" num="5">User queue 703 has <part-num-ref name="has">11</part-num-ref>
+ total work items queued for processing. Subscription queue <part-num-ref name="total work items queued for processing. Subscription queue">703</part-num-ref>
+ (S-queue-<confidence value="5">1</confidence>
+) has <part-num-ref name="(S-queue-1) has">8</part-num-ref>
+ items <part-num-ref name="items">
+        <confidence value="5">(</confidence>
+705<confidence value="5">)</confidence>
+      </part-num-ref>
+ for processing. Subscription queue <part-num-ref name="for processing. Subscription queue">704</part-num-ref>
+ (S-queue-n) has only <part-num-ref name="(S-queue-n) has only">3</part-num-ref>
+ work items <part-num-ref name="work items">
+        <confidence value="5">(</confidence>
+706<confidence value="5">)</confidence>
+      </part-num-ref>
+ queued for processing. There may be a maximum workload limit value (properties <part-num-ref name="maximum workload limit value (properties">702)</part-num-ref>
+ for queue <part-num-ref name="for queue">700.</part-num-ref>
+ A maximum limit simply means that the user queue can have no more than X total work items queued. The value of a maximum limit of work items queued in each S-queue may vary from S-queue to S-queue within queue <part-num-ref name="maximum limit of work items queued in each S-queue may vary from S-queue to S-queue within queue">700,</part-num-ref>
+ or there may not be a set limit depending on enterprise rule. However the total number of work items that can be handled is the maximum workload (MAX workload) of queue <part-num-ref name="maximum workload (MAX workload) of queue">700</part-num-ref>
+ (properties 702).    </p>
+    <p id="p-6" num="6">Therefore, the total of all of the S-queue limits should not exceed MAX Workload for queue <part-num-ref name="S-queue limits should not exceed MAX Workload for queue">700.</part-num-ref>
+    </p>
+    <p id="p-7" num="7">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">51,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 51, line">10,</part-num-ref>
+ as follows:    </p>
+    <boundary-data type="header">
+      <confidence value="888">-3-</confidence>
+    </boundary-data>
+    <p id="p-8" num="8">
+      <page-break num="2"/>
+Now referring to Fig. 20, at act 2001 evaluation of subscriber queues begins. At act <part-num-ref name="evaluation of subscriber queues begins. At act">2002,</part-num-ref>
+ it is determined if the publishing queue is a basic queue. If this is correct, then at act <part-num-ref name="basic queue. If this is correct, then at act">2003</part-num-ref>
+ it is determined whether the evaluation rule is priority based. If at act <part-num-ref name="evaluation rule is priority based. If at act">2003</part-num-ref>
+ it is determined that the evaluation is based on priority then at act <part-num-ref name="evaluation is based on priority then at act">2004,</part-num-ref>
+ the subscriber queues are sorted by descending priority. The process then resumes to act [[2124]] <part-num-ref name="process then resumes to act [[2124]]">2024</part-num-ref>
+ to determine if a subscriber queue was targeted based on the results of act <part-num-ref name="results of act">2004.</part-num-ref>
+ If no subscriber queue could be qualified, then at act [[2125]] <part-num-ref name="results of act 2004. If no subscriber queue could be qualified, then at act [[2125]]">2025</part-num-ref>
+ an error message is returned. If a queue was found at act [[2124]] <part-num-ref name="queue was found at act [[2124]]">2024,</part-num-ref>
+ then the link to that subscriber queue is returned at act [[2126]] <part-num-ref name="link to that subscriber queue is returned at act [[2126]]">2026</part-num-ref>
+ and the work item may be de-queued into that subscriber queue. It is noted herein that criteria described previously may also be used to help determine an appropriate subscriber queue to accept a work item from the publishing queue.    </p>
+    <p id="p-9" num="9">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">52,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 52, line">1,</part-num-ref>
+ as follows:    </p>
+    <p id="p-10" num="10">Referring back to act 2002, if the publishing queue is not a basic queue then at act <part-num-ref name="basic queue then at act">2006</part-num-ref>
+ it is determined whether or not it is a work<confidence value="7">f</confidence>
+low queue. If at act <part-num-ref name="workflow queue. If at act">2006</part-num-ref>
+ the queue is determined to be a workflow queue, then at act <part-num-ref name="workflow queue, then at act">2007</part-num-ref>
+ it is determined whether the evaluation criteria is explicit selection via a specific subscription path. If the determination is affirmative at act <part-num-ref name="determination is affirmative at act">2007,</part-num-ref>
+ then the specified queue is evaluated at act <part-num-ref name="specified queue is evaluated at act">2008</part-num-ref>
+ according to any other requirements such as those described previously. The process then moves ahead to act <part-num-ref name="process then moves ahead to act">2024</part-num-ref>
+ to determine if the specific queue qualifies. If not at act <part-num-ref name="specific queue qualifies. If not at act">2025</part-num-ref>
+ an error message is returned. If the evaluated queue qualifies to accept the work item then the link is returned at act <part-num-ref name="link is returned at act">2026.</part-num-ref>
+    </p>
+    <p id="p-11" num="11">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">52,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 52, line">20,</part-num-ref>
+ as follows:    </p>
+    <p id="p-12" num="12">If at act 2012 it is determined that the shortest wait time qualifies, then at act <part-num-ref name="shortest wait time qualifies, then at act">2013</part-num-ref>
+ the system determines the most qualified queue having the shortest expected wait time.    </p>
+    <boundary-data type="header">
+      <confidence value="888">-4-</confidence>
+    </boundary-data>
+    <p id="p-13" num="13">
+      <page-break num="3"/>
+If at act 2012 it is determined that the longest wait time qualifies, then at act <part-num-ref name="longest wait time qualifies, then at act">2014</part-num-ref>
+ the system determines the most qualified queue having the longest expected wait time. The process then moves to act <part-num-ref name="process then moves to act">2024</part-num-ref>
+ where it is determined if a queue was found. If not at act <part-num-ref name="queue was found. If not at act">2025</part-num-ref>
+ an error message is returned. If at act <part-num-ref name="error message is returned. If at act">2024</part-num-ref>
+ a subscriber queue was found then at act <part-num-ref name="subscriber queue was found then at act">2026</part-num-ref>
+ a link to the queue is returned. Regarding act <part-num-ref name="queue is returned. Regarding act">2026,</part-num-ref>
+ the link is actually returned to the local broker instance, the link enabling traversal of the de-queued item to the next queue.    </p>
+    <p id="p-14" num="14">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">53,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 53, line">1,</part-num-ref>
+ as follows:    </p>
+    <p id="p-15" num="15">Referring back to act 2011 for a super queue, if it is determined that the evaluation criteria is not expected wait time, then at act <part-num-ref name="evaluation criteria is not expected wait time, then at act">2016,</part-num-ref>
+ it is determined if the evaluation is based on queue length meaning the number of work items held in the subscriber queue at the time of evaluation. If affirmative at act <part-num-ref name="time of evaluation. If affirmative at act">2016,</part-num-ref>
+ then at act <part-num-ref name="time of evaluation. If affirmative at act 2016, then at act">2017</part-num-ref>
+ it is determined whether shorter or longer queue length is preferred. If shorter queue length is preferred at act <part-num-ref name="it is determined whether shorter or longer queue length is preferred. If shorter queue length is preferred at act">2017,</part-num-ref>
+ then at act <part-num-ref name="it is determined whether shorter or longer queue length is preferred. If shorter queue length is preferred at act 2017, then at act">2018,</part-num-ref>
+ the system sorts the candidates by the shortest queue length or the most qualified queue having the fewest number of work items queued. If longer queue length is preferred at act <part-num-ref name="fewest number of work items queued. If longer queue length is preferred at act">2017,</part-num-ref>
+ then at act <part-num-ref name="fewest number of work items queued. If longer queue length is preferred at act 2017, then at act">2019,</part-num-ref>
+ the system sorts the candidates by the longest queue length or the most qualified queue having the highest number of work items queued. The process then moves on to acts <part-num-ref name="process then moves on to acts">2024</part-num-ref>
+ then <part-num-ref name="then">2025</part-num-ref>
+ or acts <part-num-ref name="or acts">2024</part-num-ref>
+ then <part-num-ref name="then">2026</part-num-ref>
+ depending on the results of act <part-num-ref name="results of act">2018.</part-num-ref>
+    </p>
+    <p id="p-16" num="16">Please amend the paragraph beginning on page <part-num-ref name="paragraph beginning on page">53,</part-num-ref>
+ line <part-num-ref name="paragraph beginning on page 53, line">10,</part-num-ref>
+ as follows:    </p>
+    <p id="p-17" num="17">Referring back to act 2016, if it is determined that the evaluation criteria is not queue length then at act <part-num-ref name="evaluation criteria is not queue length then at act">2020</part-num-ref>
+ it is determined whether the evaluation is based on an acceptance window defined as a period of time from the time of evaluation of a subscriber queue back to the time a last work item was accepted into the queue. If at act <page-break num="4"/>
+      <boundary-data type="header">
+        <confidence value="888">-5-</confidence>
+      </boundary-data>
+      <part-num-ref name="queue. If at act">2020</part-num-ref>
+ the evaluation is based on an acceptance window, then at act <part-num-ref name="acceptance window, then at act">2021,</part-num-ref>
+ it is determined whether a shortest window or a longest window is specified. If at act <part-num-ref name="longest window is specified. If at act">2021</part-num-ref>
+ a shortest window is specified, then at act <part-num-ref name="shortest window is specified, then at act">2022</part-num-ref>
+ the system sorts by the shortest acceptance window.    </p>
+    <p id="p-18" num="18">If at act 2021 a longest window is specified, then at act <part-num-ref name="longest window is specified, then at act">2023</part-num-ref>
+ the system sorts by the longest acceptance window. The process then moves to acts <part-num-ref name="process then moves to acts">2024</part-num-ref>
+ then <part-num-ref name="then">2026</part-num-ref>
+ or <part-num-ref name="or">2024</part-num-ref>
+ then <part-num-ref name="then">2025</part-num-ref>
+ depending on the results.    </p>
+  </description>
+</us-patent-application>
+

applicant/11500863.xml

@@ -0,0 +1,700 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11500863</doc-number>
+        <date>2006-08-07</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">
+      <confidence value="2222">iEST</confidence>
+ AVAILABLE <confidence value="2222">CONY</confidence>
+ Attorney Docket No. ADOBB<confidence value="588">032</confidence>
+     </p>
+    <heading id="h-1">PATENT APPLICATION FOR UNITED STATES PATENT</heading>
+    <heading id="h-2">REVIEW OF SIGNATURE BASED CONTENT</heading>
+    <p id="p-2" num="2">By Inventors:</p>
+    <p id="p-3" num="3">Amit Gupta Noida, India A Citizen of India Scott A. Grant San Mateo, CA A Citizen of the United States Ronald Nydam San Jose, CA A Citizen of the United States Pankaj Gupta Noida, India A Citizen of India Assignee: Adobe Systems Incorporated </p>
+    <heading id="h-3">VAN PELT, YI &amp; JAMES LLP</heading>
+    <p id="p-4" num="4">10050 N. Foothill Blvd., Suite 200 Cupertino, CA <part-num-ref name="Cupertino, CA">95014</part-num-ref>
+ <boundary-data type="header">Telephone 408-973-2585</boundary-data>
+      <page-break num="2"/>
+    </p>
+    <heading id="h-4">REVIEW OF SIGNATURE BASE<confidence value="8">D</confidence>
+ CONTENT    </heading>
+    <heading id="h-5">BACKGROUND</heading>
+    <p id="p-5" num="5">
+      <confidence value="424424">[0oo0]</confidence>
+      Creating multimedia content for multimedia productions typically involves a team of more than one person to create and/or to review the content to provide any feedback or other comments to the content creator and editor. In the past, the review of preliminary media productions was a manual process. The video to be reviewed would be recorded to a medium such as a videotape or a digital video disk (DVD) and then physically mailed to the reviewer. If multiple reviewers were involved, then multiple copies of the original rough cut media content would be made. The reviewers would receive the videotape or DVD, find a proper playback device and then watch the video. The reviewers would take hand written notes of any comments they have about the video being watched. Often, the comments are related to specific moments in the video. Timing data would either be visibly recorded over a portion of the video being reviewed, or a numerical counter on the videotape player or DVD player would be referenced to provide a time based context for the comments being made. Once the review was completed, the notes would then be mailed back to the editor. The editor would then manually reference the comments and attempt to coordinate align the comment to a specific moment in the video project. The accuracy of such comments with respect to the timeline often would be subject to the error of the reviewer, the reviewer's playback machine, and also of the content editor and the content editor's playback machine.    </p>
+    <boundary-data type="header">
+      <confidence value="7">1</confidence>
+    </boundary-data>
+    <heading id="h-6">DESCRIPTION OF THE DRAWING FIGURES</heading>
+    <p id="p-6" num="6">
+      <page-break num="3"/>
+[0002<confidence value="5">]</confidence>
+      The subject matter regarded as the claimed subject matter is particularly pointed out and distinctly claimed in the concluding portion of the specification. The claimed subject matter, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:    </p>
+    <p id="p-7" num="7">
+      <confidence value="5">[</confidence>
+0003<confidence value="5">1</confidence>
+      FIG. <confidence value="4">1</confidence>
+ is a block diagram of a content review system accordance with one or more embodiments;    </p>
+    <p id="p-8" num="8">[0004<confidence value="5">1</confidence>
+      FIG. 2 is a diagram of a program interface for creating and editing signature based content in accordance with one or more embodiments;    </p>
+    <p id="p-9" num="9">
+      <confidence value="5">[</confidence>
+0005<confidence value="5">]</confidence>
+      FIG. 3 is a diagram of a control dialog for exporting timeline based content for review in accordance with one or more embodiments;    </p>
+    <p id="p-10" num="10">
+      <confidence value="2">[</confidence>
+0006<confidence value="5">1</confidence>
+      FIG. 4 is a diagram of a program interface for reviewing and annotating signature based content in accordance with one or more embodiments;    </p>
+    <p id="p-11" num="11">
+      <confidence value="5">[</confidence>
+0007<confidence value="5">]</confidence>
+      FIG. 5 is an alternate diagram of a program interface for reviewing and annotating signature based content in accordance with one or more embodiments;    </p>
+    <boundary-data type="header">
+      <confidence value="8">2</confidence>
+    </boundary-data>
+    <p id="p-12" num="12">
+      <page-break num="4"/>
+      <confidence value="5">[</confidence>
+0008<confidence value="5">1</confidence>
+      FIG. 6 is a diagram of a program interface for creating and editing signature based content in which reviewed content may be displayed in accordance with one or more embodiments;    </p>
+    <p id="p-13" num="13">[0009<confidence value="5">]</confidence>
+       FIG. 7 is a diagram of an annotation map showing the integration of the comments of multiple reviewers with a timeline of signature based content in accordance with one or more embodiments;    </p>
+    <p id="p-14" num="14">[0010<confidence value="4">]</confidence>
+       FIG. 8 is a flow diagram of a method for creating a timeline for signature based content and for exporting a review file for a reviewer of the content in accordance with one or more embodiments;    </p>
+    <p id="p-15" num="15">
+      <confidence value="5">[</confidence>
+0011]      FIG. 9 is a flow diagram of a method for reviewing and annotating signature based content in accordance with one or more embodiments; and <confidence value="5">[</confidence>
+0012<confidence value="5">1</confidence>
+      FIG. 10 is a block diagram of a computing platform suitable for running a program to create and edit signature based content and for reviewing timeline based content in accordance with one or more embodiments.    </p>
+    <p id="p-16" num="16">
+      <confidence value="2">[</confidence>
+0013<confidence value="5">]</confidence>
+      It will be appreciated that for simplicity and clarity of illustration, elements illustrated in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements are exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals have been repeated among the figures to indicate corresponding or analogous elements.    </p>
+    <boundary-data type="header">
+      <confidence value="1">3</confidence>
+    </boundary-data>
+    <heading id="h-7">DETAILED DESCRIPTION</heading>
+    <p id="p-17" num="17">
+      <page-break num="5"/>
+      <confidence value="5">[</confidence>
+0014<confidence value="5">]</confidence>
+       In the following detailed description, numerous specific details are set forth in. order to provide a thorough understanding of the claimed subject matter.    </p>
+    <p id="p-18" num="18">However, it will be understood by those skilled in the art that the claimed subject matter may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail.</p>
+    <p id="p-19" num="19">
+      <confidence value="688884">[0015]</confidence>
+       Some portions of the detailed description that follows are presented in terms of algorithms, programs or the like and/or symbolic representations of operations on data bits or binary digital signals within a computer memory. These algorithmic descriptions and representations may be the techniques used in the data processing arts to convey the arrangement of a computer system or other information handling system to operate according to the programs.    </p>
+    <p id="p-20" num="20">
+      <confidence value="5">[</confidence>
+0016<confidence value="5">]</confidence>
+       An algorithm may be generally considered to be a self-consistent sequence of acts or operations leading to a desired result. These include physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the for<confidence value="8">m</confidence>
+ of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be understood, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.    </p>
+    <p id="p-21" num="21">
+      <confidence value="5">[</confidence>
+0017<confidence value="5">1</confidence>
+       Unless specifically stated otherwise, as apparent from  the following discussions, it is appreciated that throughout the specification discussions utilizing terms such as processing, computing, calculating, determining, or the like, refer to the action or <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+processes of a computer or computing system, or similar electronic computing device, that manipulate or transform data represented as physical, such as electronic, quantities within the registers or memories of the computing system into other data similarly represented as physical quantities within the memories, registers or other such information storage, transmission or display devices of the computing system or other information handling system.    </p>
+    <p id="p-22" num="22">
+      <confidence value="688885">[00181</confidence>
+       Embodiments may include apparatuses for performing the operations herein. This apparatus may be specially constructed for the desired purposes, or it may comprise a general purpose computing device selectively activated or configured by a program stored in the device. Such a program may be stored on a storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, <confidence value="5">C</confidence>
+D-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAM<confidence value="588">s),</confidence>
+ electrically programmable read-only memories (EPROMs), electrically erasable and programmable read only memories (EEPROMs), flash memory, magnetic or optical cards, or any other type of media suitable for storing electronic instructions, and capable of being coupled to a system bus for a computing device or other information handling system.    </p>
+    <p id="p-23" num="23">
+      <confidence value="5">[</confidence>
+0019<confidence value="5">1</confidence>
+       The processes and displays presented herein are not inherently related to any particular computing device or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct a more specialized apparatus to perform the desired method. The desired structure for a variety of these systems will be apparent from the description below. In addition, embodiments are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the claimed subject matter as described herein.    </p>
+    <boundary-data type="header">
+      <confidence value="8">5</confidence>
+    </boundary-data>
+    <p id="p-24" num="24">
+      <page-break num="7"/>
+[0020<confidence value="5">1</confidence>
+       In the following description and claims, the terms coupled and connected, along with their derivatives, may be used. In particular embodiments, connected may be used to indicate that two or more elements are in direct physical or electrical contact with each other. Coupled may mean that two or more elements are in direct physical or electrical contact. However, coupled may also mean that two or more elements may not be in direct contact with each other, but yet may still cooperate or interact with each other. Furthermore, words or terms that connote a conditional occurrence with respect to time, such as when or upon, may mean at a particular instant in time and may also mean near a particular instant in time and may include times preceding the instant in time and times subsequent to the instant in time, for example after a delay period from the particular instant in time. In addition, where a public available or commonly utilized standard is discussed, any one or more promulgated versions of the standard may be suitable for any one or more embodiments, and may include prior versions, current versions, and/or future adopted versions.    </p>
+    <p id="p-25" num="25">[0021<confidence value="2">]</confidence>
+       Referring now to FIG. 1, a block diagram of a content review system accordance with one or more embodiments will be discussed. As shown in FIG. <confidence value="5">1</confidence>
+, a content creator/editor <part-num-ref name="content creator/editor">110</part-num-ref>
+ may create or edit media content, which may include for example an electronic video file, an electronic audio file, an electronic audio/video file or multimedia, or a graphical animation file or the like. Content creator/editor <part-num-ref name="like. Content creator/editor">110</part-num-ref>
+ may desire to have the media content reviewed by one or more reviewers including a first reviewer <part-num-ref name="first reviewer">116</part-num-ref>
+ (Reviewer 1), a second reviewer <part-num-ref name="second reviewer">118</part-num-ref>
+ (Reviewer 2), up to N number of reviewers (Reviewer N) with an Nth reviewer <part-num-ref name="Nth reviewer">120.</part-num-ref>
+ In one embodiment, reviewers 116- <part-num-ref name="Nth reviewer 120. In one embodiment, reviewers 116-">120</part-num-ref>
+ may be in a location remote from the location of content editor/creator <part-num-ref name="location of content editor/creator">110.</part-num-ref>
+ In such an arrangement, content to be reviewed may be transmitted to reviewers 116-120 via a network <part-num-ref name="network">112</part-num-ref>
+ that may allow reviewers 116-120 to obtain and review the content from their local machine or computing platform. Network <part-num-ref name="content from their local machine or computing platform. Network">112</part-num-ref>
+ may be a local area network (LAN) or may be a wide area network (WAN) or metropolitan area network (MAN). In <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+addition, network <part-num-ref name="wide area network (WAN) or metropolitan area network (MAN). In addition, network">112</part-num-ref>
+ may be a wired network such as an Ethernet network or may be a wireless network such as a wireless local area network or a cellular telephone network, or a combination of a wired and wireless network. Furthermore, network <part-num-ref name="wired and wireless network. Furthermore, network">112</part-num-ref>
+ may include the Internet or the like type of network, although the scope of the claimed subject matter is not limited in this respect. In one embodiment, the content to be reviewed may be stored on a media server <part-num-ref name="media server">114</part-num-ref>
+ and streamed to reviewers 116-120 via network <part-num-ref name="and streamed to reviewers 116-120 via network">112,</part-num-ref>
+ and in an alternative embodiment, content creator/editor <part-num-ref name="alternative embodiment, content creator/editor">110</part-num-ref>
+ may send the content to be reviewed directly to reviewers 116-120 for their review, although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, content creator/editor <part-num-ref name="claimed subject matter is not limited in this respect. In one or more embodiments, content creator/editor">110</part-num-ref>
+ may desire to have content reviewed and annotated by one or more of reviewers 116-120 wherein the annotations correspond to one or more signatures of the reviewed content with respect to a time based flow of the content. For example, one signature of the content may comprise a timeline of the content based at least in part on the passage of time at given time values as the content is played or otherwise displayed. In such an arrangement, reviewers 116-120 may review the content with respect to the timeline, and provide annotations of the content at one or more time values in the timeline. The annotations of the content may then be selectively displayed by content creator/editor <part-num-ref name="content may then be selectively displayed by content creator/editor">110</part-num-ref>
+ upon the occurrence of the signature during playback of the content. In one embodiment<confidence value="5">,</confidence>
+ the signature may comprise the time values of the timeline at which the annotations were made by one or more of reviewers 116-120. In alternative embodiments, other signatures of the content may be utilized to determine when the corresponding annotations are displayed during playback of the content, either in combination with the timeline time values, or alternatively independent of the timeline time values, although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, a non-exhaustive list of optional signatures of the content may include a color value of an image of the content as a whole or a part of the image, a brightness value of an image of the content as a whole or a part of the image, an opacity or transparency value of an image of the content as a whole or a part of the image, a value corresponding to an audio level of a sound file or track of the content for example a decibel value of an audio signal, an object in the content, a spatial location or coordinate value within a coordinate grid of an image of the content, any change in value, <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+or a differential with respect to time, of a signature from one point in time to another point in time for example a change in a color value, a <confidence value="5">.</confidence>
+change in a brightness value, a change in an object, a change in an audio signal level value, a change in an opacity or transparency value, or the signature may comprise any preexisting metadata applied to any predetermined portion of the content, for example a clip, a frame, or any other of the above listed signature values, for example metadata that indicates a camera iris setting or an aperture setting, although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, the location of the correlating pair or pairs of signature values may be determined non-linearly with respect to the time based flow of the content. Such an arrangement allows the information that correlates the signature values to the content to be provided with respect to a context of a moment in the content in which the signature values appear and/or where the annotations are made. In other embodiments for non-temporal content, for example still images, three-dimensional models, menus for digital versatile disks or the like, and/or non-contiguous layouts as utilized with the content of digital versatile disks or the like, correlation between annotations of the content and the signature values of the content may be global and not based on a timeline or a time reference, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-26" num="26">[0022<confidence value="5">]</confidence>
+       In one or more embodiments, although a media server <part-num-ref name="media server">114</part-num-ref>
+ is shown as being an optional intermediate storage location for a content file to be reviewed by one or more of reviewers 116-120, media server <part-num-ref name="content file to be reviewed by one or more of reviewers 116-120, media server">114</part-num-ref>
+ optionally may not control the review of the content by reviewers 116-120 in a client-server type of system. Thus, content/creator editor <part-num-ref name="client-server type of system. Thus, content/creator editor">110</part-num-ref>
+ may create content to be reviewed by reviewers 116-120 using a local machine and then send the a review file to one or more of reviewers 116-120 which may be received at the local machines of reviewers 116-120 via network <part-num-ref name="local machines of reviewers 116-120 via network">112.</part-num-ref>
+ In such an arrangement, network <part-num-ref name="arrangement, network">112</part-num-ref>
+ is a transmission medium over which the review file is transmitted from content creator/editor <part-num-ref name="review file is transmitted from content creator/editor">110</part-num-ref>
+ to one or more reviewers 116-120 without requiring network <part-num-ref name="to one or more reviewers 116-120 without requiring network">112</part-num-ref>
+ to be involved in controlling the review of the content of the review file by reviewers 116-120. Likewise, in such an arrangement media server <part-num-ref name="arrangement media server">114</part-num-ref>
+ is <confidence value="2">g</confidence>
+ <page-break num="10"/>
+a storage location from which one or more of reviewers 116-120 may download or stream the content to be reviewed on the local machines of reviewers <confidence value="5">1</confidence>
+16-120 without requiring media server <part-num-ref name="local machines of reviewers 116-120 without requiring media server">114</part-num-ref>
+ to be involved in controlling the review of the content of the review file by reviewers 116-120. In such an arrangement, content creator/editor <part-num-ref name="arrangement, content creator/editor">110</part-num-ref>
+ may create content on a local machine using a client software program running on the local machine to generate a review file to be sent to reviewers 116-120 who may then review the content of the review file and make annotations or comments using a client software program running on their local machines to generate an annotation file that is sent back to content creator/editor <part-num-ref name="annotation file that is sent back to content creator/editor">110</part-num-ref>
+ who may aggregate the annotations received from reviewers 116-120 using the client software program initially used to create the review file. Such an arrangement may be considered to be a client-client based review and annotation process rather than a client-server based review and annotation process, although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, one or more of reviewers 116-120 may collaborate with another one or more of reviewers 1<confidence value="5">1</confidence>
+6-120 during the review process.   In such an arrangement, annotations of the reviewers 116-120 may be stored on a server commonly accessible to one or more of reviewers 116-120, for example media server <part-num-ref name="server commonly accessible to one or more of reviewers 116-120, for example media server">114</part-num-ref>
+ so that the reviewers may be able to review the annotations of other reviewers and make additional comments, changes, or other annotations to their own annotations and/or to the comments and/or annotations of one or more of the other reviewers. Such additional annotations may be synchronized with the annotations of reviewers 116-120 and sent to content creator/editor <part-num-ref name="annotations of reviewers 116-120 and sent to content creator/editor">110</part-num-ref>
+ for aggregation of the annotations. In one particular embodiment, such collaborative review of the annotations of other reviewers may be controlled via one or more security measures such as passwords or encryption. For example, it may be desirable to prevent one of reviewers 116-120 from reviewing the annotations of another one of reviewers 116-120. Such security measures may be implemented to control who has access to the annotations of designated reviewers, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <p id="p-27" num="27">
+      <page-break num="11"/>
+[0023<confidence value="5">1</confidence>
+      Referring now to FI<confidence value="5">G</confidence>
+. 2, a diagram of a program for creating and editing signature based content in accordance with one or more embodiments will be discussed.    </p>
+    <p id="p-28" num="28">As shown in FIG. 2, content creator/editor 110 may create or edit content using a content creation or editing program interface <part-num-ref name="content creation or editing program interface">200</part-num-ref>
+ of a content creation or editing program. The content creation or editing program that includes content creation or editing program interface <part-num-ref name="content creation or editing program that includes content creation or editing program interface">200</part-num-ref>
+ may comprise, for example, Adobe<confidence value="2">@</confidence>
+ Premiere<confidence value="4">®</confidence>
+ Pro 1.5 or the like available from Adobe Systems Incorporated of San Jose, California, USA. In one embodiment as discussed herein, the signature of the content will be discussed as timeline time values, although the scope of the claimed subject matter is not limited in this respect. A timeline <part-num-ref name="timeline">210</part-num-ref>
+ for the content <part-num-ref name="content">212</part-num-ref>
+ may be created and associated with media file <part-num-ref name="may be created and associated with media file">214</part-num-ref>
+ that contains content <part-num-ref name="that contains content">212.</part-num-ref>
+ As shown in FIG. 2, timeline <part-num-ref name="that contains content 212. As shown in FIG. 2, timeline">210</part-num-ref>
+ may include a timing reference for both a video portion <part-num-ref name="video portion">216</part-num-ref>
+ of media file <part-num-ref name="of media file">214</part-num-ref>
+ and an audio portion <part-num-ref name="audio portion">218</part-num-ref>
+ of media file <part-num-ref name="of media file">214.</part-num-ref>
+ Other signatures may also be identified and associated with media file <part-num-ref name="of media file 214. Other signatures may also be identified and associated with media file">214.</part-num-ref>
+ In one or more embodiments, media file <part-num-ref name="of media file 214. Other signatures may also be identified and associated with media file 214. In one or more embodiments, media file">214</part-num-ref>
+ may comprise a portion of or all of a project <part-num-ref name="project">220</part-num-ref>
+ of which content <part-num-ref name="of which content">212</part-num-ref>
+ may comprise a portion. In such embodiments, content editor/creator <part-num-ref name="portion. In such embodiments, content editor/creator">110</part-num-ref>
+ may select a desired portion of project <part-num-ref name="desired portion of project">220</part-num-ref>
+ to be reviewed. This may be done, for example, by selecting one or more portions of project <part-num-ref name="to be reviewed. This may be done, for example, by selecting one or more portions of project">220</part-num-ref>
+ as content <part-num-ref name="as content">212</part-num-ref>
+ to be reviewed. Furthermore, content creator/editor <part-num-ref name="to be reviewed. Furthermore, content creator/editor">110</part-num-ref>
+ may designate a first portion of project <part-num-ref name="first portion of project">220</part-num-ref>
+ or content <part-num-ref name="or content">212</part-num-ref>
+ to be reviewed by a first reviewer <part-num-ref name="first reviewer">116,</part-num-ref>
+ a second portion of project <part-num-ref name="second portion of project">220</part-num-ref>
+ or content <part-num-ref name="or content">212</part-num-ref>
+ to be reviewed by a second reviewer <part-num-ref name="second reviewer">118,</part-num-ref>
+ and so on wherein first reviewer <part-num-ref name="second reviewer 118, and so on wherein first reviewer">116</part-num-ref>
+ reviewers content <part-num-ref name="reviewers content">212</part-num-ref>
+ that may be different in part or in whole from the content <part-num-ref name="content">212</part-num-ref>
+ reviewed by second reviewer <part-num-ref name="reviewed by second reviewer">118.</part-num-ref>
+ In one embodiment, first reviewer <part-num-ref name="reviewed by second reviewer 118. In one embodiment, first reviewer">116</part-num-ref>
+ may not review the same portion of content <part-num-ref name="same portion of content">212</part-num-ref>
+ as reviewed by second reviewer <part-num-ref name="as reviewed by second reviewer">118,</part-num-ref>
+ and furthermore first reviewer <part-num-ref name="as reviewed by second reviewer 118, and furthermore first reviewer">116</part-num-ref>
+ may not see the annotations made by second reviewer <part-num-ref name="annotations made by second reviewer">118,</part-num-ref>
+ and second reviewer <part-num-ref name="annotations made by second reviewer 118, and second reviewer">118</part-num-ref>
+ may not see the annotations made by first reviewer <part-num-ref name="annotations made by first reviewer">116.</part-num-ref>
+ The annotations of content <part-num-ref name="annotations of content">212</part-num-ref>
+ made be first reviewer <part-num-ref name="made be first reviewer">116</part-num-ref>
+ and second reviewer <part-num-ref name="and second reviewer">118</part-num-ref>
+ may be sent to content editor/creator <part-num-ref name="may be sent to content editor/creator">110</part-num-ref>
+ and then combined and aggregated with respect to their occurrences in timeline <part-num-ref name="and then combined and aggregated with respect to their occurrences in timeline">210,</part-num-ref>
+ wherein content creator/editor <part-num-ref name="and then combined and aggregated with respect to their occurrences in timeline 210, wherein content creator/editor">110</part-num-ref>
+ may view the annotations made by all of reviewers 116-120 or may selectively view the annotations of a selected one or more or reviewers 116-120 without viewing the annotations of non-selected ones <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+of reviewers 116-120, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-29" num="29">
+      <confidence value="2">[</confidence>
+0024<confidence value="2">]</confidence>
+      As shown in FIG. 2, timeline 210 may correspond to one or more signatures of the content <part-num-ref name="content">212</part-num-ref>
+ of media file <part-num-ref name="of media file">214</part-num-ref>
+ for some portion of or the entirety of content <part-num-ref name="entirety of content">214</part-num-ref>
+ from a beginning point to an end point during playback of media file <part-num-ref name="end point during playback of media file">214.</part-num-ref>
+    </p>
+    <p id="p-30" num="30">Such a signature may provide a reference against which a reviewer of content <part-num-ref name="reviewer of content">212</part-num-ref>
+ may make annotations of content <part-num-ref name="may make annotations of content">212</part-num-ref>
+ so that the annotations when sent back to content creator/editor <part-num-ref name="annotations when sent back to content creator/editor">
+        <confidence value="5">1</confidence>
+10      </part-num-ref>
+ may be observed by content editor/creator <part-num-ref name="may be observed by content editor/creator">110</part-num-ref>
+ when such a signature or signatures occur, or near such an occurrence, for example at the time values of timeline <part-num-ref name="time values of timeline">210</part-num-ref>
+ corresponding to the annotations. Otherwise, program interface <part-num-ref name="annotations. Otherwise, program interface">200</part-num-ref>
+ may selectively not display the annotations when the signatures do not occur during playback, for example at other time values, although the scope of the claimed subject matter is not limited in this respect. Once a signature such as timeline <part-num-ref name="signature such as timeline">210</part-num-ref>
+ is associated with content <part-num-ref name="is associated with content">212,</part-num-ref>
+ program interface <part-num-ref name="is associated with content 212, program interface">200</part-num-ref>
+ may export a review file to one or more reviewers 116-120 for review of content <part-num-ref name="review file to one or more reviewers 116-120 for review of content">212.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">
+      <confidence value="5">[</confidence>
+0025<confidence value="2">]</confidence>
+       Referring now to FIG. 3, a diagram of a control dialog for exporting signature based content for review in accordance with one or more embodiments will be discussed. Once a timeline <part-num-ref name="timeline">210</part-num-ref>
+ or other signature has been created for content <part-num-ref name="or other signature has been created for content">212</part-num-ref>
+ of media file <part-num-ref name="of media file">214,</part-num-ref>
+ the content creator/editor <part-num-ref name="content creator/editor">110</part-num-ref>
+ may export a file for review by one or more reviewers 116-118, in which one or more reviewing options may be selected by the content creator/editor <part-num-ref name="content creator/editor">
+        <confidence value="5">1</confidence>
+10.      </part-num-ref>
+ As shown in FIG. 3, a control dialog <part-num-ref name="control dialog">300</part-num-ref>
+ may be utilized to export the review file with options selected by content creator/editor <part-num-ref name="review file with options selected by content creator/editor">110.</part-num-ref>
+ For example, the format of media file <part-num-ref name="format of media file">214</part-num-ref>
+ may be selected using pull down menu <part-num-ref name="may be selected using pull down menu">310</part-num-ref>
+ wherein one or more content formats may be selected such as Windows Media or QuickTime formats.    </p>
+    <p id="p-32" num="32">The quality of media file 214 may be selected using pull down menu <part-num-ref name="may be selected using pull down menu">312</part-num-ref>
+ to select, for example, size of the video file, sampling rate, compression ratio, and so on. Content creator/editor <part-num-ref name="video file, sampling rate, compression ratio, and so on. Content creator/editor">110</part-num-ref>
+ may select to export video portion of content <part-num-ref name="may select to export video portion of content">212</part-num-ref>
+ via selection box <part-num-ref name="via selection box">314</part-num-ref>
+ <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+or an audio portion of content <part-num-ref name="audio portion of content">212</part-num-ref>
+ via selection boxes <part-num-ref name="via selection boxes">316</part-num-ref>
+ or both video and audio portions. Content creator/editor <part-num-ref name="or both video and audio portions. Content creator/editor">110</part-num-ref>
+ may select to provide media file <part-num-ref name="may select to provide media file">214</part-num-ref>
+ to reviewers 116-120 by streaming media file <part-num-ref name="to reviewers 116-120 by streaming media file">214</part-num-ref>
+ to reviewers 116-120 or alternatively by incorporating media file <part-num-ref name="to reviewers 116-120 or alternatively by incorporating media file">214</part-num-ref>
+ into the exported review file via pull down menu <part-num-ref name="exported review file via pull down menu">318.</part-num-ref>
+    </p>
+    <p id="p-33" num="33">Optionally, a password for controlling access to the review file may be entered into box <part-num-ref name="review file may be entered into box">320</part-num-ref>
+ if a level of security is desired. Furthermore, content creator/editor <part-num-ref name="level of security is desired. Furthermore, content creator/editor">110</part-num-ref>
+ may selective attach instructions to reviewers 116-120 via button <part-num-ref name="may selective attach instructions to reviewers 116-120 via button">322</part-num-ref>
+ which for example may allow content creator/editor <part-num-ref name="which for example may allow content creator/editor">110</part-num-ref>
+ to attach a text file or the like to the review file that includes instructions for reviewers 116-120 to follow as part of their review of content <part-num-ref name="review file that includes instructions for reviewers 116-120 to follow as part of their review of content">212.</part-num-ref>
+ In one embodiment, program interface <part-num-ref name="review file that includes instructions for reviewers 116-120 to follow as part of their review of content 212. In one embodiment, program interface">200</part-num-ref>
+ of the content creation and editing program may allow a review file to be exported an Adobe<confidence value="4">®</confidence>
+ Portable Document Format file specified by Adobe Systems Incorporated of San Jose, California, USA, that is able to be reviewed using an Adobe Acrobat<confidence value="5">®</confidence>
+ program which reviewers 116-120 may utilize to review content <part-num-ref name="Adobe Acrobat® program which reviewers 116-120 may utilize to review content">212</part-num-ref>
+ and to provide annotations of content <part-num-ref name="and to provide annotations of content">212,</part-num-ref>
+ although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, the review file may be optionally compressed to reduce the size of the review file, for example where the review file contains content <part-num-ref name="review file contains content">212</part-num-ref>
+ or where the review file is sent to a reviewer via electronic mail, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-34" num="34">
+      <confidence value="688882">[0026]</confidence>
+      As shown in FIG. 3, where content creator/editor 110 selects to have content <part-num-ref name="selects to have content">212</part-num-ref>
+ to be reviewed by reviewers 116-120 via streaming the content <part-num-ref name="content">212</part-num-ref>
+ to the reviewers 116-120 as selected using pull down menu <part-num-ref name="reviewers 116-120 as selected using pull down menu">318,</part-num-ref>
+ one or more streaming settings may be selected by content creator/editor <part-num-ref name="reviewers 116-120 as selected using pull down menu 318, one or more streaming settings may be selected by content creator/editor">110.</part-num-ref>
+ For example, the uniform resource locator (URL) address where media file <part-num-ref name="uniform resource locator (URL) address where media file">214</part-num-ref>
+ containing content <part-num-ref name="containing content">212</part-num-ref>
+ is stored may be provided in box <part-num-ref name="is stored may be provided in box">324.</part-num-ref>
+ Optionally, content creator/editor <part-num-ref name="is stored may be provided in box 324. Optionally, content creator/editor">110</part-num-ref>
+ may select to utilize a file transfer protocol (FTP) to provide access to media file <part-num-ref name="file transfer protocol (FTP) to provide access to media file">214</part-num-ref>
+ via selection box <part-num-ref name="via selection box">326.</part-num-ref>
+ In such an arrangement, the name of the media server <part-num-ref name="media server">114</part-num-ref>
+ may be provided in box <part-num-ref name="may be provided in box">328,</part-num-ref>
+ the port through which media file <part-num-ref name="port through which media file">214</part-num-ref>
+ may be accessed may be provided in box <part-num-ref name="may be accessed may be provided in box">330,</part-num-ref>
+ and the remote user directory may be provided in box <part-num-ref name="remote user directory may be provided in box">332.</part-num-ref>
+ A user name and password for <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+accessing the directory may be provided in boxes <part-num-ref name="directory may be provided in boxes">334</part-num-ref>
+ and <part-num-ref name="and">336,</part-num-ref>
+ respectively, to provide a level of security for accessing media file <part-num-ref name="level of security for accessing media file">214,</part-num-ref>
+ and the number of retries allowed before access to media file <part-num-ref name="number of retries allowed before access to media file">214</part-num-ref>
+ fails may be provided in box <part-num-ref name="fails may be provided in box">338.</part-num-ref>
+ Optionally, the review file may be encrypted using encryption methods such as a public key and private key encryption arrangement, although the scope of the claimed subject matter is not limited in this respect. Optionally, a selection may be made to send the local file to the recycle bin after viewing using box <part-num-ref name="recycle bin after viewing using box">340,</part-num-ref>
+ and the connection to media file <part-num-ref name="connection to media file">214</part-num-ref>
+ may be optionally verified using box <part-num-ref name="may be optionally verified using box">342.</part-num-ref>
+ Upon selection of the desired options for the review file, the review file may be exported by selecting an "OK" button <part-num-ref name="&quot;OK&quot; button">344,</part-num-ref>
+ or optionally the exporting of the review file may be canceled by selecting a "Cancel" button <part-num-ref name="&quot;Cancel&quot; button">346.</part-num-ref>
+ Once the review file has been exported using control dialog <part-num-ref name="review file has been exported using control dialog">300,</part-num-ref>
+ the review file may be sent to one or more reviewers 116-120 for review via network <part-num-ref name="review file may be sent to one or more reviewers 116-120 for review via network">112,</part-num-ref>
+ for example by sending the review file to reviewers 116-120 via electronic mail (e-mail), although the scope of the claimed subject matter is not limited in this respect. Once reviewers 1160-120 have received the review file, reviewers 116-120 may open the review file to view content <part-num-ref name="review file to view content">212</part-num-ref>
+ and to provide annotations of content <part-num-ref name="and to provide annotations of content">212</part-num-ref>
+ based at least in part on one or more signatures of content <part-num-ref name="based at least in part on one or more signatures of content">212.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">[0027<confidence value="5">1</confidence>
+      Referring now to FIG. 4, a diagram of a program for reviewing and annotating signature based content in accordance with one or more embodiments will be discussed. When one or more of reviewers 116-120 receive a review file to be reviewed from content creator/editor <part-num-ref name="review file to be reviewed from content creator/editor">110,</part-num-ref>
+ a review program <part-num-ref name="review program">400</part-num-ref>
+ may be opened to allow reviewers 116-120 to review content <part-num-ref name="may be opened to allow reviewers 116-120 to review content">212</part-num-ref>
+ so that reviewers 116-120 may provide annotations of content <part-num-ref name="so that reviewers 116-120 may provide annotations of content">212</part-num-ref>
+ based at least in part on a signature of content <part-num-ref name="signature of content">212.</part-num-ref>
+ A unique identifier for a given reviewer may be entered into box <part-num-ref name="given reviewer may be entered into box">410</part-num-ref>
+ which may comprise, for example, the name of the reviewer or similar identifier. Media control buttons <part-num-ref name="reviewer or similar identifier. Media control buttons">412</part-num-ref>
+ may allow a review to play media file <part-num-ref name="review to play media file">214</part-num-ref>
+ so that the reviewer may review selected portions of content <part-num-ref name="reviewer may review selected portions of content">212.</part-num-ref>
+ For example, media control buttons may include a play/pause button, a fast forward button, a rewind button, a jump to beginning button, a jump to end button, a volume <confidence value="222222222222">control/mute</confidence>
+ button, or a loop control button, or similar media controls for controlling the playback of <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+selected portions of content <part-num-ref name="playback of selected portions of content">212,</part-num-ref>
+ although the scope of the claimed subject matter is not limited in this respect. A reviewer may play back media file <part-num-ref name="reviewer may play back media file">214</part-num-ref>
+ to review content <part-num-ref name="to review content">212</part-num-ref>
+ and may pause the playback of media file <part-num-ref name="playback of media file">214</part-num-ref>
+ to allow one or more annotations to be made at the selected point at which the playback is paused. For example, annotations such as text based comments may be entered into box <part-num-ref name="playback is paused. For example, annotations such as text based comments may be entered into box">414.</part-num-ref>
+ As shown in FIG. 4, such an annotation may include the identifier of the review entered into box <part-num-ref name="review entered into box">410</part-num-ref>
+ at point <part-num-ref name="at point">416.</part-num-ref>
+ A signature of content <part-num-ref name="signature of content">212</part-num-ref>
+ at the point at which the annotation is made may be indicated at point <part-num-ref name="annotation is made may be indicated at point">418,</part-num-ref>
+ for example the time value of timeline <part-num-ref name="time value of timeline">210</part-num-ref>
+ at which playback of media file <part-num-ref name="at which playback of media file">214</part-num-ref>
+ is paused. Text comments of the annotation may be indicated at <part-num-ref name="annotation may be indicated at">420.</part-num-ref>
+ A list of one or more of the annotations may be selected using pull down menu <part-num-ref name="annotations may be selected using pull down menu">422.</part-num-ref>
+ In the event that a reviewer uses pull down menu <part-num-ref name="reviewer uses pull down menu">422</part-num-ref>
+ to select an annotation different from the present annotation, review program <part-num-ref name="present annotation, review program">400</part-num-ref>
+ may jump to that portion of content <part-num-ref name="may jump to that portion of content">212</part-num-ref>
+ and display the particular content along with the corresponding selected annotation. In such an arrangement, a reviewer may selectively display <confidence value="2222222222">and.review</confidence>
+ again if desirable previously made annotations, for example where the reviewer reviews content <part-num-ref name="reviewer reviews content">212</part-num-ref>
+ at several review sessions over the course of time. Various other control buttons <part-num-ref name="course of time. Various other control buttons">422</part-num-ref>
+ may be included with review program<confidence value="5">,</confidence>
+ for example to allow graphical annotations, text based annotations, audio based annotations, video based annotations, to save the review file for later reviewing, to edit or delete previously entered annotations, and so on, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-36" num="36">[0028]      Referring now to FIG. 5, an alternate diagram of a program for reviewing and annotating signature based content in accordance with one or more embodiments will be discussed. As shown in FIG. 5, review program <part-num-ref name="program for reviewing and annotating signature based content in accordance with one or more embodiments will be discussed. As shown in FIG. 5, review program">400</part-num-ref>
+ may be run as part of an Adobe Acroba<confidence value="7">t</confidence>
+ program <part-num-ref name="Adobe Acrobat program">510</part-num-ref>
+ or the like that allows annotations to be made to content <part-num-ref name="like that allows annotations to be made to content">212</part-num-ref>
+ using one or more tools of the Adobe Acrobat<confidence value="5">®</confidence>
+ program. Alternatively, review program <part-num-ref name="Adobe Acrobat® program. Alternatively, review program">400</part-num-ref>
+ may be incorporated as part of any suitable program such as a word processor, web browser, or a stand alone reviewing and commenting program, or any other program that allows the review file to be viewed and edited, for example using a plug-in or the like.    </p>
+    <p id="p-37" num="37">Such programs as program 510 may allow for various methods to annotate content <part-num-ref name="may allow for various methods to annotate content">212</part-num-ref>
+ <boundary-data type="header">
+        <confidence value="88">14</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+using tools provided by such program <part-num-ref name="using tools provided by such program">510,</part-num-ref>
+ and may also allow for various alternative views of annotations and other comments either individually or in aggregate such as shown at <part-num-ref name="using tools provided by such program 510, and may also allow for various alternative views of annotations and other comments either individually or in aggregate such as shown at">512</part-num-ref>
+ and which may provide further control of viewing, adding, deleting, sorting, printing or editing annotations made by reviewers 116-120, for example using annotation control buttons <part-num-ref name="and which may provide further control of viewing, adding, deleting, sorting, printing or editing annotations made by reviewers 116-120, for example using annotation control buttons">514,</part-num-ref>
+ although the scope of the claimed subject matter is not limited in this respect. Once one or more reviewers have made annotations to content <part-num-ref name="claimed subject matter is not limited in this respect. Once one or more reviewers have made annotations to content">212,</part-num-ref>
+ the annotations may be saved as an annotation file or the like, and sent back to content creator/editor <part-num-ref name="like, and sent back to content creator/editor">110,</part-num-ref>
+ for example via network <part-num-ref name="like, and sent back to content creator/editor 110, for example via network">112</part-num-ref>
+ such as via an e-mail program, although the scope of the claimed subject matter is not limited in this respect. In one or more embodiments, the annotation file may be generated independent of the content <part-num-ref name="content">212</part-num-ref>
+ or any related media file <part-num-ref name="or any related media file">214.</part-num-ref>
+ In such an arrangement, the annotation file may be sent back to content creator/editor <part-num-ref name="annotation file may be sent back to content creator/editor">110</part-num-ref>
+ without requiring an intervening or controlling sever to control the sending of the annotations or the review file back to content creator/editor <part-num-ref name="review file back to content creator/editor">110.</part-num-ref>
+ Content creator/editor <part-num-ref name="review file back to content creator/editor 110. Content creator/editor">110</part-num-ref>
+ may receive the annotation file from one or more of reviewers 116-120 and then incorporate one or more annotations in aggregate from one or more reviewers 116-120 using the client based content creation and editing software on the local machine of the content creator/editor <part-num-ref name="content creator/editor">110,</part-num-ref>
+ although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-38" num="38">
+      <confidence value="5">[</confidence>
+0029<confidence value="2">]</confidence>
+      Referring now to F<confidence value="5">I</confidence>
+G. 6, a diagram of a program interface for creating and editing signature based content in which reviewed content may be displayed in accordance with one or more embodiments will be discussed.      Once content creator/editor <part-num-ref name="program interface for creating and editing signature based content in which reviewed content may be displayed in accordance with one or more embodiments will be discussed.      Once content creator/editor">110</part-num-ref>
+ receives annotations back from one or more reviewers 116-120, content creation or editing program interface <part-num-ref name="receives annotations back from one or more reviewers 116-120, content creation or editing program interface">200</part-num-ref>
+ may integrate the one or more annotations received from reviewers 116-120 may be integrated with timeline <part-num-ref name="one or more annotations received from reviewers 116-120 may be integrated with timeline">210</part-num-ref>
+ at corresponding time values in timeline <part-num-ref name="at corresponding time values in timeline">210</part-num-ref>
+ where the annotations occur at markers <part-num-ref name="annotations occur at markers">610,</part-num-ref>
+ <part-num-ref name="annotations occur at markers 610,">612,</part-num-ref>
+ <part-num-ref name="annotations occur at markers 610, 612,">614,</part-num-ref>
+ and <part-num-ref name="annotations occur at markers 610, 612, 614, and">616,</part-num-ref>
+ for example. One or more of markers <part-num-ref name="annotations occur at markers 610, 612, 614, and 616, for example. One or more of markers">610,</part-num-ref>
+ <part-num-ref name="annotations occur at markers 610, 612, 614, and 616, for example. One or more of markers 610,">612,</part-num-ref>
+ <part-num-ref name="annotations occur at markers 610, 612, 614, and 616, for example. One or more of markers 610, 612,">614,</part-num-ref>
+ or <part-num-ref name="annotations occur at markers 610, 612, 614, and 616, for example. One or more of markers 610, 612, 614, or">616</part-num-ref>
+ may be, for example, a <confidence value="22222222">metadata</confidence>
+ tag that includes information about the annotation for the associated marker. Content creating or editing program interface <part-num-ref name="associated marker. Content creating or editing program interface">200</part-num-ref>
+ may display the time location of markers 610-616 on timeline <part-num-ref name="time location of markers 610-616 on timeline">210</part-num-ref>
+ to provide a visual indication to <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+content creator/editor <part-num-ref name="visual indication to content creator/editor">100</part-num-ref>
+ where markers 610-616 occur on timeline <part-num-ref name="where markers 610-616 occur on timeline">210</part-num-ref>
+ and relative to one another in aggregation. When annotations of content <part-num-ref name="and relative to one another in aggregation. When annotations of content">212</part-num-ref>
+ are received from reviewers 116-120 and integrated with ti<confidence value="8">m</confidence>
+eline <part-num-ref name="are received from reviewers 116-120 and integrated with timeline">210,</part-num-ref>
+ content creation or editing program interface <part-num-ref name="are received from reviewers 116-120 and integrated with timeline 210, content creation or editing program interface">200</part-num-ref>
+ may allow media file <part-num-ref name="may allow media file">214</part-num-ref>
+ to be played back to content creator/editor <part-num-ref name="to be played back to content creator/editor">110</part-num-ref>
+ so that annotations may be displayed and viewed by content creator/editor <part-num-ref name="so that annotations may be displayed and viewed by content creator/editor">110</part-num-ref>
+ when the signatures corresponding to the annotations occur, for example at the time values of markers 610-616. A marker <part-num-ref name="marker">618</part-num-ref>
+ may indicate the present time of the currently viewed content <part-num-ref name="currently viewed content">212</part-num-ref>
+ during playback of media file <part-num-ref name="during playback of media file">214,</part-num-ref>
+ where marker <part-num-ref name="during playback of media file 214, where marker">618</part-num-ref>
+ may move past timeline <part-num-ref name="may move past timeline">210</part-num-ref>
+ as the content <part-num-ref name="content">212</part-num-ref>
+ is viewed over time. When marker <part-num-ref name="is viewed over time. When marker">618</part-num-ref>
+ coincides with at least one of markers 610-616, the annotation corresponding to the current one of markers <confidence value="8">6</confidence>
+10-616 may appear, for example in marker dialog box <part-num-ref name="current one of markers 610-616 may appear, for example in marker dialog box">620.</part-num-ref>
+  In one or more embodiments, marker dialog box <part-num-ref name="current one of markers 610-616 may appear, for example in marker dialog box 620.  In one or more embodiments, marker dialog box">620</part-num-ref>
+ may display one or more of the annotations corresponding to the present marker, which in the example shown in FIG. 6 is marker <part-num-ref name="is marker">616.</part-num-ref>
+ For example, text <confidence value="222222222">conunents</confidence>
+ on content <part-num-ref name="is marker 616. For example, text conunents on content">212</part-num-ref>
+ may be displayed in box <part-num-ref name="may be displayed in box">622.</part-num-ref>
+    </p>
+    <p id="p-39" num="39">Furthermore, other additional annotations may be displayed or otherwise indicated. For example, where a reviewer had provided a graphical annotation directly on content <part-num-ref name="graphical annotation directly on content">212</part-num-ref>
+ such as by using a drawing program during review, such graphical annotation may be displayed concurrently with content <part-num-ref name="drawing program during review, such graphical annotation may be displayed concurrently with content">212,</part-num-ref>
+ for example with the graphical annotation overlaid on the content <part-num-ref name="content">212.</part-num-ref>
+ In addition, audio and/or video annotations may be played at this point when provided. Comment dialog box <part-num-ref name="content 212. In addition, audio and/or video annotations may be played at this point when provided. Comment dialog box">620</part-num-ref>
+ may display comments for a predetermined duration, which may be set by a reviewer or set by content creator/editor <part-num-ref name="reviewer or set by content creator/editor">
+        <confidence value="8">1</confidence>
+10.      </part-num-ref>
+ Such a duration may be indicated at <part-num-ref name="duration may be indicated at">624.</part-num-ref>
+ Additional marker options may be set as well, for example an indication of a chapter for content <part-num-ref name="chapter for content">212</part-num-ref>
+ in box <part-num-ref name="in box">626,</part-num-ref>
+ a link to a web site where additional information may be stored may be provided in box <part-num-ref name="web site where additional information may be stored may be provided in box">628,</part-num-ref>
+ or a frame target may be provided in box <part-num-ref name="frame target may be provided in box">630.</part-num-ref>
+    </p>
+    <p id="p-40" num="40">
+      <confidence value="588885">100301</confidence>
+      Marker dialog box 620 may include various buttons to control the corresponding marker <part-num-ref name="corresponding marker">616.</part-num-ref>
+ For example, an "OK" button <part-num-ref name="&quot;OK&quot; button">632</part-num-ref>
+ may be utilized to accept any changes made to the attributes of marker <part-num-ref name="attributes of marker">616,</part-num-ref>
+ or a "Cancel" button <part-num-ref name="&quot;Cancel&quot; button">634</part-num-ref>
+ may be utilized to reject any changes made to marker <part-num-ref name="may be utilized to reject any changes made to marker">616.</part-num-ref>
+ A "Pre<confidence value="4">y</confidence>
+" button <part-num-ref name="&quot;Prey&quot; button">636</part-num-ref>
+ may be utilized <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+to jump back in timeline <part-num-ref name="may be utilized to jump back in timeline">210</part-num-ref>
+ to the previous marker <part-num-ref name="previous marker">614,</part-num-ref>
+ and a "Next" button <part-num-ref name="&quot;Next&quot; button">638</part-num-ref>
+ may be utilized to jump forward in timeline <part-num-ref name="may be utilized to jump forward in timeline">210</part-num-ref>
+ to the subsequent marker (not shown) in timeline <part-num-ref name="subsequent marker (not shown) in timeline">210.</part-num-ref>
+ By using such buttons <part-num-ref name="subsequent marker (not shown) in timeline 210. By using such buttons">636</part-num-ref>
+ and <part-num-ref name="and">638,</part-num-ref>
+ content creator/editor <part-num-ref name="and 638, content creator/editor">
+        <confidence value="5">1</confidence>
+10      </part-num-ref>
+ may jump around timeline <part-num-ref name="may jump around timeline">210</part-num-ref>
+ and view the annotations of selected markers 610-616 without waiting for the linear passage of time for marker <part-num-ref name="linear passage of time for marker">618</part-num-ref>
+ to coincide with a desired one or markers 610- <part-num-ref name="desired one or markers 610-">616,</part-num-ref>
+ and without waiting for the duration of the display of the markers as indicated at <part-num-ref name="markers as indicated at">624.</part-num-ref>
+ Optionally, content creator/editor <part-num-ref name="markers as indicated at 624. Optionally, content creator/editor">110</part-num-ref>
+ may delete the maker currently displayed in marker dialog box <part-num-ref name="maker currently displayed in marker dialog box">620</part-num-ref>
+ via "Delete" button <part-num-ref name="via &quot;Delete&quot; button">640.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">[0031<confidence value="5">]</confidence>
+      Referring now to FIG. 7, a diagram of an annotation map showing the integration of the comments of multiple reviewers with a timeline of timeline based media content in accordance with one or more embodiments will be discussed. In one or more embodiments, the signature of content <part-num-ref name="signature of content">212</part-num-ref>
+ correlating to annotations made by one or more reviewers 116-120 may comprise timeline based, at least in part. In such embodiments, an annotation map <part-num-ref name="annotation map">700</part-num-ref>
+ may indicate the aggregation of one or more annotations from one or more reviewers 116-120 with respect to timeline <part-num-ref name="aggregation of one or more annotations from one or more reviewers 116-120 with respect to timeline">714.</part-num-ref>
+ Reviewers <part-num-ref name="aggregation of one or more annotations from one or more reviewers 116-120 with respect to timeline 714. Reviewers">116,</part-num-ref>
+ <part-num-ref name="aggregation of one or more annotations from one or more reviewers 116-120 with respect to timeline 714. Reviewers 116,">118,</part-num-ref>
+ and <part-num-ref name="aggregation of one or more annotations from one or more reviewers 116-120 with respect to timeline 714. Reviewers 116, 118, and">120</part-num-ref>
+ may be indicated on an ordinate axis <part-num-ref name="ordinate axis">710</part-num-ref>
+ of annotation map <part-num-ref name="of annotation map">700,</part-num-ref>
+ and time may be indicated on an abscissa axis <part-num-ref name="abscissa axis">712.</part-num-ref>
+ A timeline <part-num-ref name="timeline">714</part-num-ref>
+ may indicate time values of content <part-num-ref name="may indicate time values of content">212,</part-num-ref>
+ and annotations <part-num-ref name="may indicate time values of content 212, and annotations">716,</part-num-ref>
+ <part-num-ref name="may indicate time values of content 212, and annotations 716,">718,</part-num-ref>
+ <part-num-ref name="may indicate time values of content 212, and annotations 716, 718,">720,</part-num-ref>
+ and <part-num-ref name="may indicate time values of content 212, and annotations 716, 718, 720, and">724</part-num-ref>
+ may be indicated at corresponding time values in timeline <part-num-ref name="may be indicated at corresponding time values in timeline">714</part-num-ref>
+ when provided by a reviewer.  Such annotations may correspond conceptually to markers 610-616 as shown in FIG. 6, and timeline <part-num-ref name="reviewer.  Such annotations may correspond conceptually to markers 610-616 as shown in FIG. 6, and timeline">714</part-num-ref>
+ may correspond conceptually to timeline <part-num-ref name="may correspond conceptually to timeline">210</part-num-ref>
+ as shown in FIG. 6. For example, a first annotation <part-num-ref name="first annotation">716</part-num-ref>
+ may include information that indicates the annotation is from a first reviewer <part-num-ref name="first reviewer">116,</part-num-ref>
+ and includes the first reviewer's first comment at a first time value. A second annotation <part-num-ref name="second annotation">718</part-num-ref>
+ <confidence value="5">m</confidence>
+ay include information that indicates the annotation is from a second reviewer <part-num-ref name="second reviewer">118,</part-num-ref>
+ and includes the second reviewer's first comment at a second time value. A third annotation <part-num-ref name="third annotation">718</part-num-ref>
+ may include information that indicates the annotation is from the second reviewer <part-num-ref name="second reviewer">118,</part-num-ref>
+ and includes the second reviewer's second comment at a third time value. A fourth annotation <part-num-ref name="fourth annotation">720</part-num-ref>
+ may include information that indicates the annotation is from the first reviewer <part-num-ref name="first reviewer">116,</part-num-ref>
+ and includes the first reviewer's <boundary-data type="header">
+        <confidence value="88">17</confidence>
+      </boundary-data>
+      <page-break num="19"/>
+second comment at a fourth time value. An Nth annotation <part-num-ref name="Nth annotation">724</part-num-ref>
+ may include information that indicates that the annotation is f<confidence value="8">r</confidence>
+om an Nth reviewer, and includes the Nth reviewer's Nth comment at an Nth time value. In one embodiment, such annotations 716-724 may comprise metadata tags correlated to the annotations provided by reviewers 116-120, and annotation map <part-num-ref name="annotations provided by reviewers 116-120, and annotation map">700</part-num-ref>
+ may be utilized by content creation or editing program interface <part-num-ref name="may be utilized by content creation or editing program interface">200</part-num-ref>
+ in aggregating one or more comments from one or more reviewers 116-120, although the scope of the claimed subject <confidence value="8">m</confidence>
+atter is not limited in this respect.    </p>
+    <p id="p-42" num="42">
+      <confidence value="5">[</confidence>
+0032<confidence value="2">1</confidence>
+      Referring now to FIG. 8, a flow diagram of a method for creating a signature for signature based media content and for exporting a review file for a reviewer of the content in accordance with one or more embodiments will be discussed. The method <part-num-ref name="method">800</part-num-ref>
+ may be implemented in general by content creator/editor <part-num-ref name="may be implemented in general by content creator/editor">110</part-num-ref>
+ using content creation or editing program interface <part-num-ref name="using content creation or editing program interface">200</part-num-ref>
+ as described herein, although the scope of the claimed subject matter is not limited in this respect. A project <part-num-ref name="project">220</part-num-ref>
+ having content <part-num-ref name="having content">212</part-num-ref>
+ to be reviewed by one or more reviewers 116-120 may be generated at block <part-num-ref name="to be reviewed by one or more reviewers 116-120 may be generated at block">810,</part-num-ref>
+ and a timeline <part-num-ref name="timeline">210</part-num-ref>
+ for project <part-num-ref name="for project">220</part-num-ref>
+ may be generated at block <part-num-ref name="may be generated at block">812.</part-num-ref>
+ A review filed may then be exported at block <part-num-ref name="review filed may then be exported at block">814</part-num-ref>
+ where the review file may include timeline <part-num-ref name="review file may include timeline">210,</part-num-ref>
+ and the review file may be sent to one or more reviewers 116-120 at block <part-num-ref name="review file may be sent to one or more reviewers 116-120 at block">816.</part-num-ref>
+ After reviewers 116-120 have reviewed content <part-num-ref name="review file may be sent to one or more reviewers 116-120 at block 816. After reviewers 116-120 have reviewed content">212</part-num-ref>
+ with respect to timeline <part-num-ref name="with respect to timeline">210,</part-num-ref>
+ generated annotations of content <part-num-ref name="with respect to timeline 210, generated annotations of content">212,</part-num-ref>
+ and stored the annotations in an annotation file, the comments in the annotation file may be received from reviewers 116-120 at block <part-num-ref name="annotation file may be received from reviewers 116-120 at block">818,</part-num-ref>
+ and the comments may be integrated with ti<confidence value="8">m</confidence>
+eline <part-num-ref name="comments may be integrated with timeline">210</part-num-ref>
+ of project <part-num-ref name="of project">220</part-num-ref>
+ at block <part-num-ref name="at block">820.</part-num-ref>
+ Content creator/editor <part-num-ref name="at block 820. Content creator/editor">110</part-num-ref>
+ may selectively display one or more of comments or other annotations in project <part-num-ref name="may selectively display one or more of comments or other annotations in project">220</part-num-ref>
+ on timeline <part-num-ref name="on timeline">210</part-num-ref>
+ at block <part-num-ref name="at block">822,</part-num-ref>
+ and content creator/editor <part-num-ref name="at block 822, and content creator/editor">110</part-num-ref>
+ may selectively edit project <part-num-ref name="may selectively edit project">214</part-num-ref>
+ and content <part-num-ref name="and content">212</part-num-ref>
+ at block <part-num-ref name="at block">824</part-num-ref>
+ based at least in part on one or more of the comments or annotations of content <part-num-ref name="comments or annotations of content">212</part-num-ref>
+ provided by one or more of reviewers 116-120, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <boundary-data type="header">
+      <confidence value="88">18</confidence>
+    </boundary-data>
+    <p id="p-43" num="43">
+      <page-break num="20"/>
+      <confidence value="5">[</confidence>
+0033<confidence value="2">1</confidence>
+      Referring now to FIG. 9, a flow diagram of a method for reviewing and annotating signature based content in accordance with one or more embodiments will be discussed. The method <part-num-ref name="method">900</part-num-ref>
+ may be implemented by one or more of reviewers 116-120 using review program <part-num-ref name="may be implemented by one or more of reviewers 116-120 using review program">400</part-num-ref>
+ as shown in and described with respect to FIGS. 4 and <part-num-ref name="and">5,</part-num-ref>
+ although the scope of the claimed subject matter is not limited in this respect. One or more reviewers 116-120 may receive a review request to review content <part-num-ref name="review request to review content">212</part-num-ref>
+ of a project <part-num-ref name="project">220</part-num-ref>
+ at block <part-num-ref name="at block">910</part-num-ref>
+ from a content creator/editor <part-num-ref name="content creator/editor">110.</part-num-ref>
+ A reviewer may play a media file <part-num-ref name="media file">214</part-num-ref>
+ containing content <part-num-ref name="containing content">212</part-num-ref>
+ at block <part-num-ref name="at block">912,</part-num-ref>
+ or alternatively may stream media file <part-num-ref name="at block 912, or alternatively may stream media file">214</part-num-ref>
+ containing content <part-num-ref name="containing content">212</part-num-ref>
+ at block <part-num-ref name="at block">912</part-num-ref>
+ from a location or server at which media file <part-num-ref name="location or server at which media file">214</part-num-ref>
+ may be stored<confidence value="5">.</confidence>
+ Reviewers 116-120 may provide comments or other annotations on content <part-num-ref name="may be stored. Reviewers 116-120 may provide comments or other annotations on content">212,</part-num-ref>
+ for example with respect to a signature of content <part-num-ref name="signature of content">212</part-num-ref>
+ such as timeline <part-num-ref name="such as timeline">210,</part-num-ref>
+ and then create one or more metadata tags <part-num-ref name="such as timeline 210, and then create one or more metadata tags">914</part-num-ref>
+ on such comments or annotations at block <part-num-ref name="on such comments or annotations at block">914</part-num-ref>
+ that correlate with the signature of content <part-num-ref name="signature of content">212</part-num-ref>
+ at which the comment or annotation is made, for example a time value in timeline <part-num-ref name="time value in timeline">210.</part-num-ref>
+ Comments and metadata tags may be added to timeline <part-num-ref name="time value in timeline 210. Comments and metadata tags may be added to timeline">210</part-num-ref>
+ at respective time values at block <part-num-ref name="at respective time values at block">916</part-num-ref>
+ and saved to a comment file at block <part-num-ref name="comment file at block">918.</part-num-ref>
+ The comment file including the comments, annotations, or metadata tags may be saved independent of content <part-num-ref name="comments, annotations, or metadata tags may be saved independent of content">212</part-num-ref>
+ and sent back to content creator/editor <part-num-ref name="and sent back to content creator/editor">110</part-num-ref>
+ at block <part-num-ref name="at block">920</part-num-ref>
+ so that content creator/editor <part-num-ref name="so that content creator/editor">110</part-num-ref>
+ may view the comments, annotations, or metadata tags and selectively edit or change content based at least in part on the comments, annotations, or metadata tags, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-44" num="44">
+      <confidence value="5">[</confidence>
+0034<confidence value="4">]</confidence>
+      Referring now to FIG. 10, a block diagram of a computing platform suitable for running a program to create and edit timeline based media content and for reviewing timeline based media content in accordance with one or more embodiments will be discussed. The computing platform <part-num-ref name="computing platform">1000</part-num-ref>
+ shown in FIG. 10 may comprise, for example, any one or more of content creator/editor <part-num-ref name="may comprise, for example, any one or more of content creator/editor">110,</part-num-ref>
+ network <part-num-ref name="may comprise, for example, any one or more of content creator/editor 110, network">112,</part-num-ref>
+ media server <part-num-ref name="may comprise, for example, any one or more of content creator/editor 110, network 112, media server">114,</part-num-ref>
+ or reviewer <part-num-ref name="may comprise, for example, any one or more of content creator/editor 110, network 112, media server 114, or reviewer">1,</part-num-ref>
+ reviewer <part-num-ref name="may comprise, for example, any one or more of content creator/editor 110, network 112, media server 114, or reviewer 1, reviewer">2,</part-num-ref>
+ or reviewer N as shown in FIG. 1, although the scope of the claimed subject matter is not limited in this respect. Computing platform <part-num-ref name="claimed subject matter is not limited in this respect. Computing platform">1000</part-num-ref>
+ may include a processor <part-num-ref name="processor">1010</part-num-ref>
+ coupled to a cache random access memory (RAM) <part-num-ref name="cache random access memory (RAM)">1012</part-num-ref>
+ via a <boundary-data type="header">
+        <confidence value="88">19</confidence>
+      </boundary-data>
+      <page-break num="21"/>
+back side bus <part-num-ref name="back side bus">1011.</part-num-ref>
+ Processor <part-num-ref name="back side bus 1011. Processor">1010</part-num-ref>
+ may also couple to a chipset that includes a Northbridge chip <part-num-ref name="Northbridge chip">1016</part-num-ref>
+ via a front side bus <part-num-ref name="front side bus">1014,</part-num-ref>
+ and also to a Southbridge chip <part-num-ref name="Southbridge chip">
+        <confidence value="5">1</confidence>
+018      </part-num-ref>
+ via bus <part-num-ref name="via bus">1020.</part-num-ref>
+ In one embodiment, the Northbridge chip <part-num-ref name="Northbridge chip">1016</part-num-ref>
+ in general may be utilized to connect a processor to memory, to an input/output bus, to a video bus, and to Level <part-num-ref name="video bus, and to Level">2</part-num-ref>
+ cache, although the scope of the claimed subject matter is not limited in this respect. In one embodiment, the Southbridge chip <part-num-ref name="Southbridge chip">1018</part-num-ref>
+ may be utilized to control input/output functions, the basic input/out system (BIOS), an interrupt control functions of Integrated Drive Electronics (IDE) devices such as hard disks or compact disk-read only memory (CD-ROM) devices or the like, although the scope of the claimed subject matter is not limited in this respect. A random access memory (RAM) <part-num-ref name="random access memory (RAM)">1022</part-num-ref>
+ may couple to the Northbridge chip <part-num-ref name="Northbridge chip">1016</part-num-ref>
+ via a main memory bus <part-num-ref name="main memory bus">1024,</part-num-ref>
+ and an input/output (<confidence value="685">1/0</confidence>
+) controller <part-num-ref name="input/output (1/0) controller">1026</part-num-ref>
+ may also couple to Northbridge chip <part-num-ref name="may also couple to Northbridge chip">1016</part-num-ref>
+ via <confidence value="555">1/0</confidence>
+ bus <part-num-ref name="via 1/0 bus">1028.</part-num-ref>
+ In one embodiment, <confidence value="685">I/O</confidence>
+ controller <part-num-ref name="via 1/0 bus 1028. In one embodiment, I/O controller">1026</part-num-ref>
+ and <confidence value="555">1/0</confidence>
+ bus <part-num-ref name="and 1/0 bus">1028</part-num-ref>
+ may be in compliance with a Small Computer Systems Interface (SCSI) specification such as the American National Standards Institute (ANSI) X3.131-1994 SCSI-2 specification, although the scope of the claimed subject matter is not limited in this respect. In an alternative embodiment, <confidence value="686">I/O</confidence>
+ controller <part-num-ref name="alternative embodiment, I/O controller">1026</part-num-ref>
+ and <confidence value="665">I/O</confidence>
+ bus <part-num-ref name="and I/O bus">1028</part-num-ref>
+ may be in compliance with a Peripheral Component Interconnect (PCI) bus, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-45" num="45">
+      <confidence value="885885">[00351</confidence>
+      A video controller <part-num-ref name="video controller">1030</part-num-ref>
+ may couple to the Northbridge chip <part-num-ref name="Northbridge chip">1016</part-num-ref>
+ via a video bus <part-num-ref name="video bus">1032</part-num-ref>
+ which in one embodiment may comprise an Accelerated Graphics Port (AGP) bus, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-46" num="46">Video controller 1030 may provide video signals to a display <part-num-ref name="display">1034</part-num-ref>
+ via a display interface <part-num-ref name="display interface">1036</part-num-ref>
+ which in one embodiment may comprise a Digital Visual Interface (DVI) in compliance with a standard promulgated by the Digital Display Working Group, although the scope of the claimed subject matter is not limited in this respect. The Southbridge chip <part-num-ref name="Southbridge chip">1018</part-num-ref>
+ may couple to a peripheral component interconnect to peripheral component interconnect (PCI-PCI) bridge via input/output bus <part-num-ref name="peripheral component interconnect to peripheral component interconnect (PCI-PCI) bridge via input/output bus">1040,</part-num-ref>
+ which may in turn couple to an <confidence value="685">I/O</confidence>
+ controller <part-num-ref name="I/O controller">1042</part-num-ref>
+ to control various peripheral devices such as Universal Serial Bus (USB) devices, or devices compatible with a Institute of Electrical and Electronics <boundary-data type="header">
+        <confidence value="88">20</confidence>
+      </boundary-data>
+      <page-break num="22"/>
+Engineers (IEEE) <part-num-ref name="Institute of Electrical and Electronics Engineers (IEEE)">1394</part-num-ref>
+ specification, although the scope of the claimed subject matter is not limited in this respect.    </p>
+    <p id="p-47" num="47">
+      <confidence value="5">[</confidence>
+0036<confidence value="5">1</confidence>
+      Although the claimed subject matter has been described with a certain degree of particularity, it should be recognized that elements thereof may be altered by persons skilled in the art without departing from the spirit and scope of the claimed subject matter. It is believed that the review of signature based content and many of its attendant advantages will be understood by the forgoing description, and it will be apparent that various changes may be made in the form, construction and arrangement of the components thereof without departing from the scope and spirit of the claimed subject matter or without sacrificing all of its material advantages, the form herein before described being merely an explanatory embodiment thereof, and further without providing substantial change thereto. It is the intention of the claims to encompass and include such changes.    </p>
+    <boundary-data type="header">
+      <confidence value="88">21</confidence>
+    </boundary-data>
+    <p id="p-48" num="48">
+      <page-break num="23"/>
+This Page is Inserted by IFW Indexing and Scanning Operations and is not part of the Official Record     </p>
+    <heading id="h-8">BEST AVAILABLE IMAGES</heading>
+    <p id="p-49" num="49">Defective images within this document are accurate representations of the original documents submitted by the applicant.</p>
+    <p id="p-50" num="50">Defects in the images include but are not limited to the items checked:</p>
+    <p id="p-51" num="51">
+      <confidence value="1125">'6BA</confidence>
+CK BORDERS     </p>
+    <heading id="h-9">
+      <confidence value="5">Q</confidence>
+ IMAGE CUT OFF AT TOP, BOTTOM OR SIDES    </heading>
+    <p id="p-52" num="52">
+      <confidence value="1111">L]1-</confidence>
+ <confidence value="2222222">DEDTEXT</confidence>
+ OR DRAWING     </p>
+    <heading id="h-10">
+      <confidence value="5">Q</confidence>
+ BLURRED OR ILLEGIBLE TEXT OR DRAWING    </heading>
+    <heading id="h-11">
+      <confidence value="5">Q</confidence>
+ SKEWED/SLANTED IMAGES    </heading>
+    <heading id="h-12">
+      <confidence value="4">Q</confidence>
+ COLOR OR BLACK AND WHITE PHOTOGRAPHS    </heading>
+    <heading id="h-13">
+      <confidence value="5">Q</confidence>
+ GRAY SCALE DOCUMENTS    </heading>
+    <heading id="h-14">
+      <confidence value="5">Q</confidence>
+ LINES OR MARKS ON ORIGINAL DOCUMENT    </heading>
+    <heading id="h-15">
+      <confidence value="5">Q</confidence>
+ REFERENCE(S) OR EXHIBIT(S) SUBMITTED ARE POOR QUALITY    </heading>
+    <heading id="h-16">
+      <confidence value="5">Q</confidence>
+ OTHER:    </heading>
+    <heading id="h-17">IMAGES ARE BEST AVAILABLE COPY.</heading>
+    <p id="p-53" num="53">As rescanning these documents will not correct the image problems checked, please do not report these problems to the IFW Image Problem Mailbox.</p>
+  </description>
+</us-patent-application>
+

applicant/11513357.xml

@@ -0,0 +1,25 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11513357</doc-number>
+        <date>2009-12-09</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">
+      <confidence value="88">-2</confidence>
+-                             RYAN et al.    </p>
+    <p id="p-2" num="2">App<confidence value="7">l</confidence>
+e. No. <confidence value="5">1</confidence>
+1/513,357 Amendments to the Specification Please replace the "Abstract of the Invention" paragraph with the following:    </p>
+    <p id="p-3" num="3">A computer system includes <confidence value="4222666666">a-computer</confidence>
+ <confidence value="52565266626">ystem-havig</confidence>
+ a system memory and a bridging device coupled to the system memory, the bridging device including a memory controller. The computer system also includes a graphics processor unit (GPU) coupled to one port of the bridging device and a central processing unit (CPU) coupled to another port of the bridging device. The GPU and the CPU access the system memory via the memory controller.<confidence value="66">[[</confidence>
+.]] Atty. Docket No. 1972.0280000     </p>
+  </description>
+</us-patent-application>
+

applicant/11528627.xml

@@ -0,0 +1,467 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11528627</doc-number>
+        <date>2006-09-28</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">P-9044-US</boundary-data>
+    <heading id="h-1">SYSTEM AND METHOD FOR AN IN-V<confidence value="5">I</confidence>
+VO IMAGING DEVICE WITH AN ANGLED    </heading>
+    <heading id="h-2">FIELD OF VIEW</heading>
+    <heading id="h-3">FIELD OF T<confidence value="5">H</confidence>
+E INVENTION    </heading>
+    <p id="p-1" num="1">The present invention relates to a system and method for in-vivo imaging.</p>
+    <heading id="h-4">BACKGROUND OF T<confidence value="5">H</confidence>
+E INVENTION    </heading>
+    <p id="p-2" num="2">In-vivo imaging devices, such as, for example, capsules, may be capable of collecting images of a body lumen while inside the body lumen. Such information may be, for example, a stream of image data or image frames from the body lumen and/or measurements of parameters that are medically useful, such as, for example, pH, temperature, etc. The imaging device may transmit the collected data via a hard-wired or wireless medium, and the collected data may be received by a receiving unit. The received information may be sent from the receiving unit to a workstation to be analyzed and/or displayed. Such a system may be operated by, for example, health care professionals and technicians, in a hospital, or another health facility.</p>
+    <p id="p-3" num="3">
+      <confidence value="2222222222">Regions.of</confidence>
+ a body lumen, such as a region referred to as a "z-line", shown in Fig. 5, may have irregularly curved shapes relative to the trajectory of the imaging device moving through the region. A need exists for imaging devices that may image regions of a body lumen which may be obscured from the field of view of the imaging device.    </p>
+    <heading id="h-5">SUMMARY OF THE INVENTION</heading>
+    <p id="p-4" num="4">An exemplary embodiment of the present invention provides a system and method for imaging a body lumen using an in-vivo imaging device, for example, shaped as a capsule.</p>
+    <p id="p-5" num="5">According to one embodiment of the present invention the in-vivo imaging device may have a centerline, where the center of gravity of the device is displaced from the centerline, and the centerline has a radius of curvature. Another embodiment of the present invention provides a system and method for imaging a body lumen using a device with a centerline, where the center of gravity of the device is displaced from the centerline. According to some embodiments of the present invention the device may include at least two i<confidence value="7">m</confidence>
+agers positioned on opposite ends of the device, and the fields of view of the imagers have respective center lines that intersect.    </p>
+    <heading id="h-6">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-6" num="6">Embodiments of the invention are illustrated by way of example and not limitation in the figures of the accompanying dra<confidence value="8">w</confidence>
+ings, in which like reference numerals indicate corresponding, analogous or similar elements, and in which:    </p>
+    <p id="p-7" num="7">Fig. <confidence value="4">I</confidence>
+ is a schematic illustration of an exemplary in-<confidence value="5">v</confidence>
+ivo imaging system, including an in-vivo imaging device, a receiving unit and a workstation, in accordance with some embodiments of the invention;    </p>
+    <boundary-data type="header">P-9044-US</boundary-data>
+    <p id="p-8" num="8">
+      <page-break num="2"/>
+Fig. 2 is a schematic illustration of an in-vivo imaging device, in accordance with an embodiment of the invention;    </p>
+    <p id="p-9" num="9">Fig. 3 is a schematic illustration of an in-vivo imaging device, in accordance with an embodiment of the invention;</p>
+    <p id="p-10" num="10">Fig. 4 depicts a series of steps for adapting the shape of an imaging device, in accordance with an embodiment of the present invention; and Fig. 5 is a schematic illustration of an in-vivo imaging device in the Inferior Esophageal Sphincter, in accordance with an embodiment of the invention.</p>
+    <p id="p-11" num="11">It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity.</p>
+    <heading id="h-7">DETAILED DESCRIPTION OF THE INVENTION</heading>
+    <p id="p-12" num="12">In the following detailed description, numerous specific details are set forth in order to provide<confidence value="6686">..a.</confidence>
+thorough understanding of embodiments of the invention. However it will<confidence value="5">.</confidence>
+ be understood by those of ordinary ski<confidence value="8">l</confidence>
+l in the art that the embodiments of the invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the embodiments of the invention.    </p>
+    <p id="p-13" num="13">Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions utilizing terms such as "processing," "computing," "calculating," "determining," or the like, refer to the action and/or processes of a workstation, or similar electronic computing device, that manipulates and/or transforms data represented as physical, such as electronic, quantities within the computing system's registers and/or memories into other data similarly represented as physical quantities within the computing system's memories, registers or other such information storage, transmission or display devices.</p>
+    <p id="p-14" num="14">A system according to some embodiments of the invention may include an in-vivo imaging device that generates image data that relates to an image, a frame or a stream of images or frames. A transmitter, for example, in the imaging device, may transmit the image data to areas external to the imaging device. A receiving unit, external to the imaging device, which may be positioned close to or worn on a subject, may receive streams of data transmitted by the transmitter in the imaging device. A workstation may accept, process and/or display the data from the receiving unit, which may include image data and/or data stored in memory areas. A workstation may download or access the stream of data from the receiving unit and may analyze <boundary-data type="header">
+        <confidence value="888">-2-</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+and/or display the stream of data. In one embodiment, the workstation may download, store, use or display the stream of image data separately from the stream of memory data<confidence value="5">.</confidence>
+    </p>
+    <p id="p-15" num="15">Devices according to embodiments of the present invention may be similar to embodiments described in United States Patent Number 7,009,634 to Iddan et al., entitled "Device for In-Vivo Imaging", and/or in United States Patent Number 5,604,531 to Iddan et al., entitled "<confidence value="5">I</confidence>
+n-Vivo Video Camera System", and/or in United States Patent Application Number 10/046,541, filed on January <part-num-ref name="present invention may be similar to embodiments described in United States Patent Number 7,009,634 to Iddan et al., entitled &quot;Device for In-Vivo Imaging&quot;, and/or in United States Patent Number 5,604,531 to Iddan et al., entitled &quot;In-Vivo Video Camera System&quot;, and/or in United States Patent Application Number 10/046,541, filed on January">16,</part-num-ref>
+ <part-num-ref name="present invention may be similar to embodiments described in United States Patent Number 7,009,634 to Iddan et al., entitled &quot;Device for In-Vivo Imaging&quot;, and/or in United States Patent Number 5,604,531 to Iddan et al., entitled &quot;In-Vivo Video Camera System&quot;, and/or in United States Patent Application Number 10/046,541, filed on January 16,">2002,</part-num-ref>
+ published on August <part-num-ref name="present invention may be similar to embodiments described in United States Patent Number 7,009,634 to Iddan et al., entitled &quot;Device for In-Vivo Imaging&quot;, and/or in United States Patent Number 5,604,531 to Iddan et al., entitled &quot;In-Vivo Video Camera System&quot;, and/or in United States Patent Application Number 10/046,541, filed on January 16, 2002, published on August">15,</part-num-ref>
+ <part-num-ref name="present invention may be similar to embodiments described in United States Patent Number 7,009,634 to Iddan et al., entitled &quot;Device for In-Vivo Imaging&quot;, and/or in United States Patent Number 5,604,531 to Iddan et al., entitled &quot;In-Vivo Video Camera System&quot;, and/or in United States Patent Application Number 10/046,541, filed on January 16, 2002, published on August 15,">2002</part-num-ref>
+ as United States Patent Application Publication Number 2002/0109774, all of which are hereby incorporated by reference. An external receiving unit, a processor and a workstation, such as those described in the above publications, may be suitable for use with some embodiments of the present invention. Devices and systems as described herein may have other configurations and/or other sets of components. For example, some embodiments of the present invention may be practiced using an endoscope, needle, stent, catheter, etc. In-vivo devices,<confidence value="4">,</confidence>
+ according to. <confidence value="2222222222222222">some.embodiments</confidence>
+, may be capsule shaped, or may have other shapes, for example, a banana shape, a peanut shape or tubular, spherical, conical, or other suitable shapes or may have an adaptive shape as described herein. In some embodiments the imaging device body may have a radius of curvature.    </p>
+    <p id="p-16" num="16">Reference is made to Fig. 1, which is a simplified illustration of an exemplary in-vivo imaging system <part-num-ref name="exemplary in-vivo imaging system">2,</part-num-ref>
+ including an in-vivo imaging device <part-num-ref name="in-vivo imaging device">4,</part-num-ref>
+ a receiving unit <part-num-ref name="receiving unit">6,</part-num-ref>
+ and a workstation <part-num-ref name="workstation">8,</part-num-ref>
+ in accordance with an embodiment of the invention.    </p>
+    <p id="p-17" num="17">Workstation 8 may include a display unit <part-num-ref name="display unit">14,</part-num-ref>
+ a processor <part-num-ref name="processor">16,</part-num-ref>
+ and a memory <part-num-ref name="memory">18.</part-num-ref>
+    </p>
+    <p id="p-18" num="18">Workstation 8 may accept, process and/or display image data received from receiving unit <part-num-ref name="may accept, process and/or display image data received from receiving unit">6.</part-num-ref>
+    </p>
+    <p id="p-19" num="19">Receiving unit 6 may include an antenna <part-num-ref name="antenna">66,</part-num-ref>
+ a receiver <part-num-ref name="receiver">68</part-num-ref>
+ and/or a transmitter <part-num-ref name="transmitter">70,</part-num-ref>
+ a processor <part-num-ref name="processor">72,</part-num-ref>
+ a memory <part-num-ref name="memory">74,</part-num-ref>
+ and a power source <part-num-ref name="power source">76.</part-num-ref>
+ Processor <part-num-ref name="power source 76. Processor">72</part-num-ref>
+ may control, at least in part, the operations of receiving unit <part-num-ref name="operations of receiving unit">6.</part-num-ref>
+ According to some embodiment of the present invention, imaging device <part-num-ref name="present invention, imaging device">4</part-num-ref>
+ may be a capsule, although other configurations are possible. In some embodiments receiving unit <part-num-ref name="capsule, although other configurations are possible. In some embodiments receiving unit">6</part-num-ref>
+ separate from workstation <part-num-ref name="separate from workstation">8</part-num-ref>
+ need not be used. Any unit which may receive or accept data transmitted by imaging device <part-num-ref name="need not be used. Any unit which may receive or accept data transmitted by imaging device">4</part-num-ref>
+ may be considered a "receiving unit".    </p>
+    <p id="p-20" num="20">Receiving unit 6 may communicate with workstation <part-num-ref name="may communicate with workstation">8</part-num-ref>
+ via a medium <part-num-ref name="medium">12,</part-num-ref>
+ which may be wireless or hard-wired. For example, receiving unit <part-num-ref name="medium 12, which may be wireless or hard-wired. For example, receiving unit">6</part-num-ref>
+ may be able to transfer bits of wireless communication, for example, memory data, memory data or corresponding image frames that are stored in memory <part-num-ref name="may be able to transfer bits of wireless communication, for example, memory data, memory data or corresponding image frames that are stored in memory">74,</part-num-ref>
+ to workstation <part-num-ref name="may be able to transfer bits of wireless communication, for example, memory data, memory data or corresponding image frames that are stored in memory 74, to workstation">8,</part-num-ref>
+ and may receive control signals, and other digital content, from workstation <part-num-ref name="may be able to transfer bits of wireless communication, for example, memory data, memory data or corresponding image frames that are stored in memory 74, to workstation 8, and may receive control signals, and other digital content, from workstation">8.</part-num-ref>
+ Although the invention is not limited in this respect, medium <part-num-ref name="invention is not limited in this respect, medium">12</part-num-ref>
+ may be, for example, a USB cable and may be coupled to a USB controller in receiving unit <part-num-ref name="USB controller in receiving unit">6.</part-num-ref>
+    </p>
+    <boundary-data type="header">P-9044-US</boundary-data>
+    <p id="p-21" num="21">
+      <page-break num="4"/>
+Alternatively, medium 12 may be wireless, and receiving unit <part-num-ref name="may be wireless, and receiving unit">6</part-num-ref>
+ and workstation <part-num-ref name="and workstation">8</part-num-ref>
+ may communicate wirelessly.    </p>
+    <p id="p-22" num="22">Imaging device 4 may include a power source <part-num-ref name="power source">24,</part-num-ref>
+ a control block <part-num-ref name="control block">26,</part-num-ref>
+ a transmitter <part-num-ref name="transmitter">28,</part-num-ref>
+ image sensors <part-num-ref name="transmitter 28, image sensors">40</part-num-ref>
+ and <part-num-ref name="and">50,</part-num-ref>
+ and illumination sources <part-num-ref name="and 50, and illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58.</part-num-ref>
+ Illumination sources <part-num-ref name="and 58. Illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58,</part-num-ref>
+ for example, light emitting diodes (LEDs), may produce light pulses <part-num-ref name="and 58, for example, light emitting diodes (LEDs), may produce light pulses">44</part-num-ref>
+ and <part-num-ref name="and">64</part-num-ref>
+ that may penetrate through optical windows <part-num-ref name="that may penetrate through optical windows">36</part-num-ref>
+ and <part-num-ref name="and">56</part-num-ref>
+ and may illuminate inner portions <part-num-ref name="and may illuminate inner portions">46</part-num-ref>
+ and <part-num-ref name="and">62</part-num-ref>
+ of a body lumen, respectively. Image data of inner portions of a body lumen <part-num-ref name="body lumen">46</part-num-ref>
+ and <part-num-ref name="and">62</part-num-ref>
+ may be transmitted, for example, via transmitter <part-num-ref name="may be transmitted, for example, via transmitter">28,</part-num-ref>
+ from in-vivo imaging device <part-num-ref name="may be transmitted, for example, via transmitter 28, from in-vivo imaging device">4</part-num-ref>
+ to receiving unit <part-num-ref name="to receiving unit">6</part-num-ref>
+ via a wireless or hard-wired medium <part-num-ref name="wireless or hard-wired medium">10.</part-num-ref>
+ It may be appreciated by those skilled in the art that, with appropriate modifications, any number of imaging systems may be used according to embodiments of the invention. In one embodiment, all of the components of imaging device <part-num-ref name="components of imaging device">4</part-num-ref>
+ are sealed within a device body <part-num-ref name="device body">78</part-num-ref>
+ (the body or shell may include one or more pieces).    </p>
+    <p id="p-23" num="23">Control block 26 may control, at least in part, the operations of imaging device <part-num-ref name="operations of imaging device">4.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">
+      <confidence value="2">.</confidence>
+For <confidence value="8">e</confidence>
+xample, control block 26 may synchronize time periods, in which illumination sources <part-num-ref name="may synchronize time periods, in which illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58</part-num-ref>
+ produce light rays or pulses with time periods in which image sensors <part-num-ref name="produce light rays or pulses with time periods in which image sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ capture images, respectively.    </p>
+    <p id="p-25" num="25">Imaging device 4 typically may be or may include an autonomous swallowable capsule, but imaging device <part-num-ref name="autonomous swallowable capsule, but imaging device">4</part-num-ref>
+ may have other shapes and need not be swallowable or autonomous.    </p>
+    <p id="p-26" num="26">Embodiments of imaging device 4 are typically autonomous, and are typically self-contained.</p>
+    <p id="p-27" num="27">For example, imaging device 4 may be a capsule or other unit where all the components including for example power components are substantially contained within a container or shell, and where imaging device <part-num-ref name="container or shell, and where imaging device">4</part-num-ref>
+ does not require any wires or cables to, for example, receive po<confidence value="8">w</confidence>
+er or transmit information. Imaging device <part-num-ref name="does not require any wires or cables to, for example, receive power or transmit information. Imaging device">4</part-num-ref>
+ may communicate with an external receiving and display system to provide display of data, control, or other functions. For example, in an autonomous system power may be provided by an internal battery or a wireless receiving system.    </p>
+    <p id="p-28" num="28">Other embodiments may have other configurations and capabilities. For example, components may be distributed over multiple sites or units. Control information may be received from an external source.</p>
+    <p id="p-29" num="29">A non-exhaustive list of examples of body lumens includes the gastrointestinal (G<confidence value="66">I)</confidence>
+ tract, a blood vessel, a reproductive tract, or any other suitable body lumen.    </p>
+    <p id="p-30" num="30">Reference is made to Figs. 2 and <part-num-ref name="and">3,</part-num-ref>
+ which are schematic illustrations of in-vivo imaging devices, in accordance with an embodiment of the invention. Imaging device <part-num-ref name="invention. Imaging device">4</part-num-ref>
+ may include all the components and capabilities described above in reference to Fig. 1. Imaging device <part-num-ref name="components and capabilities described above in reference to Fig. 1. Imaging device">4</part-num-ref>
+ may include a centerline <part-num-ref name="centerline">80,</part-num-ref>
+ an axis <part-num-ref name="axis">88,</part-num-ref>
+ an axis <part-num-ref name="axis">
+        <confidence value="5">1</confidence>
+10,      </part-num-ref>
+ and imaging sensors <part-num-ref name="axis 110, and imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50.</part-num-ref>
+ Centerline <part-num-ref name="and 50. Centerline">80</part-num-ref>
+ may include all points which are equidistant from the outer surface of imaging device <part-num-ref name="outer surface of imaging device">4.</part-num-ref>
+ Axes <boundary-data type="header">
+        <confidence value="888">-4-</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+      <part-num-ref name="outer surface of imaging device 4. Axes">88</part-num-ref>
+ and <part-num-ref name="and">110</part-num-ref>
+ may be perpendicular to each other and may bisect imaging device <part-num-ref name="may be perpendicular to each other and may bisect imaging device">4,</part-num-ref>
+ for example, at an angle perpendicular to device body <part-num-ref name="angle perpendicular to device body">78.</part-num-ref>
+ In one embodiment, axis <part-num-ref name="angle perpendicular to device body 78. In one embodiment, axis">88</part-num-ref>
+ may be an axis of symmetry of imaging device <part-num-ref name="axis of symmetry of imaging device">4.</part-num-ref>
+ Imaging sensors <part-num-ref name="axis of symmetry of imaging device 4. Imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ may have respective fields of view <part-num-ref name="may have respective fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84.</part-num-ref>
+ Fields of view <part-num-ref name="and 84. Fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ may be regions from which imaging sensors <part-num-ref name="may be regions from which imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50,</part-num-ref>
+ respectively, measure light or capture image data. Fields of view <part-num-ref name="and 50, respectively, measure light or capture image data. Fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ may have centerlines <part-num-ref name="may have centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92,</part-num-ref>
+ respectively, which may be all points equidistant from the outer surface of fields of view <part-num-ref name="outer surface of fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84,</part-num-ref>
+ respectively. Angles <part-num-ref name="and 84, respectively. Angles">106</part-num-ref>
+ and <part-num-ref name="and">108</part-num-ref>
+ may be a relative angle between axis <part-num-ref name="relative angle between axis">110</part-num-ref>
+ and centerlines <part-num-ref name="and centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92,</part-num-ref>
+ respectively. Imaging device <part-num-ref name="and 92, respectively. Imaging device">4</part-num-ref>
+ may include a center of gravity <part-num-ref name="center of gravity">96</part-num-ref>
+ and a weight <part-num-ref name="weight">98</part-num-ref>
+ and/or a floatation device <part-num-ref name="floatation device">100.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">Imaging sensors 40 and <part-num-ref name="and">50</part-num-ref>
+ may be positioned such that fields of view <part-num-ref name="may be positioned such that fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ have respective centerlines <part-num-ref name="have respective centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ that intersect at a point of intersection <part-num-ref name="point of intersection">94.</part-num-ref>
+ Centerlines <part-num-ref name="point of intersection 94. Centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ may intersect axis <part-num-ref name="may intersect axis">
+        <confidence value="5">1</confidence>
+10      </part-num-ref>
+ at angles <part-num-ref name="at angles">106</part-num-ref>
+ and <part-num-ref name="and">108,</part-num-ref>
+ respectively, so that angles <part-num-ref name="and 108, respectively, so that angles">106</part-num-ref>
+ and/or <part-num-ref name="and/or">108</part-num-ref>
+ are greater than zero. Such embodiments may provide imaging sensors <part-num-ref name="are greater than zero. Such embodiments may provide imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ positioned for imaging<confidence value="1">.</confidence>
+ frequently obscured areas of a body lumen, for example, portions of the Inferior Esophageal Sphincter <part-num-ref name="Inferior Esophageal Sphincter">60,</part-num-ref>
+ such as a region <part-num-ref name="region">86,</part-num-ref>
+ referred to as a "z-line", shown more particularly in Fig. 5. In some embodiments of the present invention, imagers <part-num-ref name="present invention, imagers">40</part-num-ref>
+ and/or <part-num-ref name="and/or">50</part-num-ref>
+ may substantially image, and illumination sources <part-num-ref name="may substantially image, and illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58</part-num-ref>
+ may substantially illuminate, the entirety of z-line <part-num-ref name="entirety of z-line">86.</part-num-ref>
+    </p>
+    <p id="p-32" num="32">In some embodiments, illumination sources 38 and <part-num-ref name="and">58,</part-num-ref>
+ described in detail above in reference to Fig. 1, may fully illuminate fields of view <part-num-ref name="and 58, described in detail above in reference to Fig. 1, may fully illuminate fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84,</part-num-ref>
+ respectively. For example, centerlines <part-num-ref name="and 84, respectively. For example, centerlines">45</part-num-ref>
+ and <part-num-ref name="and">65</part-num-ref>
+ of light pulses <part-num-ref name="of light pulses">44</part-num-ref>
+ and <part-num-ref name="and">64,</part-num-ref>
+ emitted from illumination sources <part-num-ref name="and 64, emitted from illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58,</part-num-ref>
+ respectively, may be parallel to centerlines <part-num-ref name="and 58, respectively, may be parallel to centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ of fields of view <part-num-ref name="of fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84,</part-num-ref>
+ respectively In one embodiment, fields of view <part-num-ref name="and 84, respectively In one embodiment, fields of view">82</part-num-ref>
+ and/or <part-num-ref name="and/or">84</part-num-ref>
+ may be substantially equivalent in scope to regions of the body lumen illuminated by illumination sources <part-num-ref name="body lumen illuminated by illumination sources">38</part-num-ref>
+ and <part-num-ref name="and">58,</part-num-ref>
+ respectively, which may be substantially equivalent in to z-line <part-num-ref name="and 58, respectively, which may be substantially equivalent in to z-line">86</part-num-ref>
+ or a cross-section thereof.    </p>
+    <p id="p-33" num="33">There are many designs and arrangements of components that may provide embodiments according to the present invention. Two examples are illustrated in reference to Figs. 2 and <part-num-ref name="and">3.</part-num-ref>
+    </p>
+    <p id="p-34" num="34">In one embodiment illustrated in Fig. 2, centerline 80 may have a radius of curvature.</p>
+    <p id="p-35" num="35">The radius of curvature at a point along a line may be the distance from the center of a sphere or ellipsoid that shares a common tangent with the line at that point. For example, a straight line has no radius of curvature. In various embodiments, centerline <part-num-ref name="straight line has no radius of curvature. In various embodiments, centerline">80</part-num-ref>
+ may have a curvature greater than zero or may deviate from being straight. In some embodiments, imaging sensors <part-num-ref name="curvature greater than zero or may deviate from being straight. In some embodiments, imaging sensors">40</part-num-ref>
+ and/or <part-num-ref name="and/or">50</part-num-ref>
+ may be positioned along or adjacent to centerline <part-num-ref name="may be positioned along or adjacent to centerline">80.</part-num-ref>
+ In such embodiments, fields of view <part-num-ref name="may be positioned along or adjacent to centerline 80. In such embodiments, fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ may have respective centerlines <part-num-ref name="may have respective centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ that intersect at point of intersection <part-num-ref name="that intersect at point of intersection">94.</part-num-ref>
+ In an exemplary embodiment, since centerline <part-num-ref name="exemplary embodiment, since centerline">80</part-num-ref>
+ may have a radius of curvature, angle <part-num-ref name="radius of curvature, angle">106</part-num-ref>
+ and/or angle <part-num-ref name="and/or angle">108</part-num-ref>
+ may be greater than zero, for example, in a range from about <part-num-ref name="range from about">5</part-num-ref>
+ to about <part-num-ref name="to about">10</part-num-ref>
+ degrees.    </p>
+    <p id="p-36" num="36">
+      <confidence value="888">-5-</confidence>
+ <page-break num="6"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+Other angles may be used. In some embodiments, centerline 80 may or may not have a constant radius of curvature. For example, only a portion of centerline <part-num-ref name="portion of centerline">80</part-num-ref>
+ may have a radius of curvature.    </p>
+    <p id="p-37" num="37">According to embodiments of the present invention, imaging device <part-num-ref name="present invention, imaging device">4</part-num-ref>
+ may have an adaptive shape for, when activated, changing the orientation of imaging device <part-num-ref name="orientation of imaging device">4</part-num-ref>
+ and therefore the orientation and/or curvature of centerline <part-num-ref name="orientation and/or curvature of centerline">80,</part-num-ref>
+ between being substantially straight or having substantially no radius of curvature and being substantially curved and substantially having a radius of curvature. In one embodiment, when deactivated centerline <part-num-ref name="radius of curvature. In one embodiment, when deactivated centerline">80</part-num-ref>
+ does not have a radius of curvature. An alternate embodiment may include a shape memory material that changes the orientation of centerline <part-num-ref name="orientation of centerline">80</part-num-ref>
+ to have a radius of curvature. In other embodiments, the shape memory material may change the curvature of centerline <part-num-ref name="curvature of centerline">80</part-num-ref>
+ from greater than zero to about zero, and preferably zero. In some embodiments, imaging device <part-num-ref name="from greater than zero to about zero, and preferably zero. In some embodiments, imaging device">4</part-num-ref>
+ may include shape memory material.    </p>
+    <p id="p-38" num="38">Shape memory material may include any of the known shape memory alloys or shape memory polymers, is incorporated, according to an embodiment of the invention, into device body <part-num-ref name="invention, into device body">78</part-num-ref>
+ so as <confidence value="8866">to..</confidence>
+ enable <confidence value="5">.</confidence>
+deflection of device body <part-num-ref name="so as to.. enable .deflection of device body">78.</part-num-ref>
+ For example, in various embodiments, substantially the entire device body <part-num-ref name="entire device body">78</part-num-ref>
+ or any portion of device body <part-num-ref name="or any portion of device body">78,</part-num-ref>
+ such as either end of device body <part-num-ref name="or any portion of device body 78, such as either end of device body">78,</part-num-ref>
+ or strips along device body <part-num-ref name="or any portion of device body 78, such as either end of device body 78, or strips along device body">78</part-num-ref>
+ or material in the proximity of device body <part-num-ref name="proximity of device body">78,</part-num-ref>
+ are made of a shape memory material. Alternately, the shape memory material may be adjacent to or attached to device body <part-num-ref name="shape memory material may be adjacent to or attached to device body">78.</part-num-ref>
+ In other embodiments, shape memory material may be internal to device body <part-num-ref name="shape memory material may be adjacent to or attached to device body 78. In other embodiments, shape memory material may be internal to device body">78,</part-num-ref>
+ for example, extending substantially along centerline <part-num-ref name="shape memory material may be adjacent to or attached to device body 78. In other embodiments, shape memory material may be internal to device body 78, for example, extending substantially along centerline">80,</part-num-ref>
+ for example, coating a heating rod. The shape memory material may be bent to various configurations in response to changes in temperature. Thus, different natural or induced in-vivo environments having different temperatures may be used to deflect the shape memory material in various directions thereby achieving flexibility and, according to one embodiment, changing the curvature of centerline <part-num-ref name="curvature of centerline">80,</part-num-ref>
+ so that centerline <part-num-ref name="curvature of centerline 80, so that centerline">80</part-num-ref>
+ has a radius of curvature.    </p>
+    <p id="p-39" num="39">In another embodiment, imaging device 4, having centerline 80 without a radius of curvature, may be swallowed. In such embodiments, imaging device <part-num-ref name="radius of curvature, may be swallowed. In such embodiments, imaging device">4</part-num-ref>
+ may be very flexible such that the shape of imaging device <part-num-ref name="shape of imaging device">4</part-num-ref>
+ may conform to the shape of the body lumen. When imaging device <part-num-ref name="body lumen. When imaging device">4</part-num-ref>
+ approaches a region, for example, the Inferior Esophageal Sphincter, it may already be shaped to image z-line <part-num-ref name="Inferior Esophageal Sphincter, it may already be shaped to image z-line">86,</part-num-ref>
+ according to embodiments of the present invention.    </p>
+    <p id="p-40" num="40">The portion of device body 78 having an adaptive shape may include heat conveying elements, such as one or more wires embedded in or adjacent to device body <part-num-ref name="adaptive shape may include heat conveying elements, such as one or more wires embedded in or adjacent to device body">78.</part-num-ref>
+ Other heat conveying elements may be used. Typically, the heat conveying elements may be connected to a power source <part-num-ref name="power source">24,</part-num-ref>
+ and may be embedded in device body <part-num-ref name="power source 24, and may be embedded in device body">78</part-num-ref>
+ at a location suitable for effecting a temperature change in the vicinity of the shape memory material. When the shape memory material portion is heated typically to above the transition temperature of the shape memory <boundary-data type="header">
+        <confidence value="888">-6-</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+material or deformable material such as the polyurethane material of device body <part-num-ref name="polyurethane material of device body">78,</part-num-ref>
+ the material of device body <part-num-ref name="material of device body">78</part-num-ref>
+ goes through a conformational change as pre programmed, for example, changing the curvature of centerline <part-num-ref name="curvature of centerline">80,</part-num-ref>
+ <confidence value="66">so</confidence>
+ that centerline <part-num-ref name="curvature of centerline 80, so that centerline">80</part-num-ref>
+ has a radius of curvature.    </p>
+    <p id="p-41" num="41">In some embodiments, activating the shape memory material portion may change the curvature of device body <part-num-ref name="curvature of device body">78,</part-num-ref>
+ <confidence value="66">so</confidence>
+ that surface curvature of device body <part-num-ref name="curvature of device body 78, so that surface curvature of device body">78</part-num-ref>
+ has a radius of curvature. In such embodiments, activating the shape memory material portion may change the surface curvature of <confidence value="2">.</confidence>
+  <confidence value="2">.</confidence>
+device body <part-num-ref name="surface curvature of .  .device body">78</part-num-ref>
+ to be greater than zero.    </p>
+    <p id="p-42" num="42">Examples of imaging devices containing shape memory material that may be used <confidence value="2">-</confidence>
+          with embodiments of the present invention are described, for example, in US Application Number 10/213,345, entitled "Maneuverable In Vivo Device and Method" to Glukhovsky, which is assigned to the common assignee of the present invention and which is incorporated herein by reference.    </p>
+    <p id="p-43" num="43">According to some embodiments, image sensors 40 and <part-num-ref name="and">50</part-num-ref>
+ may be connected to a flexible circuit board for reducing tension on components of imaging<confidence value="4">.</confidence>
+ device <part-num-ref name="flexible circuit board for reducing tension on components of imaging. device">4</part-num-ref>
+ that may result from changes in the shape of imaging device <part-num-ref name="shape of imaging device">4.</part-num-ref>
+ Examples of imaging devices containing flexible circuit boards that may be used with embodiments of the present invention are described, for example, in US Application Number 10/879,054 entitled "In Vivo Device with Flexible Circuit Board and Method for Assembly Thereof<confidence value="5">'</confidence>
+ to Gilad, which is assigned to the common assignee of the present invention and which is incorporated by reference.    </p>
+    <p id="p-44" num="44">In one embodiment illustrated in Fig. 3, imaging device 4 may include imaging sensors <part-num-ref name="may include imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ positioned on opposite ends of imaging device <part-num-ref name="positioned on opposite ends of imaging device">4</part-num-ref>
+ having fields of view <part-num-ref name="having fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ with respective centerlines <part-num-ref name="with respective centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ that intersect at a point of intersection <part-num-ref name="point of intersection">94.</part-num-ref>
+ Centerlines <part-num-ref name="point of intersection 94. Centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ may intersect axis <part-num-ref name="may intersect axis">
+        <confidence value="5">1</confidence>
+10      </part-num-ref>
+ at angles <part-num-ref name="at angles">106</part-num-ref>
+ and <part-num-ref name="and">108,</part-num-ref>
+ respectively, so that angles <part-num-ref name="and 108, respectively, so that angles">106</part-num-ref>
+ and/or <part-num-ref name="and/or">108</part-num-ref>
+ are greater than zero, for example, in a range from about <part-num-ref name="range from about">5</part-num-ref>
+ to about <part-num-ref name="to about">10</part-num-ref>
+ degrees. Other angles may be used. In some but not all embodiments, point of intersection <part-num-ref name="degrees. Other angles may be used. In some but not all embodiments, point of intersection">94</part-num-ref>
+ may lie near or on axis <part-num-ref name="may lie near or on axis">88.</part-num-ref>
+    </p>
+    <p id="p-45" num="45">In such embodiments, centerline 80 need not have a radius of curvature. However, imaging device <part-num-ref name="radius of curvature. However, imaging device">4</part-num-ref>
+ having centerline <part-num-ref name="having centerline">80,</part-num-ref>
+ a portion or all of which has a radius of curvature, may also be used.    </p>
+    <p id="p-46" num="46">
+      <confidence value="5">I</confidence>
+n some embodiments, imaging device 4 may include moveable parts for, when activated, positioning imaging sensors <part-num-ref name="may include moveable parts for, when activated, positioning imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ so that fields of view <part-num-ref name="so that fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ have respective centerlines <part-num-ref name="have respective centerlines">90</part-num-ref>
+ and <part-num-ref name="and">92</part-num-ref>
+ that intersect at point of intersection <part-num-ref name="that intersect at point of intersection">94.</part-num-ref>
+ For example, when the moveable parts are deactivated, imaging sensors <part-num-ref name="moveable parts are deactivated, imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ may have respective fields of <confidence value="8">v</confidence>
+iew that temporarily share a substantially common centerline. In one embodiment, imaging device <part-num-ref name="substantially common centerline. In one embodiment, imaging device">4</part-num-ref>
+ may include shape memory material as described herein, adapted for, when activated, changing the fields of view <part-num-ref name="fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84</part-num-ref>
+ of the imaging sensors <part-num-ref name="imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50,</part-num-ref>
+ respectively, so that centerlines <part-num-ref name="and 50, respectively, so that centerlines">90</part-num-ref>
+ <confidence value="888">-7-</confidence>
+ <page-break num="8"/>
+      <boundary-data type="header">
+        <confidence value="86">P-</confidence>
+9044-US      </boundary-data>
+and <part-num-ref name="-7- and">92</part-num-ref>
+ intersect. In other embodiments, imaging device <confidence value="2">~</confidence>
+4 may include a wide variety of mechanical linkages, for example, a series of gears or a moveable pulley or weight that may pivot imaging sensors <part-num-ref name="moveable pulley or weight that may pivot imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ and thus change their fields of view <part-num-ref name="and thus change their fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84,</part-num-ref>
+ respectively. In other embodiments, imaging device <part-num-ref name="and 84, respectively. In other embodiments, imaging device">4</part-num-ref>
+ may include mirrors, which may be for example moveable or activated by altering a reflective index, to alter fields of view <part-num-ref name="reflective index, to alter fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84.</part-num-ref>
+ Activating the moveable parts may be done automatically, for example, after a period of time measured by an internal or external timer (not shown), or may be activated at a user's request, for example, communicated to imaging device <part-num-ref name="user's request, for example, communicated to imaging device">4</part-num-ref>
+ via a signal from workstation <part-num-ref name="signal from workstation">8</part-num-ref>
+ and/or receiver <part-num-ref name="and/or receiver">6.</part-num-ref>
+    </p>
+    <p id="p-47" num="47">With respect to imaging devices 4 discussed in reference to Figs. 2 and <part-num-ref name="and">3,</part-num-ref>
+ center of gravity <part-num-ref name="and 3, center of gravity">96</part-num-ref>
+ may be displaced from centerline <part-num-ref name="may be displaced from centerline">80</part-num-ref>
+ for orienting imaging device <part-num-ref name="for orienting imaging device">4</part-num-ref>
+ so that imaging sensors <part-num-ref name="so that imaging sensors">40</part-num-ref>
+ and <part-num-ref name="and">50</part-num-ref>
+ have desirable fields of view <part-num-ref name="have desirable fields of view">82</part-num-ref>
+ and <part-num-ref name="and">84,</part-num-ref>
+ respectively, for example, for imaging irregularly curved regions of a body lumen, such as the Inferior Esophageal Sphincter<confidence value="6">.</confidence>
+ <confidence value="6">I</confidence>
+n some embodiments, center of gravity <part-num-ref name="Inferior Esophageal Sphincter. In some embodiments, center of gravity">96</part-num-ref>
+ of imaging device <part-num-ref name="of imaging device">4</part-num-ref>
+ may be displaced from centerline <part-num-ref name="may be displaced from centerline">80,</part-num-ref>
+ for <confidence value="5">.</confidence>
+example, using weight <part-num-ref name="may be displaced from centerline 80, for .example, using weight">98,</part-num-ref>
+ floatation device <part-num-ref name="may be displaced from centerline 80, for .example, using weight 98, floatation device">100,</part-num-ref>
+ <confidence value="222222">and/or</confidence>
+ an arrangement of components in imaging device <part-num-ref name="arrangement of components in imaging device">4.</part-num-ref>
+ In some embodiments, center of gravity <part-num-ref name="arrangement of components in imaging device 4. In some embodiments, center of gravity">96</part-num-ref>
+ may be displaced along axis <part-num-ref name="may be displaced along axis">88.</part-num-ref>
+    </p>
+    <p id="p-48" num="48">Weight 98 may be any substance that decreases the buoyancy of imaging device <part-num-ref name="buoyancy of imaging device">4</part-num-ref>
+ and flotation device <part-num-ref name="and flotation device">100</part-num-ref>
+ may be any substance that increases the buoyancy of imaging device <part-num-ref name="buoyancy of imaging device">4.</part-num-ref>
+ Weight <part-num-ref name="buoyancy of imaging device 4. Weight">98</part-num-ref>
+ may include any sufficiently heavy material, including, metals, plastics, etc. Flotation device <part-num-ref name="may include any sufficiently heavy material, including, metals, plastics, etc. Flotation device">100</part-num-ref>
+ may include a housing, made of, for example, plastic such as isoplast, where the housing contains a substance lighter than liquid in the body lumen, such as gaseous <confidence value="5">C</confidence>
+O2, <confidence value="45">O2</confidence>
+ and/or air.    </p>
+    <p id="p-49" num="49">Flotation device 100 may be positioned toward a convex inner surface <part-num-ref name="convex inner surface">102</part-num-ref>
+ and weight <part-num-ref name="and weight">98</part-num-ref>
+ may be positioned toward a concave inner surface <part-num-ref name="concave inner surface">104.</part-num-ref>
+ Imaging device <part-num-ref name="concave inner surface 104. Imaging device">4</part-num-ref>
+ may be positively, negatively or neutrally buoyant in a body lumen, regardless of whether or not imaging device <part-num-ref name="body lumen, regardless of whether or not imaging device">4</part-num-ref>
+ includes weight <part-num-ref name="includes weight">98</part-num-ref>
+ and/or floatation device <part-num-ref name="and/or floatation device">100.</part-num-ref>
+    </p>
+    <p id="p-50" num="50">
+      <confidence value="5">I</confidence>
+n one embodiment, floatation device 100 may be inactive while in a package and may only increase the buoyancy of imaging device <part-num-ref name="buoyancy of imaging device">4</part-num-ref>
+ when activated. For example, floatation device <part-num-ref name="when activated. For example, floatation device">100</part-num-ref>
+ may be an elastic compartment containing air that inflates when activated to a level sufficient for decreasing the buoyancy of imaging device <part-num-ref name="buoyancy of imaging device">4.</part-num-ref>
+ In one embodiment, activation may occur by releasing floatation device <part-num-ref name="buoyancy of imaging device 4. In one embodiment, activation may occur by releasing floatation device">100</part-num-ref>
+ from a packaging, for example, manually or automatically, at a desired location in-vivo. For example, floatation device <part-num-ref name="desired location in-vivo. For example, floatation device">100</part-num-ref>
+ may contain gas releasing granules such as crystalline sodium bicarbonate, E-Z Gas<confidence value="66">II</confidence>
+ effervescent granules by EZEM of NY, USA or similar oxygen releasing granules. Typically, these granules release gas (such as CO2 or oxygen) upon contacting liquid. Floatation device <part-num-ref name="may contain gas releasing granules such as crystalline sodium bicarbonate, E-Z GasII effervescent granules by EZEM of NY, USA or similar oxygen releasing granules. Typically, these granules release gas (such as CO2 or oxygen) upon contacting liquid. Floatation device">100,</part-num-ref>
+ positioned internal or external to imaging device <part-num-ref name="may contain gas releasing granules such as crystalline sodium bicarbonate, E-Z GasII effervescent granules by EZEM of NY, USA or similar oxygen releasing granules. Typically, these granules release gas (such as CO2 or oxygen) upon contacting liquid. Floatation device 100, positioned internal or external to imaging device">4,</part-num-ref>
+ may be exposed to liquid and activate<confidence value="6">.</confidence>
+ <confidence value="6">I</confidence>
+n another embodiment the packaging may be affected by degradable sutures known <boundary-data type="header">
+        <confidence value="888">-8-</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+in the art, such that the packaging of floatation device <part-num-ref name="packaging of floatation device">100</part-num-ref>
+ is released when the suture is degraded.    </p>
+    <p id="p-51" num="51">In another embodiment, activation of floatation device 100 may occur automatically, for example, by receiving a signal from a remote device, in response to a sensed stimulus or after a predetermined time interval. For example, imaging device <part-num-ref name="predetermined time interval. For example, imaging device">4</part-num-ref>
+ may include a gelatin device body <part-num-ref name="gelatin device body">78,</part-num-ref>
+ such as gelatin capsules provided by Capsugel USA, that may dissolve at a specific location along the GI tract, as known in the field of sustained release mechanisms. In other embodiments, activation of floatation device <part-num-ref name="field of sustained release mechanisms. In other embodiments, activation of floatation device">100</part-num-ref>
+ may occur after a preselected period of time measured by an internal or external timer or at a user's request, for example, communicated to imaging device <part-num-ref name="user's request, for example, communicated to imaging device">4</part-num-ref>
+ <confidence value="2222222222">wirelessly</confidence>
+ via a signal from workstation <part-num-ref name="signal from workstation">8</part-num-ref>
+ and/or receiver <part-num-ref name="and/or receiver">
+        <confidence value="88">6.</confidence>
+      </part-num-ref>
+    </p>
+    <p id="p-52" num="52">Examples of floatation devices 100 that may be used with embodiments of the present invention are described, for example, in US Publication Number 2003/0018280 Al, entitled "Floatable In <confidence value="5">.</confidence>
+Vivo Sensing Device <confidence value="5">.</confidence>
+and Method for Use". to Lewkowicz, which<confidence value="5">.</confidence>
+ <confidence value="88">is</confidence>
+ assigned to the common assignee of the present invention and which is incorporated by reference.    </p>
+    <p id="p-53" num="53">Reference is now made to Fig. 4, which depicts a series of steps for adapting the shape of an imaging device, in accordance with an embodiment of the invention.</p>
+    <p id="p-54" num="54">In step 400 an imaging device is inserted in-vivo, where the imaging device may have a centerline, a center of gravity that may be displaced from the centerline, and activatable shape memory material adapted for changing the orientation of the centerline so that the centerline has a radius of curvature. The shape memory material may be, for example, embedded, adjacent, interior or exterior to a device body of the imaging device.</p>
+    <p id="p-55" num="55">In step 410 a temperature change is effected in the vicinity of the shape memory material, for example, by heating. According to one embodiment the shape memory material may be heated by heating wires, such as electrically conductive wires, that may be embedded in or adjacent to the shape memory material.</p>
+    <p id="p-56" num="56">In step 420, movement may be effected and the shape of the imaging device may be adapted or undergo an action, motion or configurational change. For example, a portion of the imaging device bends or rotates. The shape memory material may be differentially heated to achieve the desired configurational change. In some embodiments, such motion may cause a change in the curvature of a centerline of the imaging device so that the centerline has a radius of curvature. In other embodiments, the orientation of the centerline of the imaging device may not change and the centerline may not have a radius of curvature. In such embodiments, the position of imaging sensors relative to the centerline of the imaging device may change so that the fields <confidence value="888">-9-</confidence>
+ <page-break num="10"/>
+      <boundary-data type="header">P-9044-US</boundary-data>
+of view of the imaging sensors have respective centerlines that intersect at a point of intersection.    </p>
+    <p id="p-57" num="57">In one embodiment, adapting the shape includes changing the orientation of a centerline of the imaging device, so that the centerline has a radius of curvature. In other embodiments, adapting the shape includes changing the position of imaging sensors relative to a centerline of the imaging device so that the fields of view of the imaging sensors have respective centerlines that intersect at a point of intersection. Such embodiments may provide imaging devices that may image regions of a body lumen having irregularly curved shapes, such as, the Inferior Esophageal Sphincter.</p>
+    <p id="p-58" num="58">It will be appreciated by persons skilled in the art that systems and methods that suitably combine any of the above described embodiments, are also included in the present invention. It will be appreciated that the present invention is not limited to what has been particularly shown and described hereinabove. Rather the scope of the present invention is defined only by the claims which follow:</p>
+    <boundary-data type="header">
+      <confidence value="8">-</confidence>
+ <confidence value="888">10-</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11535761.xml

@@ -0,0 +1,386 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11535761</doc-number>
+        <date>2006-09-27</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+    <heading id="h-1">TITLE: EVENT CONTEXT DATA AND AGGREGATION FOR INDUSTRIAL</heading>
+    <heading id="h-2">CONTROL SYSTEMS</heading>
+    <heading id="h-3">TECHNICAL FIELD</heading>
+    <p id="p-1" num="1">[0001<confidence value="5">]</confidence>
+       The subject invention relates generally to industrial control systems and more particularly to components that dynamically apply context data to alarms or events, where such data can be aggregated, analyzed, and directed to parties in a focused manner in accordance with the context data.    </p>
+    <heading id="h-4">BACKGROUND</heading>
+    <p id="p-2" num="2">[0002<confidence value="5">]</confidence>
+       Industrial control systems generate a plurality of data - both for internal consumption by the systems and for external use such as for maintenance personnel or plant management. In one example of such control system data, modern control systems generally provide status relating to diagnostic aspects of the system. This can include fault bits reflecting hardware detected failures such as watchdog timer values and can include software recorded information such as communications retry counters or process event data including detected alarm conditions. Often times, programmable logic controller (PLC) programmers write custom PLC code to monitor diagnostic bits or data and then write specialized control programs to respond to such data. This type activity can be very time consuming to develop and test an effective control solution that responds in accordance with detected diagnostic behavior. In addition, obtaining timely, useful and human-readable diagnostic data from the PLC or associated system can also be problematic. Moreover, most diagnostic bits or status elements that are provided by PLC's are relatively static in nature. Thus, controller programs that respond to such information generally are written in a reactive mode, whereby a potentially disruptive situation may have already occurred before any type of corrective action is performed.    </p>
+    <p id="p-3" num="3">[0003<confidence value="5">]</confidence>
+       One mechanism that has been employed to communicate control system <page-break num="2"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+status data relates to alarm and event <confidence value="22222222222222222222222">generation/transmission</confidence>
+. Generators for such alarms or events can be triggered from some occurrence in the control system and can be set to automatically fire upon a plurality of varying conditions. For example, alarms can be set up to generate a data packet relating to substantially any occurrence in the control system. The alarms can be generated from processor status events such as low memory, communications errors, logic errors, unauthorized access conditions, buffer conditions, watchdog events, and so forth. Similarly, programmers can define event ranges for control variables, where if a data value is detected outside of a given range, an event can be generated that indicates such detection. Alarms or events can be defined with basic status information such as a time the alarm was generated or an address that generated the alarm. It is noted that alarms can be categorized as a particular type of event.    </p>
+    <p id="p-4" num="4">[0004<confidence value="5">]</confidence>
+        The type of basic status information that can be associated with an alarm is unsatisfactory for many applications. Generally, this type of basic information relating to the time or name of an alarm is static in nature and is not organized in a manner suitable for post processing of the data. For example, if five hundred alarms or events were generated for a control system over the past week, some of these items may apply to routine maintenance conditions that would be applicable for plant operators whereas other type of data may be required for regulatory matters. Since the data is generated and collected in a haphazard manner (e.g., not sorted per requirements of system or user), it can be exceedingly difficult to find relevant data let alone to try and understand if a large amount of collected data is important in the first place.    </p>
+    <p id="p-5" num="5">[0005<confidence value="5">]</confidence>
+        Another problem with the limited nature of generated system status data relates to reporting of such data for regulatory concerns. Many systems fall under significant regulatory constraints, where status data generated from the system is to be logged and categorized in order to satisfy a specific regulation. This may involve many layers of regulation that are now being imposed on automated industries to ensure compliance to applicable standards. To document that these requirements are being adhered to, often one or more signatures are required by various personnel to satisfy the respective requirements. Currently, users may have to sift though a plurality of data and <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+records to find applicable data that may be relevant for reporting a particular condition.    </p>
+    <p id="p-6" num="6">Often times, after such searching though data, it is determined that no particular record is applicable over a given timeframe, thus valuable resources are lost attempting to analyze and determine such data.</p>
+    <heading id="h-5">SUMMARY</heading>
+    <p id="p-7" num="7">[0006<confidence value="5">]</confidence>
+       The following presents a simplified summary in order to provide a basic understanding of some aspects described herein. This summary is not an extensive overview nor is intended to identify key/critical elements or to delineate the scope of the various aspects described herein. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.    </p>
+    <p id="p-8" num="8">[0007<confidence value="5">]</confidence>
+       Context data is added to standard alarm and event messages to facilitate efficient processing of the messages. This includes the ability to generate reports that are specialized and focused to the user of the report rather than sifting though a plurality of unrelated messages or data. In one aspect, standard alarm or event messages are post- processed with context data, where such data is employed to drive report generators and aggregators that are focused to an activity, a user type, or other function. Such context data can indicate the source of an event, an event process, a phase associated with an event, a batch process, a program or procedure call, or a user who may have been involved at some portion of a process that generated the event or subsequently analyzed the event. The context data allows more focused decisions to be made regarding an alarm or event source/condition while mitigating the amount of extraneous processing for unrelated data (e.g., show all alarms related to context A and hide alarm data related to context B). Thus, in one aspect, context data allows users to focus on the data of interest including the reasons why such data may be of interest while mitigating the need to sort through data unrelated to the condition at hand.    </p>
+    <p id="p-9" num="9">[0008<confidence value="5">]</confidence>
+       In previous systems, data may have been tagged as to the time of an event, a name of an event, or an address where the event occurred, where such fields for tagging were fixed at a certain number such as three. This tagging procedure was basically static <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+in that once the alarms or events were generated, they could be collected for the system as a whole, yet relevant context associated with the event was missing. For example, one PLC routine may generate an alarm event yet the source for calling the routine may be associated with a plurality of different phases of a recipe or discreet process. Thus, even though it could be detected that an alarm was generated from an overall process, it was unclear which phase of the process had actually called the routine that triggered the respective alarm. By adding context data after an initial event has been generated, causes and respective solutions to problems can more effectively be determined. Also, context can continually be added during more than one post process phase. Thus, a first user could add some context to the event and that context could subsequently be updated or supplemented by other users or automated procedures. This type of aggregation of context data can be later used for report generation, system analysis, troubleshooting, and documentation for automated regulatory procedures.    </p>
+    <p id="p-10" num="10">[0009<confidence value="5">]</confidence>
+       To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative of various ways which can be practiced, all of which are intended to be covered herein. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings.    </p>
+    <heading id="h-6">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-11" num="11">[0010<confidence value="5">]</confidence>
+       Fig. <confidence value="5">1</confidence>
+ is a schematic block diagram illustrating context data processing for an industrial automation system.    </p>
+    <p id="p-12" num="12">[0011<confidence value="5">]</confidence>
+       Fig. 2 is a diagram illustrating data context additions to event messages.    </p>
+    <p id="p-13" num="13">[0012<confidence value="5">]</confidence>
+       Fig. 3 is a diagram illustrating supplemental data being added to an event message over the lifetime of the message.    </p>
+    <p id="p-14" num="14">[0013<confidence value="5">]</confidence>
+       Fig. 4 is a diagram illustrating an example event processor and message annotator system.    </p>
+    <boundary-data type="header">
+      <confidence value="8">4</confidence>
+    </boundary-data>
+    <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+    <p id="p-15" num="15">
+      <page-break num="5"/>
+[0014<confidence value="5">]</confidence>
+       Fig. 5 is a diagram illustrating example report generation and data mining aspects for context data.    </p>
+    <p id="p-16" num="16">[0015<confidence value="5">]</confidence>
+       Fig. 6 is a diagram illustrating and example control system and user interface operating with context data.    </p>
+    <p id="p-17" num="17">[0016<confidence value="5">]</confidence>
+       Fig. 7 is a flow diagram illustrating an automated context data annotation process.    </p>
+    <p id="p-18" num="18">[0017<confidence value="5">]</confidence>
+       Figs. 8-11 illustrate a common data model that can be employed for context data annotation.    </p>
+    <heading id="h-7">DETAILED DESCRIPTION</heading>
+    <p id="p-19" num="19">[0018<confidence value="5">]</confidence>
+       Systems and methods are provided to facilitate alarm and event data processing in an industrial control system environment, where context is provided after an event has been generated to more effectively process and analyze the event. In one aspect, a data processor for an industrial automation system is provided. An event component generates an initial message from an industrial control system component, where the initial message is based in part on one or more automatically detected conditions. A context component enables data to be added to the initial message to facilitate post processing of system events.    </p>
+    <p id="p-20" num="20">[0019<confidence value="5">]</confidence>
+       It is noted that as used in this application, terms such as "component," "interface," "event," "context," and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution as applied to an automation system for industrial control. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program and a computer. By way of illustration, both an application running on a server and the server can be components. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers, industrial controllers, and/or modules communicating therewith.    </p>
+    <p id="p-21" num="21">[0020<confidence value="5">]</confidence>
+       Referring initially to Fig. 1, a system <part-num-ref name="system">100</part-num-ref>
+ illustrates context data <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+processing for an industrial automation system. The system <part-num-ref name="system">100</part-num-ref>
+ includes one or more control system components <part-num-ref name="includes one or more control system components">110</part-num-ref>
+ that have the ability to generate an alarm or event <part-num-ref name="alarm or event">120</part-num-ref>
+ (also referred to as event <part-num-ref name="(also referred to as event">120)</part-num-ref>
+ based on some condition detected within or across the system <part-num-ref name="system">100.</part-num-ref>
+ The event <part-num-ref name="event">120</part-num-ref>
+ can be sent across a network <part-num-ref name="network">124</part-num-ref>
+ and collected by an aggregator <part-num-ref name="aggregator">130</part-num-ref>
+ including a database or computer component, where events from across the system <part-num-ref name="system">100</part-num-ref>
+ via the network can be stored or logged. A report generation and data mining component <part-num-ref name="report generation and data mining component">140</part-num-ref>
+ can be provided to generate reports or perform analysis relating to management and troubleshooting of the system <part-num-ref name="system">100.</part-num-ref>
+ Such reports can also be applied to maintain compliance with one or more regulatory procedures that the system <part-num-ref name="system">100</part-num-ref>
+ may be subject to. In general, system context data <part-num-ref name="may be subject to. In general, system context data">150</part-num-ref>
+ can be added to supplement standard alarm and event messages <part-num-ref name="can be added to supplement standard alarm and event messages">120</part-num-ref>
+ in order to facilitate efficient post-processing of such messages. Context can be automatically added after the event <part-num-ref name="event">120</part-num-ref>
+ has been generated via the control system components <part-num-ref name="control system components">110</part-num-ref>
+ and/or in accordance with a user interface <part-num-ref name="user interface">160.</part-num-ref>
+    </p>
+    <p id="p-22" num="22">[0021<confidence value="5">]</confidence>
+       The report generation and data mining services <part-num-ref name="report generation and data mining services">140</part-num-ref>
+ allow reports to be generated that are specialized and focused to the user of the report rather than sifting though a plurality of unrelated messages or data. In one example, standard alarm or event messages <part-num-ref name="plurality of unrelated messages or data. In one example, standard alarm or event messages">120</part-num-ref>
+ are post-processed and supplemented with context data <part-num-ref name="are post-processed and supplemented with context data">150,</part-num-ref>
+ where such data is employed to drive report generators <part-num-ref name="are post-processed and supplemented with context data 150, where such data is employed to drive report generators">140</part-num-ref>
+ and aggregators <part-num-ref name="and aggregators">130</part-num-ref>
+ that are focused to an activity, a user type, or other function such as a regulatory compliance procedure.    </p>
+    <p id="p-23" num="23">Such context data 150 can indicate the source of an event, an event process, a phase associated with an event, a batch process, a program or procedure generating the event, or a user who may have been involved at some portion of a process that generated the event or subsequently analyzed the event <part-num-ref name="event">120.</part-num-ref>
+ Various users can employ the user interface <part-num-ref name="user interface">160</part-num-ref>
+ (or interfaces) to post-annotate messages associated with the event <part-num-ref name="event">120</part-num-ref>
+ and subsequently apply context data <part-num-ref name="and subsequently apply context data">150</part-num-ref>
+ to the event.    </p>
+    <p id="p-24" num="24">[0022<confidence value="5">]</confidence>
+       The context data <part-num-ref name="context data">150</part-num-ref>
+ allows more focused decisions to be made regarding the alarm or event source/condition that generated the event <part-num-ref name="event">120</part-num-ref>
+ while mitigating the amount of extraneous processing for unrelated data. For example, this could include displaying all alarms or subset of alarms relating to one context while hiding alarm data <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+related to another context. Thus, in one aspect, context data <part-num-ref name="amount of extraneous processing for unrelated data. For example, this could include displaying all alarms or subset of alarms relating to one context while hiding alarm data related to another context. Thus, in one aspect, context data">150</part-num-ref>
+ allows users to focus on the data of interest including the reasons why such data may be of interest while mitigating the need to sort through data unrelated to the conditions that generated the event <part-num-ref name="event">120.</part-num-ref>
+    </p>
+    <p id="p-25" num="25">[0023<confidence value="5">]</confidence>
+       In previous systems, data may have been tagged as to the time of an event, a name of an event, or an address where the event occurred. This tagging procedure was basically static in that once the alarms or events were generated, they could be collected for the system as a whole, yet relevant context associated with the event was missing.    </p>
+    <p id="p-26" num="26">For example, one control component 110 routine may generate an alarm event <part-num-ref name="alarm event">120</part-num-ref>
+ yet the source for calling the routine may be associated with a plurality of different phases of a recipe or discreet process. Thus, even though it could be detected that an alarm was generated from an overall process, it was unclear which phase of the process had actually called the routine that triggered the respective alarm. By adding context data <part-num-ref name="respective alarm. By adding context data">150</part-num-ref>
+ after an initial event <part-num-ref name="initial event">120</part-num-ref>
+ has been generated, causes and respective solutions to problems can more effectively be determined. Also, context data <part-num-ref name="has been generated, causes and respective solutions to problems can more effectively be determined. Also, context data">150</part-num-ref>
+ can continually be added during more than one post process phase. Thus, a first user could add some context data at <part-num-ref name="first user could add some context data at">160</part-num-ref>
+ to the event <part-num-ref name="event">120</part-num-ref>
+ and that context could subsequently be updated or supplemented by other users (or automated procedures at <part-num-ref name="and that context could subsequently be updated or supplemented by other users (or automated procedures at">110)</part-num-ref>
+ via the user interface <part-num-ref name="user interface">160</part-num-ref>
+ (or other interfaces having network access to add data to the event 120). This type of aggregation of context data <part-num-ref name="event 120). This type of aggregation of context data">150</part-num-ref>
+ can be later used at <part-num-ref name="can be later used at">140</part-num-ref>
+ for report generation, system analysis, troubleshooting, and documentation for automated regulatory procedures.    </p>
+    <p id="p-27" num="27">[0024<confidence value="5">]</confidence>
+       It is noted that in an alternative aspect, the context data <part-num-ref name="context data">150</part-num-ref>
+ can be added according to a common data model that supports various structured data hierarchies in the system <part-num-ref name="system">100</part-num-ref>
+ or across an enterprise. Thus, context data <part-num-ref name="enterprise. Thus, context data">150</part-num-ref>
+ may be added during one or more phases of event processing that may be associated with an area or portion of the common data model. Such interactions with the model can be employed as context data <part-num-ref name="model can be employed as context data">150</part-num-ref>
+ for the given event <part-num-ref name="given event">120,</part-num-ref>
+ where all interactions with the common data model can be subsequently collected and analyzed at the aggregator <part-num-ref name="aggregator">130</part-num-ref>
+ or analyzed via the report generation and data mining services <part-num-ref name="report generation and data mining services">140.</part-num-ref>
+ The common data model that can be employed <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+in conjunction with the context data <part-num-ref name="context data">150</part-num-ref>
+ will be described in more detail below. In another aspect, the system <part-num-ref name="system">100</part-num-ref>
+ can include a data generator for an industrial control system. This includes means for generating at least one event condition <part-num-ref name="industrial control system. This includes means for generating at least one event condition">120</part-num-ref>
+ in an industrial control system (e.g., control system component <part-num-ref name="control system component">110)</part-num-ref>
+ and means for supplementing the alarm or event condition with context data <part-num-ref name="alarm or event condition with context data">150</part-num-ref>
+ (e.g., component <part-num-ref name="component">120</part-num-ref>
+ or interface 160). This can also include means for aggregating (e.g., component <part-num-ref name="component">130)</part-num-ref>
+ the context data <part-num-ref name="context data">150</part-num-ref>
+ in the system <part-num-ref name="system">100</part-num-ref>
+ and means for generating a report (e.g., component <part-num-ref name="component">140)</part-num-ref>
+ in the system from the context data.    </p>
+    <p id="p-28" num="28">[0025<confidence value="5">]</confidence>
+       Fig. 2 illustrates example data context additions to event messages. At <part-num-ref name="illustrates example data context additions to event messages. At">200,</part-num-ref>
+ an event message is generated from a control component, where initially the message may include a message name, machine name, and time stamp for when the message was generated. Event messages can be alarms or based on some detected condition such as a program overflow. After generation of the initial message <part-num-ref name="initial message">200,</part-num-ref>
+ context data <part-num-ref name="initial message 200, context data">210</part-num-ref>
+ can be added or provided as a supplement to the original message <part-num-ref name="original message">200.</part-num-ref>
+    </p>
+    <p id="p-29" num="29">Some examples of the context data <part-num-ref name="context data">210</part-num-ref>
+ are illustrated at <part-num-ref name="are illustrated at">220.</part-num-ref>
+ These examples can include source information indicating where the control component was executing at the time of the original event message <part-num-ref name="original event message">200.</part-num-ref>
+ Source provides more information than just specifying a machine that generated a message. For example, a code module executable on a machine controller may be called by a plurality of other modules in a process. The code module may be the originator of the event message <part-num-ref name="event message">200</part-num-ref>
+ yet it may be more relevant to know which other module actually called the code module. Thus, appending source or process information as context data <part-num-ref name="code module. Thus, appending source or process information as context data">210</part-num-ref>
+ can facilitate troubleshooting and documenting the event message <part-num-ref name="event message">200</part-num-ref>
+ in a more precise/efficient manner.    </p>
+    <p id="p-30" num="30">[0026<confidence value="5">]</confidence>
+       Other context data examples 220 can include appending information about the underlying code modules executing a given process. This can include program information relating to the logic or SFC that was involved in the message <part-num-ref name="message">200.</part-num-ref>
+ Other examples <part-num-ref name="message 200. Other examples">220</part-num-ref>
+ include step, recipe, batch, or phase information that can similarly be appended to the event message <part-num-ref name="event message">200</part-num-ref>
+ as context data <part-num-ref name="as context data">210.</part-num-ref>
+ For example, in a batch process, if a controller were to generate the event message <part-num-ref name="event message">200,</part-num-ref>
+ a batch server coupled to the <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+controller could append step, phase, batch, and/or recipe related information at <part-num-ref name="controller could append step, phase, batch, and/or recipe related information at">210</part-num-ref>
+ that was available at the time and/or after generation of the event message <part-num-ref name="event message">200.</part-num-ref>
+ Another example <part-num-ref name="event message 200. Another example">220</part-num-ref>
+ includes user information that can be generated as context data <part-num-ref name="includes user information that can be generated as context data">210.</part-num-ref>
+ This can include information relating to what users were accessing a machine at the time or after an event message <part-num-ref name="event message">200</part-num-ref>
+ was generated. This can also include annotations that have been applied as context data from one or more users as will be described in more detail below.    </p>
+    <p id="p-31" num="31">[0027<confidence value="5">]</confidence>
+       Fig. 3 illustrates supplemental data being added to an event message over the lifetime of the message. At <part-num-ref name="message. At">300,</part-num-ref>
+ an initial alarm or event message is generated by some component in a control system. At <part-num-ref name="control system. At">310,</part-num-ref>
+ context data is updated for the event message by a user or system. For example, the initial system that generated the event message <part-num-ref name="event message">300</part-num-ref>
+ may have annotated information at <part-num-ref name="may have annotated information at">310</part-num-ref>
+ relating to the phase or batch process that was operational during or after the event was generated. Similarly, a user who was operating the phase or batch process may have their identification (e.g., name or number) appended to the event message <part-num-ref name="event message">300.</part-num-ref>
+ In another example, the user at <part-num-ref name="user at">310</part-num-ref>
+ may <confidence value="88">be</confidence>
+ the first one in a chain of users or systems to initially receive the event message <part-num-ref name="event message">300.</part-num-ref>
+    </p>
+    <p id="p-32" num="32">That user may then analyze the relevant data that has been generated thus far, append more data to the message at <part-num-ref name="message at">310,</part-num-ref>
+ and also indicate their identity at <part-num-ref name="message at 310, and also indicate their identity at">310</part-num-ref>
+ for later system logging and analysis.    </p>
+    <p id="p-33" num="33">[0028<confidence value="5">]</confidence>
+       As shown, a subsequent system or user may append data to the message <part-num-ref name="message">300</part-num-ref>
+ and this is illustrated at <part-num-ref name="and this is illustrated at">320.</part-num-ref>
+ Thus, as time goes by, other users or systems can annotate context data such as at <part-num-ref name="and this is illustrated at 320. Thus, as time goes by, other users or systems can annotate context data such as at">320.</part-num-ref>
+ These context annotations can continue through a user or system N illustrated at <part-num-ref name="user or system N illustrated at">330,</part-num-ref>
+ where N is represented as an integer. It is to be appreciated that context data can be updated in a concurrent manner or a serial manner as illustrated at <part-num-ref name="serial manner as illustrated at">310</part-num-ref>
+ through <part-num-ref name="through">330.</part-num-ref>
+ For example, the original message <part-num-ref name="original message">300</part-num-ref>
+ may be generated and subsequently annotated by a processor at <part-num-ref name="processor at">310.</part-num-ref>
+ This message <part-num-ref name="processor at 310. This message">300</part-num-ref>
+ may also alert a plurality of other users or systems causing them to begin to analyze the message event and context data <part-num-ref name="message event and context data">310,</part-num-ref>
+ if any thus far. These respective users and systems <part-num-ref name="message event and context data 310, if any thus far. These respective users and systems">320,</part-num-ref>
+ <part-num-ref name="message event and context data 310, if any thus far. These respective users and systems 320,">330</part-num-ref>
+ may have buffer copies of the original event message <part-num-ref name="original event message">300</part-num-ref>
+ and also any context data generated <boundary-data type="header">
+        <confidence value="8">9</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+thus far. From the buffered copies, context data can be generated and appended to the event in a parallel manner if desired. As can be appreciated, the last receiver or aggregator of such message event <part-num-ref name="last receiver or aggregator of such message event">300</part-num-ref>
+ can be tasked with appending/updating a final version of the event message with the latest copy of all annotations and context data 310- <part-num-ref name="latest copy of all annotations and context data 310-">330</part-num-ref>
+ that have taken place thus far. Other examples may include a more serial process where one system or user annotates context data which is followed by a subsequent system or user.    </p>
+    <p id="p-34" num="34">[0029<confidence value="5">]</confidence>
+       Referring now to Fig. 4, an example event processor and message annotator <part-num-ref name="example event processor and message annotator">400</part-num-ref>
+ is illustrated in accordance. An event detector <part-num-ref name="event detector">410</part-num-ref>
+ monitors or receives a plurality of event inputs at <part-num-ref name="plurality of event inputs at">414</part-num-ref>
+ to generate an event that drives an action component <part-num-ref name="action component">420.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">The action component 420 maps one or more maintenance/event actions to one or more of the event inputs <part-num-ref name="event inputs">414</part-num-ref>
+ and/or internally detected events that are described below.    </p>
+    <p id="p-36" num="36">Actions can include configuring a schema, annotating events with context data, and notifying a remote user of the detected events <part-num-ref name="detected events">414</part-num-ref>
+ via a communications component <part-num-ref name="communications component">430</part-num-ref>
+ providing web or other type data access, for example. Actions can include pushing data files such as an MPEG or JPEG file relating to the associated event, and subsequently employing such files as annotation or context data. Actions can also include automated actions such as ordering a device or component based on a detected event. Additionally, maintenance documentation or data can be provided to facilitate troubleshooting of a control system.    </p>
+    <p id="p-37" num="37">[0030<confidence value="5">]</confidence>
+       At 414, event inputs can include various types. External conditions can be monitored such as monitoring status or data from a remote network or back plane.    </p>
+    <p id="p-38" num="38">Internal data such as from components interfacing to a processor (e.g., memories, interrupts, busses, peripherals, latches, clocks and so forth) and associated data can be monitored for potential failures or irregularities. External data events or commands can be monitored and detected at <part-num-ref name="memories, interrupts, busses, peripherals, latches, clocks and so forth) and associated data can be monitored for potential failures or irregularities. External data events or commands can be monitored and detected at">414.</part-num-ref>
+ This can include remote network commands to request status and/or to initiate data upgrades such as documentation or firmware. As noted above, range data (external or internal) can be monitored for values that fall outside of a predetermined range. Other type data that can be monitored at <part-num-ref name="predetermined range. Other type data that can be monitored at">414</part-num-ref>
+ include fault data or <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+bits from diagnostic routines that may be running as part of background operations. In addition, maintenance data can be detected such that at predetermined time or date intervals, events can be triggered such as ordering and/or replacing system components on a routine basis or schedule.    </p>
+    <p id="p-39" num="39">[0031<confidence value="5">]</confidence>
+       In addition to the event inputs <part-num-ref name="event inputs">414,</part-num-ref>
+ the event detector <part-num-ref name="event detector">410</part-num-ref>
+ can determine internally generated events at <part-num-ref name="can determine internally generated events at">440</part-num-ref>
+ based upon implied or inferred conditions of system health. This can include inference, statistical, and<confidence value="5">/</confidence>
+ or probability analysis at <part-num-ref name="based upon implied or inferred conditions of system health. This can include inference, statistical, and/ or probability analysis at">450</part-num-ref>
+ for a subset of data or inputs that is monitored for routine or modeled patterns over time. If the data subset deviates from the determined pattern, internal events can be fired that invoke one or more actions in the action component <part-num-ref name="action component">420</part-num-ref>
+ such as a notification to a remote user.    </p>
+    <p id="p-40" num="40">Data patterns can be determined in accordance with a plurality of techniques. A statistical analysis of data or inputs can include substantially any technique such as averaging, standard deviations, comparisons, sampling, frequency, periodicity and so forth.</p>
+    <p id="p-41" num="41">[0032<confidence value="5">]</confidence>
+       Referring to Fig. 5, a system <part-num-ref name="system">500</part-num-ref>
+ illustrates report generation and data mining aspects. Proceeding to <part-num-ref name="illustrates report generation and data mining aspects. Proceeding to">510,</part-num-ref>
+ context data is generated from multiple sources, interfaces, and/or users. This includes substantially any event or alarm that has been generated by a controller, communications module, intelligent module, server, client, and so forth. As noted above, users can employ one or more interfaces to apply annotations as context data <part-num-ref name="controller, communications module, intelligent module, server, client, and so forth. As noted above, users can employ one or more interfaces to apply annotations as context data">510.</part-num-ref>
+ At <part-num-ref name="controller, communications module, intelligent module, server, client, and so forth. As noted above, users can employ one or more interfaces to apply annotations as context data 510. At">520,</part-num-ref>
+ the events and associated context data <part-num-ref name="events and associated context data">510</part-num-ref>
+ is collected via an aggregator. This collection of data at <part-num-ref name="aggregator. This collection of data at">520</part-num-ref>
+ could be in a database (e.g., SQL), temporary computer file, system cache, PLC memory, network device memory, and so forth. At <part-num-ref name="SQL), temporary computer file, system cache, PLC memory, network device memory, and so forth. At">530,</part-num-ref>
+ one or more components can be employed to automatically generate reports. This can include the ability to query and filter the aggregator <part-num-ref name="aggregator">520</part-num-ref>
+ for a desired report type or format. For example, this could include the ability to generate a report such as "Create report showing all events annotated by user X" or "Create report showing all events where user Y participated in the process that generated the event" or "Create report showing all events from process A" or "Create reports from all events from machine C but hide those events generated during phase sequence A." <boundary-data type="header">
+        <confidence value="88">11</confidence>
+      </boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+[0033<confidence value="5">]</confidence>
+       At <part-num-ref name="event&quot; or &quot;Create report showing all events from process A&quot; or &quot;Create reports from all events from machine C but hide those events generated during phase sequence A.&quot; [0033]       At">540,</part-num-ref>
+ a data mining component can be provided to enable higher level analysis of context data and for performing such activities as trend analysis, quality analysis or management analysis and so forth. The data mining component <part-num-ref name="data mining component">540</part-num-ref>
+ could employ some form of On Line Analytical Processing or OLAP that is generally applied to applications that perform multidimensional analysis which facilitates data or information to be viewed and manipulated in a more intuitive manner. For instance, in a control application, OLAP users can observe a set of performance data in many different forms without expending great software design resources. This behavior is facilitated via OLAP files or cubes that model data in multiple dimensions. A dimension is the classification of some activity in an organization or other structure with which one can measure a parameter such as a goal or business success. For example, users can track output data against product or controller data over a given period of time.    </p>
+    <p id="p-42" num="42">[0034<confidence value="5">]</confidence>
+       Generally, there are two types of dimensions that applications can employ, regular dimensions and measures dimensions. Regular dimensions refer to the items of data that users desire to measure, for example, if an application was designed to control production output items. Another dimension includes time, such as where do these products stand now with respect to last year or last month. Measures dimensions are the numbers that appear in the analysis depending on the elements chosen from the regular dimensions. For example in a production cube, one may want to track revenue, cost, units sold, discounts, and so forth. When such data has been collected at <part-num-ref name="production cube, one may want to track revenue, cost, units sold, discounts, and so forth. When such data has been collected at">520</part-num-ref>
+ and analyzed at <part-num-ref name="and analyzed at">540,</part-num-ref>
+ the data may be assigned to a highly sophisticated structure referred to as a multidimensional cube, where the cube can reside in a specialized database or as a standalone file. The cube allows users to observe data in a plurality of different forms.    </p>
+    <p id="p-43" num="43">Thus, applications can cross the respective dimensions of the cube to obtain new information which hopefully should answer questions that users may be searching for - in this example information relating to one or more aspects of a control system or enterprise as it pertains to the context data.</p>
+    <p id="p-44" num="44">[0035<confidence value="5">]</confidence>
+       Fig. 6 illustrates an example system <part-num-ref name="example system">600,</part-num-ref>
+ network and user interface that can be employed with a context data <part-num-ref name="context data">610.</part-num-ref>
+ As shown, the context data <part-num-ref name="context data">610</part-num-ref>
+ can be applied <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+via one or more control components <part-num-ref name="can be applied via one or more control components">620</part-num-ref>
+ and user interface <part-num-ref name="and user interface">630.</part-num-ref>
+ The control components <part-num-ref name="control components">620</part-num-ref>
+ and interface <part-num-ref name="and interface">630</part-num-ref>
+ can communicate across a network <part-num-ref name="network">640</part-num-ref>
+ with one or more remote server applications. The control components <part-num-ref name="control components">620</part-num-ref>
+ can include various computer or network components such as servers, clients, programmable logic controllers (PLCs), communications modules, mobile computers, wireless components, control components and so forth which are capable of interacting across the network <part-num-ref name="network">640.</part-num-ref>
+ Similarly, the term PLC as used herein can include functionality that can be shared across multiple components, systems, and or networks <part-num-ref name="term PLC as used herein can include functionality that can be shared across multiple components, systems, and or networks">640.</part-num-ref>
+ For example, one or more PLCs can communicate and cooperate with various network devices across the network <part-num-ref name="network">640.</part-num-ref>
+ This can include substantially any type of control, communications module, computer, I/O device, sensor, Human Machine Interface (HMI)) such as the user interface <part-num-ref name="user interface">630</part-num-ref>
+ that communicate via the network <part-num-ref name="network">640</part-num-ref>
+ which includes control, automation, and/or public networks. The PLC can also communicate to and control various other devices such as Input/Output modules including Analog, Digital, Programmed/Intelligent I/O modules, other programmable controllers, communications modules, sensors, output devices, and the like.    </p>
+    <p id="p-45" num="45">[0036<confidence value="5">]</confidence>
+       The network <part-num-ref name="network">640</part-num-ref>
+ can include public networks such as the Internet, Intranets, and automation networks such as Control and Information Protocol (CIP) networks including DeviceNet and ControlNet. Other networks include Ethernet, DH/DH+, Remote I/O, Fieldbus, Modbus, Profibus, wireless networks, serial protocols, and so forth. In addition, the network devices can include various possibilities (hardware and/or software components). These include components such as switches with virtual local area network (VLAN) capability, LANs, WANs, proxies, gateways, routers, firewalls, virtual private network (VPN) devices, servers, clients, computers, configuration tools, monitoring tools, and/or other devices.    </p>
+    <p id="p-46" num="46">[0037<confidence value="5">]</confidence>
+       Fig. 7 illustrates a context data annotation process <part-num-ref name="context data annotation process">700</part-num-ref>
+ for an industrial automation system. While, for purposes of simplicity of explanation, the methodology is shown and described as a series of acts, it is to be understood and appreciated that the methodology is not limited by the order of acts, as some acts may occur in different <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+orders and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be required to implement a methodology as described herein.    </p>
+    <p id="p-47" num="47">[0038<confidence value="5">]</confidence>
+       Proceeding to 710 of Fig. 7, event messages are generated. These can include events such as alarms or other messages that are generated such as a result of process control variable being out of range. At <part-num-ref name="result of process control variable being out of range. At">720,</part-num-ref>
+ context data is determined for the respective events generated at <part-num-ref name="respective events generated at">710.</part-num-ref>
+ This can include automated processes such as the PLC determining which portion of a batch or recipe that was executing when the event message was generated. Users can determine context such as generating comments describing an event that can later be analyzed.    </p>
+    <p id="p-48" num="48">[0039<confidence value="5">]</confidence>
+       At 730, the context data determined at <part-num-ref name="context data determined at">720</part-num-ref>
+ is appended or added to the event message generated at <part-num-ref name="event message generated at">710.</part-num-ref>
+ This can include automatic appendages such as via a PLC controller and/or include manual annotations such as a user interface that can process the event message from a network database or other component. At <part-num-ref name="network database or other component. At">740,</part-num-ref>
+ event messages are aggregated into a database or other storage medium. From such database, various forms of analysis and tools can be applied at <part-num-ref name="database or other storage medium. From such database, various forms of analysis and tools can be applied at">750.</part-num-ref>
+ This can include report generators that provide reports based on one or more queries or filter conditions.    </p>
+    <p id="p-49" num="49">Analysis can also include substantially any type of software post processing that is applied to the aggregated data including data mining tools.</p>
+    <p id="p-50" num="50">[0040<confidence value="5">]</confidence>
+       Figs. 8-11 illustrate aspects of a common data model noted above that can be employed as part of an annotation chain for processing event messages. Thus, depending at what portion of the data model that an event message has been processed or been exposed to, annotations for such exposure to the model can be automatically generated and applied as context data from one or more portions of the model. For example, if an event message had traveled though an area computer or database, an work center computer or database, an equipment module and so forth, context data could be added for one or more of the portions or layers that the event message had been <boundary-data type="header">
+        <confidence value="88">14</confidence>
+      </boundary-data>
+      <page-break num="15"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+processed by in accordance with the various components of the common data model as described in more detail below with respect to Figs. 8-11.    </p>
+    <p id="p-51" num="51">[0041<confidence value="5">]</confidence>
+       Now turning to Fig. 8, hierarchical representations that can be employed in connection with a schema employed by programmable logic controllers to facilitate use of a hierarchically structured data model are illustrated. The hierarchies illustrated in this figure relate to equipment hierarchies, which can be integrated with procedure hierarchies to generate a robust representation of An enterprise (which is incorporated within a schema for use in connection with industrial controllers and event message processing). A first hierarchy <part-num-ref name="first hierarchy">800</part-num-ref>
+ illustrates a representation of equipment within a plant given disparate processes. For instance, a hierarchy in accordance with a batch process can include a representation of an enterprise, site, area, process cell, unit, equipment module, and control module. In contrast, a hierarchical representation of equipment within a continuous process can include representations of an enterprise, site, area, production unit, continuous unit, equipment module, and control module. In still more detail, an enterprise can represent an entirety of a company, a site can represent a particular plant, an area can represent a portion of the plant, a process cell can include equipment utilized to complete a process, a unit can relate to a unit of machinery within the process cell, an equipment module can include a logical representation of portions of the unit, and the control module can include basic elements, such as motors, valves, and the like. Furthermore, equipment modules can include equipment modules and control modules can include control modules. Thus, as can be discerned from the figure, four disparate hierarchical representations can be employed to represent equipment within batch processes, continuous processes, discrete processes, and inventory.    </p>
+    <p id="p-52" num="52">[0042<confidence value="5">]</confidence>
+       A second hierarchy <part-num-ref name="second hierarchy">802</part-num-ref>
+ can be utilized that represents each of the aforementioned hierarchical representations. The hierarchy <part-num-ref name="hierarchy">802</part-num-ref>
+ can include representations of an enterprise, a site, an area, a work center, a work unit, an equipment module, and a control module. Thus, a common representation can be generated that adequately represents the hierarchy <part-num-ref name="hierarchy">800.</part-num-ref>
+ For purposes of consistent terminology, data objects can be associated with metadata indicating which type of process they are <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+associated with. Therefore, data objects can be provided to an operator in a form that is consistent with normal usage within such process. For example, batch operators can utilize different terminology than a continuous process operator (as shown by the hierarchy 800). Metadata can be employed to enable display of such data in accordance with known, conventional usage of such data. Thus, implementation of a schema in accordance with the hierarchy <part-num-ref name="hierarchy">802</part-num-ref>
+ will be seamless to operators. Furthermore, in another example, only a portion of such representation can be utilized in a schema that is utilized by a controller. For instance, it may be desirable to house equipment modules and control modules within a controller. In another example, it may be desirable to include data objects representative of work centers and work units within a controller (but not equipment modules or control modules). The claimed subject matter is intended to encompass all such deviations of utilizing the hierarchy <part-num-ref name="hierarchy">802</part-num-ref>
+ (or similar hierarchy) within a controller.    </p>
+    <p id="p-53" num="53">[0043<confidence value="5">]</confidence>
+       Referring to Fig. 9, standard hierarchies that can be utilized to represent procedures and equipment are illustrated. In particular, a hierarchy <part-num-ref name="hierarchy">900</part-num-ref>
+ represents procedures that can exist within a batch process. For instance, a procedure can relate to a high-level procedure, such as creation of a pharmaceutical drug, where such procedure data can be employed as context data. A unit procedure can be more specific, such as adding particular chemicals to a mix by way of a particular unit. A unit operation can be still more specific, and a phase can be yet more specific (relating to operation of low- level machines). For instance, a phase can relate to various states which can exist with respect to low-level equipment, such as stopping, starting, pausing a motor, opening and closing a valve, and the like. A hierarchy <part-num-ref name="hierarchy">902</part-num-ref>
+ relating to a representation of equipment in, for example, a batch process is displayed adjacent to the hierarchy <part-num-ref name="hierarchy">900.</part-num-ref>
+    </p>
+    <p id="p-54" num="54">[0044<confidence value="5">]</confidence>
+       Turning to Fig. 10, a hierarchy <part-num-ref name="hierarchy">1000</part-num-ref>
+ that represents one possible integration of the example hierarchies <part-num-ref name="example hierarchies">900</part-num-ref>
+ and <part-num-ref name="and">902</part-num-ref>
+ (Fig. 9). A unit (such as a work unit described in Fig. 8) can be associated with a procedure, a unit, an operation, and an equipment phase). Thus, the procedures, operation, and phase can be associated with a <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+particular work unit. An equipment phase can be associated with one or more equipment modules, and can be above a control module in the hierarchy.    </p>
+    <p id="p-55" num="55">[0045<confidence value="5">]</confidence>
+       Referring Briefly to Fig. 11, a hierarchy <part-num-ref name="hierarchy">1100</part-num-ref>
+ that can be utilized in connection with equipment control is illustrated. The hierarchy is substantially similar to that described above. As stated above, the hierarchies illustrated in Figs. 8-11 can be based upon a standard, such as ISA <part-num-ref name="standard, such as ISA">88,</part-num-ref>
+ ISA <part-num-ref name="standard, such as ISA 88, ISA">95,</part-num-ref>
+ or other standard. Any suitable representation that can be utilized to model an entirety of a plant, however, is contemplated. Further, the representations shown in these figures can be directly implemented into a controller. For instance, data objects in accordance with any portion of the hierarchies described in Figs. 8-11 can be existent within a controller, together with state machines that enable creation of such objects.    </p>
+    <p id="p-56" num="56">[0046<confidence value="5">]</confidence>
+       It is noted that the above messages and context data can be processed on various types of computing devices and resources, where some of these devices may be associated with an industrial control component and other devices associated with standalone or networked computing devices. Thus, computers can be provided to execute the above messages or associated data that include a processing unit, a system memory, and a system bus, for example. The system bus couples system components including, but not limited to, the system memory to the processing unit that can be any of various available processors. Dual microprocessors and other multiprocessor architectures also can be employed as the processing unit. Computers can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s). The remote computer(s) can be a personal computer, a server, a router, a network PC, a workstation, a microprocessor based appliance, a peer device or other common network node and the like, and typically includes many or all of the elements described relative to computer. Remote computers can be logically connected through a network interface and then physically connected via communication connection.    </p>
+    <p id="p-57" num="57">[0047<confidence value="5">]</confidence>
+       The systems described above employing the context data can include one or more client(s). The client(s) can be hardware and/or software (e.g., threads, processes, <boundary-data type="header">
+        <confidence value="88">17</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+      <boundary-data type="header">06AB208/ALBRP522US</boundary-data>
+computing/control devices). The systems can also include one or more server(s). The server(s) can also be hardware and/or software (e.g., threads, processes, computing/control devices). The servers can house threads to perform transformations by employing the authentication protocol, for example. One possible communication between a client and a server may be in the form of a data packet adapted to be transmitted between two or more computer processes.    </p>
+    <p id="p-58" num="58">[0048<confidence value="5">]</confidence>
+       What has been described above includes various exemplary aspects. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing these aspects, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible.    </p>
+    <p id="p-59" num="59">Accordingly, the aspects described herein are intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims.</p>
+    <p id="p-60" num="60">Furthermore, to the extent that the term "includes" is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term "comprising" as "comprising" is interpreted when employed as a transitional word in a claim.</p>
+    <boundary-data type="header">
+      <confidence value="88">18</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11536526.xml

@@ -0,0 +1,526 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11536526</doc-number>
+        <date>2006-09-28</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">RESOURCE-BASED EVENT TYPING IN A RULES SYSTEM</heading>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">[0001] The present invention relates in general to the field of computers and other data processing systems, including hardware, software and processes. More particularly, the present invention pertains to the management of the resources of a data processing system using rules that are resource-based.</p>
+    <p id="p-2" num="2">[0002] A computer system may have many resources as part of the system. These resources include both hardware (client computers, servers, printers, storage devices, etc.) as well as software (operating systems, applications, etc). Such resources are often given technical support by a central logic, which may include a rule system. Utilization of a rule in a rule system may be either through a "pull" or a "push".</p>
+    <p id="p-3" num="3">[0003] For an example of a "pull," consider Figure la. A resource <part-num-ref name="resource">102</part-num-ref>
+ is supported by a rule system <part-num-ref name="rule system">104,</part-num-ref>
+ which includes a rules logic <part-num-ref name="rules logic">106</part-num-ref>
+ that interacts with a rules database <part-num-ref name="rules database">108.</part-num-ref>
+    </p>
+    <p id="p-4" num="4">Assume for exemplary purposes that resource 102 is a server. Resource <part-num-ref name="server. Resource">102</part-num-ref>
+ "knows" that rule system <part-num-ref name="&quot;knows&quot; that rule system">104</part-num-ref>
+ has a rule in rules database <part-num-ref name="rule in rules database">108</part-num-ref>
+ related to how a Central Processing Unit (CPU) <part-num-ref name="Central Processing Unit (CPU)">110</part-num-ref>
+ in resource <part-num-ref name="in resource">102</part-num-ref>
+ is to be managed, but resource <part-num-ref name="is to be managed, but resource">102</part-num-ref>
+ does not "know" exactly how the CPU <part-num-ref name="CPU">110</part-num-ref>
+ is to be managed. Thus, resource <part-num-ref name="is to be managed. Thus, resource">102</part-num-ref>
+ will (step <part-num-ref name="will (step">1)</part-num-ref>
+ send a "pull" rule call to rule system <part-num-ref name="&quot;pull&quot; rule call to rule system">104,</part-num-ref>
+ asking rule system <part-num-ref name="&quot;pull&quot; rule call to rule system 104, asking rule system">104</part-num-ref>
+ to process the appropriate rule for managing the CPU <part-num-ref name="CPU">110.</part-num-ref>
+ Rule system <part-num-ref name="CPU 110. Rule system">104</part-num-ref>
+ uses a descriptor language, such as Web Services Description Language (WSDL), to understand what data can be "pulled" from resource <part-num-ref name="descriptor language, such as Web Services Description Language (WSDL), to understand what data can be &quot;pulled&quot; from resource">102</part-num-ref>
+ to process that requested rule. This data is then requested by the rule system <part-num-ref name="rule system">104</part-num-ref>
+ from the resource <part-num-ref name="resource">102</part-num-ref>
+ (i.e., "pulled" - step 2), resulting in the resource <part-num-ref name="resource">102</part-num-ref>
+ sending the appropriate input data (step <part-num-ref name="appropriate input data (step">3)</part-num-ref>
+ for the rule. Rule system <part-num-ref name="rule. Rule system">104</part-num-ref>
+ then uses the rules logic <part-num-ref name="rules logic">106</part-num-ref>
+ to apply the input data to the appropriate rule, and outputs the result data (step <part-num-ref name="result data (step">4)</part-num-ref>
+ to the resource <part-num-ref name="resource">102.</part-num-ref>
+    </p>
+    <boundary-data type="header">
+      <confidence value="86">RS</confidence>
+W920060108U<confidence value="5">S</confidence>
+1                      - 1 -    </boundary-data>
+    <p id="p-5" num="5">
+      <page-break num="2"/>
+[0004] For exemplary purposes shown in Figure <confidence value="5">l</confidence>
+a, then, assume that there is a rule in rules database <part-num-ref name="rule in rules database">108</part-num-ref>
+ that states "If CPU utilization exceeds 70% for three consecutive samplings, then disable low priority software processes." If CPU <part-num-ref name="that states &quot;If CPU utilization exceeds 70% for three consecutive samplings, then disable low priority software processes.&quot; If CPU">110</part-num-ref>
+ actually exceeds 70% utilization for three consecutive samplings, then after Steps 1-4 execute, low priority processing will be disabled, preventing them from using any of CPU 110's capacity.    </p>
+    <p id="p-6" num="6">[0005] The example described above is only exemplary. Specifically, such a rule may also apply to software resources. That is, consider the example of resource <part-num-ref name="example of resource">102</part-num-ref>
+ actually being a software program, rather than the server described above. This software program may "know" that discount pricing should be given to certain orders, but doesn't "know" any details about when such discounts should be given, or for how much. Thus, the resource <part-num-ref name="resource">102</part-num-ref>
+ will send a request (step <part-num-ref name="request (step">1)</part-num-ref>
+ for a rule about pricing to the rule system <part-num-ref name="rule system">104,</part-num-ref>
+ which will (using WSDL to determine what data can be pulled) pull data (step <part-num-ref name="rule system 104, which will (using WSDL to determine what data can be pulled) pull data (step">2)</part-num-ref>
+ regarding how large the order is. The resource <part-num-ref name="resource">102</part-num-ref>
+ will then respond with the order size (e.g., dollar amount), as shown in step <part-num-ref name="dollar amount), as shown in step">3.</part-num-ref>
+ The rule system <part-num-ref name="rule system">104</part-num-ref>
+ will then respond with how much the order should be discounted (step 4).    </p>
+    <p id="p-7" num="7">[0006] Another type of rule utilization is known as a "push" system. A "push" may be synchronous or asynchronous. Consider first a "synchronous push," as described in Figure <confidence value="5">l</confidence>
+b. In this scenario, the resource <part-num-ref name="resource">102</part-num-ref>
+ "knows" not only what rule it needs (from rules database 108), but resource <part-num-ref name="&quot;knows&quot; not only what rule it needs (from rules database 108), but resource">102</part-num-ref>
+ also knows what input parameters are needed for the needed rule. Thus, the resource <part-num-ref name="resource">102</part-num-ref>
+ concurrently sends a request for a particular rule in rules database <part-num-ref name="particular rule in rules database">108</part-num-ref>
+ as well as the necessary input data (step 1). The rule system <part-num-ref name="rule system">104</part-num-ref>
+ then uses rules logic <part-num-ref name="then uses rules logic">106</part-num-ref>
+ to apply the received input data to the requested rule from rules database <part-num-ref name="requested rule from rules database">108,</part-num-ref>
+ and sends the output data (which results from the input data being applied to the particular rule) to the resource <part-num-ref name="resource">102</part-num-ref>
+ (step 2). Note that while the systems shown in Figures <confidence value="5">l</confidence>
+a and <confidence value="5">l</confidence>
+b are similar, in Figure <confidence value="5">l</confidence>
+a, the rule system <part-num-ref name="rule system">104</part-num-ref>
+ subsequently goes back to the resource <part-num-ref name="resource">102</part-num-ref>
+ to ask for the additional information (shown in the "Pull for Value" Step <part-num-ref name="&quot;Pull for Value&quot; Step">2</part-num-ref>
+ in Figure <confidence value="4">l</confidence>
+a).    </p>
+    <boundary-data type="header">
+      <confidence value="86">RS</confidence>
+W920060108U<confidence value="54">S1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="8">2</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-8" num="8">
+      <page-break num="3"/>
+[0007] While Figure la and Figure <confidence value="5">l</confidence>
+b demonstrate differing "pull" and "synchronous push" systems, they are similar in that both systems described in Figures <confidence value="5">l</confidence>
+a-b permit a rules engine to query a resource for data. This is not the case, however, in an "asynchronous push" system.    </p>
+    <p id="p-9" num="9">[0008] Figure <confidence value="2">1</confidence>
+c describes such an "asynchronous push," in which data is pushed to the rule system <part-num-ref name="rule system">104,</part-num-ref>
+ but without a request for a particular rule. Unfortunately, this scenario is co<confidence value="88">mm</confidence>
+on in computer systems. That is, resources <part-num-ref name="particular rule. Unfortunately, this scenario is common in computer systems. That is, resources">102</part-num-ref>
+ routinely send a wide variety of event data to a central manager, which may include a rule system <part-num-ref name="rule system">104.</part-num-ref>
+ For example, if the resource <part-num-ref name="resource">102</part-num-ref>
+ is a server, then the event data may be for such disparate items as outside temperature, CPU utilization, page swapping, local time of day, clock speeds, number of users that are logged on, etc. This central manager and' its associated rule system <part-num-ref name="event data may be for such disparate items as outside temperature, CPU utilization, page swapping, local time of day, clock speeds, number of users that are logged on, etc. This central manager and' its associated rule system">104</part-num-ref>
+ does not "know" what to do with the event data that is received. More specifically, the rule system <part-num-ref name="rule system">104</part-num-ref>
+ does not know which rule in the rules database <part-num-ref name="rules database">108</part-num-ref>
+ is appropriate for the received asynchronous data.    </p>
+    <boundary-data type="header">RSW92006<confidence value="666">010</confidence>
+8US1                      - <confidence value="8">3</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-3">SUMMARY OF THE INVENTION</heading>
+    <p id="p-10" num="10">
+      <page-break num="4"/>
+[0009<confidence value="5">]</confidence>
+ To handle asynchronous data pushes describe above, the present invention presents a computer-implementable method, system and computer media for typing a resource-based event in a rule system. In one embodiment, the computer-implementable method includes the steps of<confidence value="5">:</confidence>
+ defining an event type according to a resource property that is associated with the event type; creating a resource definition that describes which one or more event type can occur in a resource; storing the resource definition in the rule system; receiving asynchronous data from a particular resource in the data processing system; correlating the asynchronous data with a particular rule that is associated with a resource definition for the particular resource; and applying the particular rule to the asynchronous data.    </p>
+    <p id="p-11" num="11">[0010<confidence value="5">]</confidence>
+   The above, as well as additional purposes, features, and advantages of the present invention will become apparent in the following detailed written description.    </p>
+    <boundary-data type="header">RSW92006<confidence value="6866885">0108US1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="8">4</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-12" num="12">
+      <page-break num="5"/>
+[0011] The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further purposes and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, where:    </p>
+    <p id="p-13" num="13">
+      <confidence value="5">[</confidence>
+0012] Figure <confidence value="4">l</confidence>
+a depicts a prior art "pull" rule call;    </p>
+    <p id="p-14" num="14">[0013] Figure <confidence value="5">l</confidence>
+b illustrates a prior art synchronous "push" rule call;    </p>
+    <p id="p-15" num="15">[0014<confidence value="5">]</confidence>
+ Figure <confidence value="45">lc</confidence>
+ depicts a prior art asynchronous "push" rule call;    </p>
+    <p id="p-16" num="16">
+      <confidence value="5">[</confidence>
+0015] Figure 2a depicts an asynchronous "push" rule call utilizing a Resource:Event Mapping Logic (REML);    </p>
+    <p id="p-17" num="17">[0016] Figure 2b is a flow-chart showing exemplary steps taken to create and utilize the <confidence value="86">RE</confidence>
+ML shown in Figure 2a;    </p>
+    <p id="p-18" num="18">[0017] Figure 3 depicts an exemplary client computer in which the present invention may implemented;</p>
+    <p id="p-19" num="19">[0018] Figure 4 illustrates an exemplary server from which software for executing the present invention may be deployed and/or implemented for the benefit of a user of the client computer shown in Figure 3;</p>
+    <p id="p-20" num="20">[0019] Figures 5a-b show a flow-chart of steps taken to deploy software capable of executing the steps shown and described in Figures 2a-b; and <boundary-data type="header">RSW92006<confidence value="6666884">0108US1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="8">5</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+[0020] Figures 6a-b show a flow-chart showing steps taken to execute the steps shown and described in Figures 2a-b using. an on-demand service provider.    </p>
+    <boundary-data type="header">RSW92006<confidence value="686">010</confidence>
+8US1                    - <confidence value="8">6</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <heading id="h-5">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT</heading>
+    <p id="p-21" num="21">
+      <page-break num="7"/>
+[0021] With reference now to Figure 2a, a exemplary utilization of a Resource:Event Mapping Logic (REML) <part-num-ref name="Resource:Event Mapping Logic (REML)">212</part-num-ref>
+ is presented. A resource <part-num-ref name="resource">202</part-num-ref>
+ pushes data to a rule system <part-num-ref name="rule system">204.</part-num-ref>
+ If resource <part-num-ref name="rule system 204. If resource">202</part-num-ref>
+ is a hardware resource, such as a server, then the data may be a CPU utilization rate, a page-swapping rate, a memory leakage level (amount of local dynamic memory that is unusable due to unnecessary data being stored in the local dynamic memory), etc. Similarly, if resource <part-num-ref name="local dynamic memory), etc. Similarly, if resource">202</part-num-ref>
+ is a software resource, then the data that is pushed to the rule system <part-num-ref name="rule system">204</part-num-ref>
+ may be data values that have been keyed in for execution by the software, the number of current users of the software, execution speed of the software, the frequency of data requests (if the resource <part-num-ref name="resource">202</part-num-ref>
+ is a database), etc. When rule system <part-num-ref name="database), etc. When rule system">204</part-num-ref>
+ receives the data from the resource <part-num-ref name="resource">202,</part-num-ref>
+ REML <part-num-ref name="resource 202, REML">212</part-num-ref>
+ "knows" (by monitoring a particular port, or by parsing a data packet header, etc.) that the data came from a particular resource <part-num-ref name="particular resource">202,</part-num-ref>
+ whether the data is synchronous or asynchronous (according to definitions for the particular resource <part-num-ref name="particular resource">202</part-num-ref>
+ stored in rule system <part-num-ref name="stored in rule system">204,</part-num-ref>
+ or by parsing the data packet header, etc.), and which rule in a rule database <part-num-ref name="rule database">208</part-num-ref>
+ can be used by that particular resource <part-num-ref name="can be used by that particular resource">202</part-num-ref>
+ for that type of data (as defined by a mapping table, not shown, that is available to REML 212).    </p>
+    <p id="p-22" num="22">[0022<confidence value="5">]</confidence>
+ For example, assume that resource 202 is a server that is routinely sending the utilization rate of its CPU <part-num-ref name="utilization rate of its CPU">210.</part-num-ref>
+ When these utilization readings data arrive (step <part-num-ref name="utilization rate of its CPU 210. When these utilization readings data arrive (step">1)</part-num-ref>
+ at rule system <part-num-ref name="at rule system">204,</part-num-ref>
+ REML <part-num-ref name="at rule system 204, REML">212</part-num-ref>
+ determines which rule (or rules) from rule database <part-num-ref name="determines which rule (or rules) from rule database">208</part-num-ref>
+ should be called for a specific resource <part-num-ref name="specific resource">202.</part-num-ref>
+ This determination is made by logic in REML <part-num-ref name="specific resource 202. This determination is made by logic in REML">212</part-num-ref>
+ that correlates a resource definition for resource <part-num-ref name="resource definition for resource">202</part-num-ref>
+ with event rules that are appropriate for the type of data received from resource <part-num-ref name="type of data received from resource">202</part-num-ref>
+ (as described in additional detail in Figure 2b). As shown in step <part-num-ref name="(as described in additional detail in Figure 2b). As shown in step">2,</part-num-ref>
+ REML <part-num-ref name="(as described in additional detail in Figure 2b). As shown in step 2, REML">212</part-num-ref>
+ then sends, along with the received utilization readings data, an instruction to rules logic <part-num-ref name="instruction to rules logic">206</part-num-ref>
+ to call a particular rule from rule database <part-num-ref name="particular rule from rule database">208,</part-num-ref>
+ and to input these received utilization readings data to the appropriate rule (step 3). The appropriate rule then sends an output from that rule to the resource <part-num-ref name="resource">202</part-num-ref>
+ (step 4). (Note that the rule may or may not output data, depending on whether an "if<confidence value="5">'</confidence>
+ <boundary-data type="header">RSW92006<confidence value="686">010</confidence>
+8US<confidence value="2">1</confidence>
+                       <confidence value="8">-</confidence>
+ <confidence value="8">7</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+condition is satisfied. That is, most rules will output data only "if<confidence value="5">'</confidence>
+ the appropriate input data from a specific resource <part-num-ref name="specific resource">202</part-num-ref>
+ is received for a rule in the rule system <part-num-ref name="rule system">204</part-num-ref>
+ that corresponds with that specific resource 202). Thus, rule system <part-num-ref name="that corresponds with that specific resource 202). Thus, rule system">204,</part-num-ref>
+ which may be part of a larger resource manager <part-num-ref name="larger resource manager">214,</part-num-ref>
+ is able to evaluate and filter numerous data from resources <part-num-ref name="larger resource manager 214, is able to evaluate and filter numerous data from resources">202</part-num-ref>
+ in order to appropriate a necessary rule. Note that REML <part-num-ref name="necessary rule. Note that REML">212</part-num-ref>
+ is described and presented as being part of rule system <part-num-ref name="is described and presented as being part of rule system">204</part-num-ref>
+ in a resource manager <part-num-ref name="resource manager">214.</part-num-ref>
+ However, REML <part-num-ref name="resource manager 214. However, REML">212</part-num-ref>
+ should be understood to be an exemplary description/presentation of rules logic that performs the processes described herein. Thus, the scope of the invention and the appended claims is not to be limited to a logic so named and confined within rule system <part-num-ref name="logic so named and confined within rule system">204,</part-num-ref>
+ but rather is understood to be a logic that is accessible to rule system <part-num-ref name="logic that is accessible to rule system">204</part-num-ref>
+ for the purposes described herein.    </p>
+    <p id="p-23" num="23">[0023] With reference now to Figure 2b, additional detail of how the REML <part-num-ref name="REML">212</part-num-ref>
+ is created and utilized is presented. After initiator block <part-num-ref name="is created and utilized is presented. After initiator block">216,</part-num-ref>
+ an event designer names event types, and determines what properties will be in each event type (block 218). For example, consider an event such as "outputting data that describes a server state." The event designer may give this event the name "server state," and then define data that is associated with "server state." Such data may include CPU utilization, page swap rate, processor temperature, number of logged-on users, etc. for that server resource <part-num-ref name="name &quot;server state,&quot; and then define data that is associated with &quot;server state.&quot; Such data may include CPU utilization, page swap rate, processor temperature, number of logged-on users, etc. for that server resource">202.</part-num-ref>
+    </p>
+    <p id="p-24" num="24">[0024] As shown in block 220, a resource definer creates a resource definition that describes what event types may occur in a resource, and what properties may be pulled (e.g., using WSDL, or an extension thereof) from that resource <part-num-ref name="extension thereof) from that resource">202</part-num-ref>
+ by a rule system <part-num-ref name="rule system">204.</part-num-ref>
+    </p>
+    <p id="p-25" num="25">These event types may evoke data, from resource 202, that can be classified as pulls, synchronous pushes, or asynchronous pushes (as defined above). Continue to assume, for exemplary purposes, that the resource <part-num-ref name="resource">202</part-num-ref>
+ is a server. The resource definition includes what events may occur in a resource <part-num-ref name="resource">202,</part-num-ref>
+ including the example "server state" described above. That is, the resource <part-num-ref name="resource">202</part-num-ref>
+ may be capable of experiencing one or more events, including the event of "outputting data that describes a server state." This capability is thus described in the resource definition. The resource definition also describes what properties may be pulled from that resource <part-num-ref name="resource definition also describes what properties may be pulled from that resource">202.</part-num-ref>
+ These properties may or <boundary-data type="header">RSW92006<confidence value="666">010</confidence>
+8US1                      - <confidence value="8">8</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+may not include all of the properties that are associated with a particular event type. That is, although the resource definition says that the server resource <part-num-ref name="server resource">202</part-num-ref>
+ may experience the event of "outputting data that describes a server state," only some of the data described in "server state" (described above with reference to block <part-num-ref name="data described in &quot;server state&quot; (described above with reference to block">218)</part-num-ref>
+ may be available from the server resource <part-num-ref name="server resource">202.</part-num-ref>
+ Nonetheless, only a portion of the data described in "server state" may be enough to invoke a call and execution of a rule, for the data-sending resource <part-num-ref name="data-sending resource">202,</part-num-ref>
+ by REML <part-num-ref name="data-sending resource 202, by REML">212.</part-num-ref>
+    </p>
+    <p id="p-26" num="26">[0025] As described in block 222, once the resource definition has been created by the resource definer (which, like the event designer, may be a person or an intelligent piece of hardware/software logic), the resource definition is loaded into the REML <part-num-ref name="REML">212</part-num-ref>
+ by the rule system <part-num-ref name="rule system">204,</part-num-ref>
+ which then waits for asynchronous data to be received (query block 224). Once this data is received from a resource <part-num-ref name="resource">202,</part-num-ref>
+ then the REML <part-num-ref name="REML">212</part-num-ref>
+ correlates the received data (resource parameters) with one or more appropriate rules (block 226). For example, if the REML <part-num-ref name="REML">212</part-num-ref>
+ determines that the data received describes CPU utilization in a particular server, then the REML <part-num-ref name="REML">212</part-num-ref>
+ "knows" that a particular rule from rules database <part-num-ref name="particular rule from rules database">208</part-num-ref>
+ should be used to evaluate this CPU utilization. Note that R<confidence value="5">E</confidence>
+ML <part-num-ref name="should be used to evaluate this CPU utilization. Note that REML">212</part-num-ref>
+ may also know which rules are for synchronous events and which are for asynchronous events. In one embodiment, REML <part-num-ref name="may also know which rules are for synchronous events and which are for asynchronous events. In one embodiment, REML">212</part-num-ref>
+ "knows" which rules are for synchronous/asynchronous events by a parameter found in the definition of the event type. Thus, if an asynchronous data is received (as described above), then only asynchronous event rules are evaluated for application, thus allowing optimized rule processing.    </p>
+    <p id="p-27" num="27">[0026] Thereafter, the appropriate rule is called by REML <part-num-ref name="appropriate rule is called by REML">212</part-num-ref>
+ for use by rules logic <part-num-ref name="for use by rules logic">206</part-num-ref>
+ (block 228). The appropriate rule is applied to the received data, and the resulting output data (if any, depending on whether an "if<confidence value="5">'</confidence>
+ condition has been satisfied, by the received data, in the called rule) is sent to the resource (block 230). The process ends at terminator block <part-num-ref name="process ends at terminator block">232.</part-num-ref>
+    </p>
+    <p id="p-28" num="28">[0027<confidence value="5">]</confidence>
+ With reference now to Figure 3, there is depicted a block diagram of an exemplary client computer <part-num-ref name="exemplary client computer">302,</part-num-ref>
+ in which the present invention may be utilized. Client <boundary-data type="header">RSW92006<confidence value="666">010</confidence>
+8US<confidence value="2">1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="8">9</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="10"/>
+computer <part-num-ref name="present invention may be utilized. Client computer">302</part-num-ref>
+ includes a processor unit <part-num-ref name="processor unit">304</part-num-ref>
+ that is coupled to a system bus <part-num-ref name="system bus">306.</part-num-ref>
+ A video adapter <part-num-ref name="video adapter">308,</part-num-ref>
+ which drives/supports a display <part-num-ref name="display">310,</part-num-ref>
+ is also coupled to system bus <part-num-ref name="display 310, is also coupled to system bus">306.</part-num-ref>
+    </p>
+    <p id="p-29" num="29">System bus 306 is coupled via a bus bridge <part-num-ref name="bus bridge">312</part-num-ref>
+ to an Input/Output (I/O) bus <part-num-ref name="Input/Output (I/O) bus">314.</part-num-ref>
+ An I/O interface <part-num-ref name="I/O interface">316</part-num-ref>
+ is coupled to I/O bus <part-num-ref name="is coupled to I/O bus">314.</part-num-ref>
+ I/O interface <part-num-ref name="is coupled to I/O bus 314. I/O interface">316</part-num-ref>
+ affords communication with various I/O devices, including a keyboard <part-num-ref name="keyboard">318,</part-num-ref>
+ a mouse <part-num-ref name="mouse">320,</part-num-ref>
+ a Compact Disk - Read Only Memory (CD-ROM) drive <part-num-ref name="Compact Disk - Read Only Memory (CD-ROM) drive">322,</part-num-ref>
+ a floppy disk drive <part-num-ref name="floppy disk drive">324,</part-num-ref>
+ and a flash drive memory <part-num-ref name="flash drive memory">326.</part-num-ref>
+ The format of the ports connected to I/<confidence value="4">O</confidence>
+ interface <part-num-ref name="ports connected to I/O interface">316</part-num-ref>
+ may be any known to those skilled in the art of computer architecture, including but not limited to Universal Serial Bus (USB) ports.    </p>
+    <p id="p-30" num="30">[0028] Client computer 302 is able to communicate with a service provider server <part-num-ref name="service provider server">402</part-num-ref>
+ via a network <part-num-ref name="network">328</part-num-ref>
+ using a network interface <part-num-ref name="network interface">330,</part-num-ref>
+ which is coupled to system bus <part-num-ref name="network interface 330, which is coupled to system bus">306.</part-num-ref>
+    </p>
+    <p id="p-31" num="31">Network 328 may be an external network such as the Internet, or an internal network such as an Ethernet or a Virtual Private Network (VPN). Using network <part-num-ref name="Virtual Private Network (VPN). Using network">328,</part-num-ref>
+ client computer <part-num-ref name="Virtual Private Network (VPN). Using network 328, client computer">302</part-num-ref>
+ is able to use the present invention to access service provider server <part-num-ref name="present invention to access service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-32" num="32">[0029] A hard drive interface <part-num-ref name="hard drive interface">332</part-num-ref>
+ is also coupled to system bus <part-num-ref name="is also coupled to system bus">306.</part-num-ref>
+ Hard drive interface <part-num-ref name="is also coupled to system bus 306. Hard drive interface">332</part-num-ref>
+ interfaces with a hard drive <part-num-ref name="hard drive">334.</part-num-ref>
+ In a preferred embodiment, hard drive <part-num-ref name="preferred embodiment, hard drive">334</part-num-ref>
+ populates a system memory <part-num-ref name="system memory">336,</part-num-ref>
+ which is also coupled to system bus <part-num-ref name="system memory 336, which is also coupled to system bus">306.</part-num-ref>
+ System memory is defined as a lowest level of volatile memory in client computer <part-num-ref name="lowest level of volatile memory in client computer">302.</part-num-ref>
+ This volatile memory may include additional higher levels of volatile memory (not shown), including but not limited to cache memory, registers, and buffers. Data that populates system memory <part-num-ref name="lowest level of volatile memory in client computer 302. This volatile memory may include additional higher levels of volatile memory (not shown), including but not limited to cache memory, registers, and buffers. Data that populates system memory">336</part-num-ref>
+ includes client computer 302's operating system (<confidence value="66">OS</confidence>
+) <part-num-ref name="includes client computer 302's operating system (OS)">338</part-num-ref>
+ and application programs <part-num-ref name="and application programs">344.</part-num-ref>
+    </p>
+    <p id="p-33" num="33">[0030] <confidence value="66">OS</confidence>
+ 338 includes a shell <part-num-ref name="shell">340,</part-num-ref>
+ for providing transparent user access to resources such as application programs <part-num-ref name="shell 340, for providing transparent user access to resources such as application programs">344.</part-num-ref>
+ Generally, shell <part-num-ref name="shell 340, for providing transparent user access to resources such as application programs 344. Generally, shell">340</part-num-ref>
+ is a program that provides an interpreter and an interface between the user and the operating system.  More specifically, shell <part-num-ref name="operating system.  More specifically, shell">340</part-num-ref>
+ executes commands that are entered into a command line user interface or from a file. Thus, shell <part-num-ref name="file. Thus, shell">340</part-num-ref>
+ (as it is called in UNIX<confidence value="5">@</confidence>
+), also called a command processor in Windows<confidence value="5">®</confidence>
+, is generally the highest level of the operating system <boundary-data type="header">
+        <confidence value="86">RS</confidence>
+W920060108U<confidence value="58">S1</confidence>
+                     <confidence value="6">-</confidence>
+ <confidence value="88">10</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+software hierarchy and serves as a command interpreter. The shell provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel <part-num-ref name="kernel">342)</part-num-ref>
+ for processing. Note that while shell <part-num-ref name="for processing. Note that while shell">340</part-num-ref>
+ is a text-based, line-oriented user interface, the present invention will equally well support other user interface modes, such as graphical, voice, gestural, etc.    </p>
+    <p id="p-34" num="34">[0031] As depicted, OS 338 also includes kernel <part-num-ref name="also includes kernel">342,</part-num-ref>
+ which includes lower levels of functionality for OS <part-num-ref name="also includes kernel 342, which includes lower levels of functionality for OS">338,</part-num-ref>
+ including providing essential services required by other parts of OS <part-num-ref name="also includes kernel 342, which includes lower levels of functionality for OS 338, including providing essential services required by other parts of OS">338</part-num-ref>
+ and application programs <part-num-ref name="and application programs">344,</part-num-ref>
+ including memory management, process and task management, disk management, and mouse and keyboard management.    </p>
+    <p id="p-35" num="35">[0032] Application programs 344 include a browser <part-num-ref name="browser">346.</part-num-ref>
+ Browser <part-num-ref name="browser 346. Browser">346</part-num-ref>
+ includes program modules and instructions enabling a World Wide Web (WWW) client (i.e., client computer <part-num-ref name="client computer">302)</part-num-ref>
+ to send and receive network messages to the Internet using HyperText Transfer Protocol (HTTP) messaging, thus enabling communication with service provider server <part-num-ref name="Internet using HyperText Transfer Protocol (HTTP) messaging, thus enabling communication with service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-36" num="36">[0033] Application programs 344 in client computer 302's system memory also include a Resource-Based Event Typing Program (RBETP) <part-num-ref name="Resource-Based Event Typing Program (RBETP)">348,</part-num-ref>
+ which includes code for implementing the processes described in Figures 2a-b. In one embodiment, client computer <part-num-ref name="processes described in Figures 2a-b. In one embodiment, client computer">302</part-num-ref>
+ is able to download RBETP <part-num-ref name="is able to download RBETP">348</part-num-ref>
+ from service provider server <part-num-ref name="from service provider server">402.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">[0034] The hardware elements depicted in client computer <part-num-ref name="hardware elements depicted in client computer">302</part-num-ref>
+ are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, client computer <part-num-ref name="present invention. For instance, client computer">302</part-num-ref>
+ may include alternate memory storage devices such as magnetic cassettes, Digital Versatile Disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.    </p>
+    <boundary-data type="header">RSW92006<confidence value="6866">0108</confidence>
+US1                      - 11 -    </boundary-data>
+    <p id="p-38" num="38">
+      <page-break num="12"/>
+[0035] As noted above, RBETP 348 can be downloaded to client computer <part-num-ref name="can be downloaded to client computer">302</part-num-ref>
+ from service provider server <part-num-ref name="from service provider server">402,</part-num-ref>
+ shown in exemplary form in Figure 4. Service provider server <part-num-ref name="from service provider server 402, shown in exemplary form in Figure 4. Service provider server">402</part-num-ref>
+ includes a processor unit <part-num-ref name="processor unit">404</part-num-ref>
+ that is coupled to a system bus <part-num-ref name="system bus">406.</part-num-ref>
+ A video adapter <part-num-ref name="video adapter">408</part-num-ref>
+ is also coupled to system bus <part-num-ref name="is also coupled to system bus">406.</part-num-ref>
+ Video adapter <part-num-ref name="is also coupled to system bus 406. Video adapter">408</part-num-ref>
+ drives/supports a display <part-num-ref name="display">410.</part-num-ref>
+ System bus <part-num-ref name="display 410. System bus">406</part-num-ref>
+ is coupled via a bus bridge <part-num-ref name="bus bridge">412</part-num-ref>
+ to an Input/Output (I/O) bus <part-num-ref name="Input/Output (I/O) bus">414.</part-num-ref>
+ An I/O interface <part-num-ref name="I/O interface">416</part-num-ref>
+ is coupled to I/O bus <part-num-ref name="is coupled to I/O bus">414.</part-num-ref>
+ I/O interface <part-num-ref name="is coupled to I/O bus 414. I/O interface">416</part-num-ref>
+ affords communication with various I/O devices, including a keyboard <part-num-ref name="keyboard">418,</part-num-ref>
+ a mouse <part-num-ref name="mouse">420,</part-num-ref>
+ a Compact Disk - Read Only Memory (CD-ROM) drive <part-num-ref name="Compact Disk - Read Only Memory (CD-ROM) drive">422,</part-num-ref>
+ a floppy disk drive <part-num-ref name="floppy disk drive">424,</part-num-ref>
+ and a flash drive memory <part-num-ref name="flash drive memory">426.</part-num-ref>
+ The format of the ports connected to I/O interface <part-num-ref name="ports connected to I/O interface">416</part-num-ref>
+ may be any known to those skilled in the art of computer architecture, including but not limited to Universal Serial Bus (USB) ports.    </p>
+    <p id="p-39" num="39">[0036] Service provider server 402 is able to communicate with client computer <part-num-ref name="is able to communicate with client computer">302</part-num-ref>
+ via network <part-num-ref name="via network">328</part-num-ref>
+ using a network interface <part-num-ref name="network interface">430,</part-num-ref>
+ which is coupled to system bus <part-num-ref name="network interface 430, which is coupled to system bus">406.</part-num-ref>
+ Access to network <part-num-ref name="network interface 430, which is coupled to system bus 406. Access to network">328</part-num-ref>
+ allows service provider server <part-num-ref name="allows service provider server">402</part-num-ref>
+ to execute and/or download RBETP <part-num-ref name="to execute and/or download RBETP">348</part-num-ref>
+ to client computer <part-num-ref name="to client computer">302.</part-num-ref>
+    </p>
+    <p id="p-40" num="40">[0037] System bus 406 is also coupled to a hard drive interface <part-num-ref name="hard drive interface">432,</part-num-ref>
+ which interfaces with a hard drive <part-num-ref name="hard drive">434.</part-num-ref>
+ In a preferred embodiment, hard drive <part-num-ref name="preferred embodiment, hard drive">434</part-num-ref>
+ populates a system memory <part-num-ref name="system memory">436,</part-num-ref>
+ which is also coupled to system bus <part-num-ref name="system memory 436, which is also coupled to system bus">406.</part-num-ref>
+ Data that populates system memory <part-num-ref name="system memory 436, which is also coupled to system bus 406. Data that populates system memory">436</part-num-ref>
+ includes service provider server 402's operating system <part-num-ref name="includes service provider server 402's operating system">438,</part-num-ref>
+ which includes a shell <part-num-ref name="shell">440</part-num-ref>
+ and a kernel <part-num-ref name="kernel">442.</part-num-ref>
+ Shell <part-num-ref name="kernel 442. Shell">440</part-num-ref>
+ is incorporated in a higher level operating system layer and utilized for providing transparent user access to resources such as application programs <part-num-ref name="higher level operating system layer and utilized for providing transparent user access to resources such as application programs">444,</part-num-ref>
+ which include a browser <part-num-ref name="browser">446,</part-num-ref>
+ and a copy of RBETP <part-num-ref name="copy of RBETP">348</part-num-ref>
+ described above, which can be deployed to client computer <part-num-ref name="described above, which can be deployed to client computer">302.</part-num-ref>
+    </p>
+    <p id="p-41" num="41">[0038<confidence value="5">]</confidence>
+ The hardware elements depicted in service provider server <part-num-ref name="hardware elements depicted in service provider server">402</part-num-ref>
+ are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, service provider server <part-num-ref name="present invention. For instance, service provider server">402</part-num-ref>
+ may include alternate memory storage devices such as flash drives, magnetic cassettes, Digital Versatile Disks <boundary-data type="header">
+        <confidence value="86">RS</confidence>
+W920060108U<confidence value="55">S1</confidence>
+                     <confidence value="8">-</confidence>
+ <confidence value="88">12</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+(DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.    </p>
+    <p id="p-42" num="42">[0039] Note further that, in a preferred embodiment of the present invention, service provider server <part-num-ref name="present invention, service provider server">402</part-num-ref>
+ performs all of the functions associated with the present invention (including execution of RBETP 348), thus freeing client computer <part-num-ref name="present invention (including execution of RBETP 348), thus freeing client computer">302</part-num-ref>
+ from using its resources.    </p>
+    <p id="p-43" num="43">[0040] It should be understood that at least some aspects of the present invention may alternatively be implemented in a computer-useable medium that contains a program product. Programs defining functions on the present invention can be delivered to a data storage system or a computer system via a variety of signal-bearing media, which include, without limitation, non-writable storage media (e.g., CD-ROM), writable storage media (e.g., hard disk drive, read/write CD ROM, optical media), and communication media, such as computer and telephone networks including Ethernet, the Internet, wireless networks, and like network systems. It should be understood, therefore, that such signal-bearing media when carrying or encoding computer readable instructions that direct method functions in the present invention, represent alternative embodiments of the present invention.  Further, it is understood that the present invention may be implemented by a system having means in the form of hardware, software, or a combination of software and hardware as described herein or their equivalent.</p>
+    <p id="p-44" num="44">Software Deployment <confidence value="5">[</confidence>
+0041] As described above, in one embodiment, the processes described by the present invention, including the functions of RBETP <part-num-ref name="functions of RBETP">348,</part-num-ref>
+ are performed by service provider server <part-num-ref name="functions of RBETP 348, are performed by service provider server">402.</part-num-ref>
+ Alternatively, RBETP <part-num-ref name="functions of RBETP 348, are performed by service provider server 402. Alternatively, RBETP">348</part-num-ref>
+ and the method described herein, and in particular as shown and described in Figures 2a-b, can be deployed as a process software from service provider server <part-num-ref name="process software from service provider server">402</part-num-ref>
+ to client computer <part-num-ref name="to client computer">302.</part-num-ref>
+ Still more particularly, process software for the method so described may be deployed to service provider server <part-num-ref name="method so described may be deployed to service provider server">402</part-num-ref>
+ by another service provider server (not shown).    </p>
+    <boundary-data type="header">RSW92006<confidence value="6866882">0108US1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="88">13</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-45" num="45">
+      <page-break num="14"/>
+[0042] Referring then to Figures 5a-b, step 500 begins the deployment of the process software. The first thing is to determine if there are any programs that will reside on a server or servers when the process software is executed (query block 502). If this is the case, then the servers that will contain the executables are identified (block 504). The process software for the server or servers is transferred directly to the servers' storage via File Transfer Protocol (FTP) or some other protocol or by copying though the use of a shared file system (block 506). The process software is then installed on the servers (block 508).    </p>
+    <p id="p-46" num="46">[0043] Next, a determination is made on whether the process software is to be deployed by having users access the process software on a server or servers (query block 510). If the users are to access the process software on servers, then the server addresses that will store the process software are identified (block 512).</p>
+    <p id="p-47" num="47">[0044] A determination is made if a proxy server is to be built (query block <part-num-ref name="proxy server is to be built (query block">514)</part-num-ref>
+ to store the process software. A proxy server is a server that sits between a client application, such as a Web browser, and a real server. It intercepts all requests to the real server to see if it can fulfill the requests itself<confidence value="5">.</confidence>
+ If not, it forwards the request to the real server.    </p>
+    <p id="p-48" num="48">The two primary benefits of a proxy server are to improve performance and to filter requests. If a proxy server is required, then the proxy server is installed (block 516). The process software is sent to the servers either via a protocol such as FTP or it is copied directly from the source files to the server files via file sharing (block 518). Another embodiment would be to send a transaction to the servers that contained the process software and have the server process the transaction, then receive and copy the process software to the server's file system. Once the process software is stored at the servers, the users via their client computers, then access the process software on the servers and copy to their client computers file systems (block 520). Another embodiment is to have the servers automatically copy the process software to each client and then run the installation program for the process software at each client computer. The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ then exits the process (terminator block 524).    </p>
+    <boundary-data type="header">RSW92006<confidence value="666">010</confidence>
+8US1                         - <confidence value="88">14</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-49" num="49">
+      <page-break num="15"/>
+[0045] In query step 526, a determination is made whether the process software is to be deployed by sending the process software to users via e-mail. The set of users where the process software will be deployed are identified together with the addresses of the user client computers (block 528). The process software is sent via e-mail to each of the users' client computers (block 530). The users then receive the e-mail (block <part-num-ref name="e-mail (block">532)</part-num-ref>
+ and then detach the process software from the e-mail to a directory on their client computers (block 534). The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ then exits the process (terminator block 524).    </p>
+    <p id="p-50" num="50">[0046<confidence value="5">]</confidence>
+ Lastly a determination is made as to whether the process software will be sent directly to user directories on their client computers (query block 536). If so, the user directories are identified (block 538). The process software is transferred directly to the user's client computer directory (block 540). This can be done in several ways such as but not limited to sharing of the file system directories and then copying from the sender's file system to the recipient user's file system or alternatively using a transfer protocol such as File Transfer Protocol (FTP). The users access the directories on their client file systems in preparation for installing the process software (block 542). The user executes the program that installs the process software on his client computer (block <part-num-ref name="process software on his client computer (block">522)</part-num-ref>
+ and then exits the process (terminator block 524).    </p>
+    <p id="p-51" num="51">VPN Deployment <confidence value="5">[</confidence>
+0047] The present software can be deployed to third parties as part of a service wherein a third party VPN service is offered as a sec<confidence value="8">u</confidence>
+re deployment vehicle or wherein a VPN is build on-demand as required for a specific deployment.    </p>
+    <p id="p-52" num="52">[0048<confidence value="5">]</confidence>
+ A virtual private network (VPN) is any combination of technologies that can be used to secure a connection through an otherwise unsecured or untrusted network. VPNs improve security and reduce operational costs. The VPN makes use of a public network, usually the Internet, to connect remote sites or users together. Instead of using a dedicated, real-world connection such as leased line, the VPN uses "virtual" connections <boundary-data type="header">RSW92006<confidence value="6666885">0108US1</confidence>
+                        <confidence value="8">-</confidence>
+ <confidence value="88">15</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+routed through the Internet from the company's private network to the remote site or employee. Access to the software via a VPN can be provided as a service by specifically constructing the VPN for purposes of delivery or execution of the process software (i.e.    </p>
+    <p id="p-53" num="53">the software resides elsewhere) wherein the lifetime of the VPN is limited to a given period of time or a given number of deployments based on an amount paid.</p>
+    <p id="p-54" num="54">[0049<confidence value="5">]</confidence>
+ The process software may be deployed, accessed and executed through either a remote-access or a site-to-site VPN. When using the remote-access VPNs the process software is deployed, accessed and executed via the secure, encrypted connections between a company's private network and remote users through a third-party service provider. The enterprise service provider (ESP) sets a network access server (NAS) and provides the remote users with desktop client software for their computers. The teleco<confidence value="8">m</confidence>
+muters can then dial a toll-free number or attach directly via a cable or DSL modem to reach the NAS and use their VPN client software to access the corporate network and to access, download and execute the process software.    </p>
+    <p id="p-55" num="55">[0050] When using the site-to-site VPN, the process software is deployed, accessed and executed through the use of dedicated equipment and large-scale encryption that are used to connect a company's multiple fixed sites over a public network such as the Internet.</p>
+    <p id="p-56" num="56">[0051] The process software is transported over the VPN via tunneling which is the process of placing an entire packet within another packet and sending it over a network.</p>
+    <p id="p-57" num="57">The protocol of the outer packet is understood by the network and both points, called runnel interfaces, where the packet enters and exits the network.</p>
+    <p id="p-58" num="58">Software Integration [0052] The process software which consists code for implementing the process described herein may be integrated into a client, server and network environment by providing for the process software to coexist with applications, operating systems and network <boundary-data type="header">RSW92006<confidence value="6866882">0108US1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="88">16</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+operating systems software and then installing the process software on the clients and servers in the environment where the process software will function.    </p>
+    <p id="p-59" num="59">[0053] The first step is to identify any software on the clients and servers including the network operating system where the process software will be deployed that are required by the process software or that work in conjunction with the process software. This includes the network operating system that is software that enhances a basic operating system by adding networking features.</p>
+    <p id="p-60" num="60">[0054] Next, the software applications and version numbers will be identified and compared to the list of software applications and version numbers that have been tested to work with the process software. Those software applications that are missing or that do not match the correct version will be upgraded with the correct version numbers.</p>
+    <p id="p-61" num="61">Program instructions that pass parameters from the process software to the software applications will be checked to ensure the parameter lists match the parameter lists required by the process software. Conversely parameters passed by the software applications to the process software will be checked to ensure the parameters match the parameters required by the process software. The client and server operating systems including the network operating systems will be identified and compared to the list of operating systems, version numbers and network software that have been tested to work with the process software. Those operating systems, version numbers and network software that do not match the list of tested operating systems and version numbers will be upgraded on the clients and servers to the required level.</p>
+    <p id="p-62" num="62">[0055] After ensuring that the software, where the process software is to be deployed, is at the correct version level that has been tested to work with the process software, the integration is completed by installing the process software on the clients and servers.</p>
+    <p id="p-63" num="63">On Demand <boundary-data type="header">RSW92006<confidence value="686">010</confidence>
+8US<confidence value="5">1</confidence>
+                         <confidence value="8">-</confidence>
+ <confidence value="88">17</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="18"/>
+[0056] The process software is shared, simultaneously serving multiple customers in a flexible, automated fashion. It is standardized, requiring little customization and it is scalable, providing capacity on demand in a pay-as-you-go model.    </p>
+    <p id="p-64" num="64">[0057<confidence value="5">]</confidence>
+ The process software can be stored on a shared file system accessible from one or more servers. The process software is executed via transactions that contain data and server processing requests that use CPU units on the accessed server. CPU units are units of time such as minutes, seconds, hours on the central processor of the server.    </p>
+    <p id="p-65" num="65">Additionally the assessed server may make requests of other servers that require CPU units. CPU units are an example that represents but one measurement of use. Other measurements of use include but are not limited to network bandwidth, memory utilization, storage utilization, packet transfers, complete transactions etc.</p>
+    <p id="p-66" num="66">[0058] When multiple customers use the same process software application, their transactions are differentiated by the parameters included in the transactions that identify the unique customer and the type of service for that customer. All of the CPU units and other measurements of use that are used for the services for each customer are recorded.</p>
+    <p id="p-67" num="67">When the number of transactions to any one server reaches a number that begins to affect the performance of that server, other servers are accessed to increase the capacity and to share the workload. Likewise when other measurements of use such as network bandwidth, memory utilization, storage utilization, etc. approach a capacity so as to affect performance, additional network bandwidth, memory utilization, storage etc. are added to share the workload.</p>
+    <p id="p-68" num="68">[0059] The measurements of use used for each service and customer are sent to a collecting server that sums the measurements of use for each customer for each service that was processed anywhere in the network of servers that provide the shared execution of the process software. The summed measurements of use units are periodically multiplied by unit costs and the resulting total process software application service costs are alternatively sent to the customer and or indicated on a web site accessed by the customer which then remits payment to the service provider.</p>
+    <boundary-data type="header">RSW92006<confidence value="6666882">0108US1</confidence>
+                        - 18 -    </boundary-data>
+    <p id="p-69" num="69">
+      <page-break num="19"/>
+[0060] In another embodiment, the service provider requests payment directly from a customer account at a banking or financial institution.    </p>
+    <p id="p-70" num="70">[0061] In another embodiment, if the service provider is also a customer of the customer that uses the process software application, the payment owed to the service provider is reconciled to the payment owed by the service provider to minimize the transfer of payments.</p>
+    <p id="p-71" num="71">[0062] With reference now to Figures 6a-b, initiator block 602 begins the On Demand process. A transaction is created than contains the unique customer identification, the requested service type and any service parameters that further, specif<confidence value="8">y</confidence>
+ the type of service (block 604). The transaction is then sent to the main server (block 606). In an On Demand environment the main server can initially be the only server, then as capacity is consumed other servers are added to the On Demand environment.    </p>
+    <p id="p-72" num="72">
+      <confidence value="5">[</confidence>
+0063] The server central processing unit (CPU) capacities in the On Demand environment are queried (block 608). The CPU requ<confidence value="8">i</confidence>
+rement of the transaction is estimated, then the servers available CPU capacity in the On Demand environment are compared to the transaction CPU requirement to see if there is sufficient CPU available capacity in any server to process the transaction (query block 610). If there is not sufficient server CPU available capacity, then additional server CPU capacity is allocated to process the transaction (block 612). If there was already sufficient Available CPU capacity then the transaction is sent to a selected server (block 614).    </p>
+    <p id="p-73" num="73">[0064] Before executing the transaction, a check is made of the remaining On Demand environment to determine if the environment has sufficient available capacity for processing the transaction. This environment capacity consists of such things as but not limited to network bandwidth, processor memory, storage etc. (block 616). If there is not sufficient available capacity, then capacity will be added to the On Demand environment (block 618). Next the required software to process the transaction is accessed, loaded into memory, then the transaction is executed (block 620).</p>
+    <boundary-data type="header">RSW9200<confidence value="6686">6010</confidence>
+8US<confidence value="5">1</confidence>
+                       <confidence value="8">-</confidence>
+ <confidence value="88">19</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+    <p id="p-74" num="74">
+      <page-break num="20"/>
+[0065] The usage measurements are recorded (block 622). The utilization measurements consist of the portions of those functions in the On Demand environment that are used to process the transaction. The usage of such functions as, but not limited to, network bandwidth, processor memory, storage and CPU cycles are what is recorded. The usage measurements are summed, multiplied by unit costs and then recorded as a charge to the requesting customer (block 624).    </p>
+    <p id="p-75" num="75">[0066<confidence value="5">]</confidence>
+ If the customer has requested that the On Demand costs be posted to a web site (query block 626), then they are posted (block 628). If the customer has requested that the On Demand costs be sent via e-mail to a customer address (query block 630), then these costs are sent to the customer (block 632). If the customer has requested that the On Demand costs be paid directly from a customer account (query block 634), then payment is received directly from the customer account (block 636). The On Demand process is then exited at terminator block <part-num-ref name="On Demand process is then exited at terminator block">638.</part-num-ref>
+    </p>
+    <p id="p-76" num="76">[0067] The present invention thus presents a computer-implementable method, system and computer media for typing a resource-based event in a rule system. In one embodiment, the computer-i<confidence value="5">m</confidence>
+plementable method includes the steps of<confidence value="5">:</confidence>
+ defining an event type according to a resource property that is associated with the event type; creating a resource definition that describes which one or more event type can occur in a resource;    </p>
+    <p id="p-77" num="77">storing the resource definition in a Resource:Event Mapping Logic (REML) in the rule system; receiving asynchronous data from a particular resource in the data processing system; utilizing the R<confidence value="5">E</confidence>
+ML to correlate the asynchronous data with a particular rule that is associated with a resource definition for the particular resource; and applying the particular rule to the asynchronous data. The resource definition may describe what property data can be pulled from the resource by the rule system. In one embodiment, in which a rules logic in the rule system manipulates the asynchronous data, in accordance with the particular rule, to produce an output, the computer-implementable method further comprises transmitting the output of the particular rule to the particular resource.    </p>
+    <p id="p-78" num="78">The computer-implementable method may also include the steps of selecting the particular rule from multiple rules that are authorized to be used by the particular <boundary-data type="header">RSW92006<confidence value="6666885">0108US1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="88">20</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+      <page-break num="21"/>
+resource; defining each of the multiple rules as being applicable for use on either a synchronous data or an asynchronous data, wherein the synchronous data includes a request for a particular rule, and wherein the asynchronous data does not specif<confidence value="8">y</confidence>
+ <confidence value="8">a</confidence>
+ particular rule to which received data is applied; determining if data received by the rule system is synchronous or asynchronous; and in response to determining that the data received by the rule system is asynchronous, searching the rule system only for rules that use asynchronous data as an input. The rule system may also be part of a resource manager that manages at least one resource in the data processing system.    </p>
+    <p id="p-79" num="79">[0068<confidence value="5">]</confidence>
+ Note further that, as described above, instructions used in each embodiment of a computer-usable medium may be deployed from a service provider to a user. This deployment may be made in an "on-demand" basis as described herein.    </p>
+    <p id="p-80" num="80">[0069] While the present invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention. Furthermore, as used in the specification and the appended claims, the term "computer" or "system<confidence value="5">"</confidence>
+ or "computer system" or "computing device" includes any data processing system including, but not limited to, personal computers, servers, workstations, network computers, main frame computers, routers, switches, Personal Digital Assistants (PDA's), telephones, and any other system capable of processing, transmitting, receiving, capturing and/or storing data.    </p>
+    <boundary-data type="header">RSW92006<confidence value="666">010</confidence>
+8US<confidence value="4">1</confidence>
+                      <confidence value="8">-</confidence>
+ <confidence value="88">21</confidence>
+ <confidence value="8">-</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11547569.xml

@@ -0,0 +1,655 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11547569</doc-number>
+        <date>2006-10-06</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">
+      <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957    </boundary-data>
+    <heading id="h-1">A PACKAGE ASSEMBLY, IN PARTICULAR A RETURNABLE TYPE</heading>
+    <heading id="h-2">PACKAGE ASSEMBLY</heading>
+    <p id="p-1" num="1">
+      <confidence value="8">D</confidence>
+ <confidence value="8">e</confidence>
+ <confidence value="8">s</confidence>
+ <confidence value="8">c</confidence>
+ <confidence value="8">r</confidence>
+ <confidence value="8">i</confidence>
+ <confidence value="8">p</confidence>
+ <confidence value="8">t</confidence>
+ <confidence value="8">i</confidence>
+ <confidence value="8">o</confidence>
+ <confidence value="8">n</confidence>
+ <boundary-data type="line-number">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+ The present invention relates to a returnable package, i.e. a package to be employed for goods transportation which can be re-used and/or sent back to the consignor once emptied of its contents, for subsequent loading.    </p>
+    <p id="p-2" num="2">
+      <boundary-data type="line-number">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+ It is known that the so-called "returnable packages" are widely used for transportation and/or storage of any type of goods and for example apply to the sector of the so-called industrial and service packaging (in <boundary-data type="line-number">15 </boundary-data>
+which sector the re-usable packages are employed to contain a plurality of items or smaller containers)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-3" num="3">In the general structure of these packages the presence of different constituent elements is provided, which <boundary-data type="line-number">20 </boundary-data>
+elements are mutually assembled around the product to be stored or transported or are first assembled and subsequently filled with the product.    </p>
+    <p id="p-4" num="4">It is also to be noted that the different types of <boundary-data type="line-number">25 </boundary-data>
+containers presently used in warehouses and/or in goods carriers, either if they are of the "disposable" type or of the "returnable" type, must meet predetermined requirements in terms of handiness (through use of lift trucks of different types) and in terms of structural <boundary-data type="line-number">30 </boundary-data>
+coherence.    </p>
+    <p id="p-5" num="5">In the first case, two or more packages disposed in horizontal side by side relationship with each other are required to be laterally grasped by particular <part-num-ref name="first case, two or more packages disposed in horizontal side by side relationship with each other are required to be laterally grasped by particular">35</part-num-ref>
+ types of lift trucks, currently referred to as "jaw <page-break num="2"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-2</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+lift trucks" which act on the side faces of the packages and press them against each other; in this manner friction generated on the side faces of the packages in mutual contact enables lifting and handling <boundary-data type="line-number">5 </boundary-data>
+of a coherent package assembly.    </p>
+    <p id="p-6" num="6">In the second case, a plurality of piled up         (or otherwise stored) packages  in a warehouse must be able to keep an intrinsic steadiness, avoiding slipping <boundary-data type="line-number">10 </boundary-data>
+and/or relative displacements between the piled up packages  (which  displacements  for  example  can  be generated in response to vibrations induced by passage of heavy transport means such as railway trucks or articulated lorries through the warehouses) that can <boundary-data type="line-number">15 </boundary-data>
+lead to clear risks of      collapse of the piled up packages, which will obviously have repercussions in terms of safety of the staff present in these working areas.    </p>
+    <p id="p-7" num="7">
+      <boundary-data type="line-number">20 </boundary-data>
+All packages that are presently most widely spread have very serious drawbacks as regards the different use <confidence value="8">s</confidence>
+ituations<confidence value="8">.</confidence>
+    </p>
+    <p id="p-8" num="8">For instance, since traditional "disposable packages" <boundary-data type="line-number">25  </boundary-data>
+(made  of  paperboard/expanded  polystyrene/wood)  are produced with materials having rather poor structural- strength features, they often force the goods that are to be   introduced thereinto to be oversized, so that the goods themselves must    bear either the    strong <boundary-data type="line-number">30 </boundary-data>
+lateral-compression stresses imposed by the "jaw" lift trucks, or the strong vertical-compression stresses resulting from piling up of several packaged items. It is therefore apparent that the intrinsic "mechanical inadequacy" of these traditional packages adversely <part-num-ref name="intrinsic &quot;mechanical inadequacy&quot; of these traditional packages adversely">35</part-num-ref>
+ affects the packaged products that will be much heavier <page-break num="3"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="585">-3-</confidence>
+      </boundary-data>
+than necessary and therefore more expensive.    </p>
+    <p id="p-9" num="9">In  addition, presently   known   containers  can  have insufficient cohesion   features under   conditions of <boundary-data type="line-number">5 </boundary-data>
+"multiple grip"    (i.e.  in  the  operating  conditions involving grasping and handling of several package rows that must also be superposed), above all when the packaged goods are very heavy and when a great number of packages must be handled by means of the so-called <boundary-data type="line-number">10 </boundary-data>
+jaw lift trucks. In fact, under these conditions the innermost containers must not be sufficiently retained by  friction   (which  friction   is  generated   as  a conse<confidence value="8">q</confidence>
+uence of the pressure exerted by the jaws of said lift truck) and therefore may have a tendency to slip <boundary-data type="line-number">15 </boundary-data>
+downwards; once more this involves important risks connected with the possibility of damaging the goods and impairing safety of the work environment.    </p>
+    <p id="p-10" num="10">It is to be noted that also the relative movements <boundary-data type="line-number">20 </boundary-data>
+between several packages can be dangerous not only during handling of same, but also when the packages are maintained under piling-up conditions (for example, in a shed or the loading     compartment of a transport means); in fact it is possible that,   due to different <boundary-data type="line-number">25 </boundary-data>
+factors   (particular shapes of the packaged      goods, particular vibration or   movement conditions of the transport means, and so on) the piled-up packages will tend to shift relative to each other.    </p>
+    <p id="p-11" num="11">
+      <boundary-data type="line-number">30 </boundary-data>
+A further drawback of the packages of known type (and more particularly the packages to be thrown away after use) is represented by waste disposal that has become a reason of serious worry both for social workers and for goods manufacturers; in fact, traditional "disposable" <part-num-ref name="reason of serious worry both for social workers and for goods manufacturers; in fact, traditional &quot;disposable&quot;">35</part-num-ref>
+ packages (consisting of box-shaped elements made of <page-break num="4"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="2">-</confidence>
+4 -      </boundary-data>
+paperboard inside which the goods are stored, which goods can be protected by a series of shock-resistant shells made of expanded polystyrene or the like) in addition to not being very performing from the point of <boundary-data type="line-number">5 </boundary-data>
+view of protection of the article of manufacture and of being much bulkier, are also of difficult disposal, above all in view of the recent rules (such as rules 94/62/EC, 2004/12/EC, by which the European Community states the targets for recovery      and recycling of <boundary-data type="line-number">10 </boundary-data>
+package waste until the year <part-num-ref name="year">2008,</part-num-ref>
+ or document "Green Paper - Integrated Product Policy" of February <part-num-ref name="year 2008, or document &quot;Green Paper - Integrated Product Policy&quot; of February">7,</part-num-ref>
+ <part-num-ref name="year 2008, or document &quot;Green Paper - Integrated Product Policy&quot; of February 7,">2001,</part-num-ref>
+ introducing the concept of product planning and package integration from a sustainability point of view)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-12" num="12">
+      <boundary-data type="line-number">15 </boundary-data>
+Therefore the present invention aims at providing a package  and  more   particularly  a  package  of  the returnable type capable of obviating the above stated limits.    </p>
+    <p id="p-13" num="13">
+      <boundary-data type="line-number">20 </boundary-data>
+In more detail the present invention aims at making available  a  returnable  package   that  is  able  to efficiently carry out structural tasks, so that it can absorb both "static" loads (occurring under piling-up and/or handling conditions) imposed by handling devices <boundary-data type="line-number">25 </boundary-data>
+such as jaw lift trucks or lift trucks of any other type, and "impulse" loads    originating from possible falls  and/or  shocks   (thus  avoiding  resorting  to oversizing  of   the   items   to   be   packaged  and transported)<confidence value="8">.</confidence>
+    </p>
+    <p id="p-14" num="14">
+      <boundary-data type="line-number">
+        <confidence value="88">30</confidence>
+      </boundary-data>
+ In addition, the present invention aims at providing a returnable package that, under conditions of mutual piling-up/side by side relationship with other packages of the same type forms a coherent assembly of high <part-num-ref name="coherent assembly of high">35</part-num-ref>
+ steadiness, or   in other words, does not tend to move <page-break num="5"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-5</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+from the piled-up/side by side relationship condition.    </p>
+    <p id="p-15" num="15">
+      <confidence value="5">I</confidence>
+t is also to be noted that the present invention aims at providing a returnable structural package enabling <boundary-data type="line-number">5 </boundary-data>
+exploitation   of the   logistic transportation   spaces (railway trucks, lorry trailers, and others) and/or <confidence value="6">.</confidence>
+    </p>
+    <p id="p-16" num="16">storage spaces   (vertical  saturation  of warehouses, sheds and so on) to be maximised; this aim can be achieved by minimising the "empty" spaces existing <boundary-data type="line-number">10 </boundary-data>
+between the package and the goods, and finally results in general abatement of the costs not only connected with the logistic aspects (increase in the number of the stored articles of manufacture per square metre and/or increase in the saturation coefficient of the <boundary-data type="line-number">15 </boundary-data>
+transport means), but also with the whole process concerning planning and manufacture of the package and even of the goods to be packaged therein.    </p>
+    <p id="p-17" num="17">A  still further aim    of the invention is to make <boundary-data type="line-number">20 </boundary-data>
+available a returnable package having such a geometry that an optimal use of the logistic spaces is allowed and at the same time relative displacements between several packages of the same type under conditions of mutual   piling-up/side   by   side  relationship   are <boundary-data type="line-number">25 </boundary-data>
+prevented, irrespective of the shape of the items contained in the packages and/or without considering possible external trouble factors.    </p>
+    <p id="p-18" num="18">A no less important aim of the invention is to conceive <boundary-data type="line-number">30 </boundary-data>
+a returnable package to be manufactured at low costs, with materials having a low environmental impact and a prolonged useful life, which is also of easy assembling and disassembling before and after use, and can be easily stored and transported in a reduced space.    </p>
+    <p id="p-19" num="19">
+      <confidence value="88">35</confidence>
+ <page-break num="6"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-6</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+The foregoing and further aims that will become more apparent in the following of the present description are substantially achieved by a returnable package having the features shown in one or more of the <boundary-data type="line-number">5 </boundary-data>
+appended claims<confidence value="5">.</confidence>
+    </p>
+    <p id="p-20" num="20">
+      <confidence value="5">B</confidence>
+y way of explanation of the present inventive idea, an embodiment of a returnable package in. accordance with the present invention will be given hereinafter by way <boundary-data type="line-number">10 </boundary-data>
+of   non-limiting   example  and   illustrated  in  the accompanying drawings, in which:    </p>
+    <p id="p-21" num="21">- Figs. la, <confidence value="2">1</confidence>
+b, 2a and 2b show exploded views of two different alternative embodiments of the package in accordance with the present invention;    </p>
+    <p id="p-22" num="22">
+      <boundary-data type="line-number">15 </boundary-data>
+- Fig. 3 is a side view of a package as shown in Fig. 1 or <part-num-ref name="or">2,</part-num-ref>
+ in an assembled arrangement;    </p>
+    <p id="p-23" num="23">- Fig. 4 shows a detail of the grip means associable with a first package, with a portion in chain line representing the   grip  means  of  a   second package <boundary-data type="line-number">20 </boundary-data>
+disposed close to the first one;    </p>
+    <p id="p-24" num="24">- Fig. 5 is a plan view of an element of the package in accordance with the present invention;</p>
+    <p id="p-25" num="25">- Fig. 6 is a side view of the element in Fig. 5;</p>
+    <p id="p-26" num="26">- Fig. 7 shows portion VII in Fig. 5 to an enlarged <boundary-data type="line-number">25 </boundary-data>
+scale; and - Figs. 8, <part-num-ref name="enlarged scale; and - Figs. 8,">9</part-num-ref>
+ and <part-num-ref name="and">10</part-num-ref>
+ show alternative embodiments of the grip means on the element in Fig. 5; and - Fig. 11 is a plan view of the element in Fig. 5 from the opposite direction than the one in Fig. <confidence value="68">5.</confidence>
+    </p>
+    <p id="p-27" num="27">
+      <boundary-data type="line-number">
+        <confidence value="88">30</confidence>
+      </boundary-data>
+ With  reference  to  the  accompanying   drawings, the package in accordance with the present invention is generally  identified  by   reference  numeral  <part-num-ref name="present invention is generally  identified  by   reference  numeral">1</part-num-ref>
+  and substantially  comprises  a  predetermined  number  of <part-num-ref name="predetermined  number  of">35</part-num-ref>
+ confining elements <part-num-ref name="confining elements">2</part-num-ref>
+ to be mutually and removably <page-break num="7"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-7</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+assembled to define a holding volume.    </p>
+    <p id="p-28" num="28">The confining elements 2 can be of any number and arrangement, provided they are adapted to contain at <boundary-data type="line-number">5 </boundary-data>
+least one given type of items or goods, and have a corresponding  number   of   interfacing  surfaces  2a designed to be in mutual contact when two or more packages <part-num-ref name="corresponding  number   of   interfacing  surfaces  2a designed to be in mutual contact when two or more packages">1</part-num-ref>
+ <confidence value="2">*</confidence>
+are under conditions of piling up and/or side by side relationship    (as it may happen during <boundary-data type="line-number">10 </boundary-data>
+handling of one or <confidence value="8">m</confidence>
+ore package rows or during storage in a shed, for example)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-29" num="29">Advantageously, the present package further comprises grip means <part-num-ref name="present package further comprises grip means">3,</part-num-ref>
+ present on the interfacing surfaces 2a of <boundary-data type="line-number">15 </boundary-data>
+the confining elements 2; this grip means <part-num-ref name="confining elements 2; this grip means">3</part-num-ref>
+ is disposed in a matrix scheme in turn defining directrices <part-num-ref name="matrix scheme in turn defining directrices">4</part-num-ref>
+ that extend so as to intersect at least one and preferably two directions of possible relative sliding that are mutually transverse and lie on the interfacing surfaces <boundary-data type="line-number">20  </boundary-data>
+2a.    </p>
+    <p id="p-30" num="30">In this manner, when two or more packages are disposed close  to  each  other   (at  least  at  one  of their interfacing surfaces 2a that substantially appear to be <boundary-data type="line-number">25 </boundary-data>
+the outer surfaces of the confining elements 2), the grip means <part-num-ref name="grip means">3</part-num-ref>
+ mutually interacts so as to prevent one of the two packages from sliding relative to the other.    </p>
+    <p id="p-31" num="31">The grip means also 3 generates additional constraining <boundary-data type="line-number">30 </boundary-data>
+reactions   with  respect  to  the  friction  reactions generated on the interfacing surfaces 2a; the relative orientation  of the   vectors  of   these  constraining actions resulting from mutual approaching of particular structures of. the grip means (to be described in the <part-num-ref name="">35</part-num-ref>
+ following) is advantageously connected with arrangement <page-break num="8"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-8</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+of the grip means along     the directrices <part-num-ref name="directrices">4</part-num-ref>
+ which, suitably set, will make  quite impossible any relative sliding between two packages <part-num-ref name="which, suitably set, will make  quite impossible any relative sliding between two packages">1</part-num-ref>
+ disposed close to each other along any <confidence value="5">,</confidence>
+direction lying in the contact plane of <boundary-data type="line-number">5 </boundary-data>
+the packages.    </p>
+    <p id="p-32" num="32">In   accordance  with  the   present   invention,   the directrices <part-num-ref name="directrices">4</part-num-ref>
+ comprise a predetermined number of angles and/or a predetermined number of curvilinear stretches <boundary-data type="line-number">10  </boundary-data>
+(circular,  elliptic   or  in   any  case   mixtilinear stretches, depending on specific requirements); these curvilinear  stretches  and/or   angles   are  suitably disposed in predetermined   successions; in addition, still in   accordance with   the present   invention  a <boundary-data type="line-number">15 </boundary-data>
+plurality of directrices <part-num-ref name="plurality of directrices">4</part-num-ref>
+ disposed in side by side relationship can be arranged, which directrices are preferably   mutually  parallel,   within   the   above mentioned matrix scheme.    </p>
+    <p id="p-33" num="33">
+      <boundary-data type="line-number">20 </boundary-data>
+In the accompanying figures there are some examples of these directrices where, in the different cases shown, it is possible to see several concentric circular lines or broken lines describing given angles; it is also possible that some or all of these lines will have <boundary-data type="line-number">25 </boundary-data>
+intersection points or, in other words, one and the same element belonging to   the grip means <part-num-ref name="grip means">3</part-num-ref>
+ can be simultaneously disposed on two or more directrices <part-num-ref name="can be simultaneously disposed on two or more directrices">4.</part-num-ref>
+    </p>
+    <p id="p-34" num="34">Conveniently, in order to exert the above mentioned <boundary-data type="line-number">30 </boundary-data>
+constraining reactions, t<confidence value="5">h</confidence>
+e grip means <part-num-ref name="grip means">3</part-num-ref>
+ comprises engagement  protrusions   3a   distributed  along   the directrices 4; the engagement protrusions 3a of a first package <part-num-ref name="first package">1</part-num-ref>
+ interface with the corresponding grip means <part-num-ref name="corresponding grip means">3</part-num-ref>
+ of a second package <part-num-ref name="second package">1</part-num-ref>
+ disposed       in  side by   side <part-num-ref name="disposed       in  side by   side">35</part-num-ref>
+ relationship    with   the    first    one,   generating <page-break num="9"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="58">-9</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+constraining   reactions   that   will   be   directed transversely of the directrices <part-num-ref name="directrices">4.</part-num-ref>
+    </p>
+    <p id="p-35" num="35">It is therefore apparent the a suitable arrangement of <boundary-data type="line-number">5 </boundary-data>
+the directrices <part-num-ref name="directrices">4</part-num-ref>
+ will give      rise to   constraining reactions such directed as to prevent relative sliding of the two packages in any direction on one of the two interfacing surfaces 2a.    </p>
+    <p id="p-36" num="36">
+      <boundary-data type="line-number">10 </boundary-data>
+From   a  structural point   of  view, the   engagement protrusions 3a have an extension axis emerging from one of said interfacing surfaces 2a and can have any shape provided   it  is   suitable   for   interfacing  with corresponding engagement protrusions 3a belonging to <boundary-data type="line-number">15 </boundary-data>
+another package <part-num-ref name="extension axis emerging from one of said interfacing surfaces 2a and can have any shape provided   it  is   suitable   for   interfacing  with corresponding engagement protrusions 3a belonging to another package">1.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">Advantageously,   in    order   to    facilitate   the handling/compacting/storage operations, self-centring means is also present which     is operatively active <boundary-data type="line-number">20 </boundary-data>
+between the grip means <part-num-ref name="grip means">3</part-num-ref>
+ of at least two packages <part-num-ref name="of at least two packages">1</part-num-ref>
+ disposed  in mutual   side by   side  relationship  or mutually piled up; conveniently, the      self-centring means is integrally formed at least on the engagement protrusions 3a to enable mutual interfacing of same. In <boundary-data type="line-number">25 </boundary-data>
+other   words,  the  conformation   of  the  engagement protrusions 3a can be defined in such a manner that the engagement  protrusions  3a  belonging   to  different packages can penetrate into each other at least partly and at the same time can spontaneously reach a steady <boundary-data type="line-number">30 </boundary-data>
+configuration capable of generating the appropriate constraining reactions.    </p>
+    <p id="p-38" num="38">According to an embodiment of the present invention, the engagement protrusions 3a have a tapered shape <part-num-ref name="tapered shape">35</part-num-ref>
+ along their extension axis; this tapered shape can <page-break num="10"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 10 -</boundary-data>
+result from a frustoconical configuration, a truncated- pyramid configuration or an at least partly spheroidal configuration. It will be appreciated that the just described shapes (given for purposes of illustration <boundary-data type="line-number">5  </boundary-data>
+and not   of limitation) enable achievement     of the technical effect of self-centring means, since two protrusion  arrays 3a thus shaped     can  be mutually approached and when the respective side surfaces of the protrusions come into contact, the protrusions will <boundary-data type="line-number">10  </boundary-data>
+guide each other so as to reach a precise positioning of the confining elements <part-num-ref name="confining elements">2</part-num-ref>
+ (and, as a result, of packages 1)<confidence value="8">.</confidence>
+    </p>
+    <p id="p-39" num="39">It is also possible for the self-centring means to be <boundary-data type="line-number">15  </boundary-data>
+made in other different ways and for the protrusions 3a to have different shapes; for instance, the engagement protrusions 3a can have a cylindrical shape along their extension axis.    </p>
+    <p id="p-40" num="40">
+      <boundary-data type="line-number">20  </boundary-data>
+To   further <confidence value="5">'</confidence>
+improve  coupling  between  two  packages disposed close to each other, the grip means <part-num-ref name="grip means">3</part-num-ref>
+ ca<confidence value="5">n</confidence>
+ further comprise engagement recesses 3b the shape of which matches that of the engagement protrusions 3a at least partly; advantageously, these engagement recesses <boundary-data type="line-number">25  </boundary-data>
+3b can be disposed along the direct<confidence value="787">ori</confidence>
+es <part-num-ref name="directories">4</part-num-ref>
+ preferably alternated with the engagement protrusions 3a (and in this manner can be engaged by the protrusions 3a of another package, thereby increasing steadiness of the mutual connection between two approached packages and <boundary-data type="line-number">30  </boundary-data>
+also further increasing the self-centring effect)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-41" num="41">The engagement recesses 3b can be merely defined in the space  included   between  at   least  two   engagement protrusions 3a or, depending on requirements, can be <part-num-ref name="space  included   between  at   least  two   engagement protrusions 3a or, depending on requirements, can be">35</part-num-ref>
+  formed in the confining elements      <part-num-ref name="confining elements">2</part-num-ref>
+ following more <page-break num="11"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="8">-</confidence>
+ <confidence value="66">11</confidence>
+ <confidence value="8">-</confidence>
+      </boundary-data>
+complicated structures; for instance, the engagement recesses 3b can have an extension axis entering the interfacing surface and preferably consist of a frusto- conical cavity, a cavity in the form of a truncated <boundary-data type="line-number">5 </boundary-data>
+pyra<confidence value="8">m</confidence>
+id or an at least partly spheroidal cavity (the shape of which can advantageously match that of the engagement protrusions 3a at least partly)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-42" num="42">Obviously, should the protrusions 3a be of cylindrical <boundary-data type="line-number">10 </boundary-data>
+shape, the engagement recesses 3b too will in turn consist of cylindrical cavities.    </p>
+    <p id="p-43" num="43">Gene rally, it is to be pointed out in any case that the grip  means <part-num-ref name="grip  means">3,</part-num-ref>
+ during the handling operations with <boundary-data type="line-number">15 </boundary-data>
+forklift trucks provided with jaws for multiple grip (or also of single grip    depending on the operating requirements)   ensures  fitting  coupling  of  several containers  disposed   in  side by   side  relationship preventing   downwards   sliding  of   the   containers <boundary-data type="line-number">20 </boundary-data>
+the<confidence value="8">m</confidence>
+selves during lifting.    </p>
+    <p id="p-44" num="44">The   protrusions  3a   and/or  recesses   3b  can   be advantageously disposed on concentric directrices 4 and can be distributed on the whole <confidence value="5">.</confidence>
+interfacing surface 2a <boundary-data type="line-number">25  </boundary-data>
+(or outer surface) of one or more confining elements <part-num-ref name="whole .interfacing surface 2a (or outer surface) of one or more confining elements">2.</part-num-ref>
+    </p>
+    <p id="p-45" num="45">In accordance with a further feature of the present invention, the grip means <part-num-ref name="grip means">3</part-num-ref>
+ is formed into groups of sectors 3c delimited by predetermined contours 3d; for <boundary-data type="line-number">30 </boundary-data>
+instance, with reference to the accompanying figures it is possible to see that these sectors 3c can be dist<confidence value="8">r</confidence>
+ibuted according to a given space scheme (to be dete<confidence value="8">r</confidence>
+mined   according  to  specific  requirements,  as detailed in the following) . Sectors    3c practically <part-num-ref name="following) . Sectors    3c practically">35</part-num-ref>
+ deli<confidence value="8">m</confidence>
+it the regions on the interfacing surfaces where <page-break num="12"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                                PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 12 -</boundary-data>
+the grip means <part-num-ref name="grip means">3</part-num-ref>
+ is located.    </p>
+    <p id="p-46" num="46">Within sectors 3c, the grip means <part-num-ref name="grip means">3</part-num-ref>
+ itself is disposed according to a matrix scheme that can be different for <boundary-data type="line-number">5 </boundary-data>
+each individual sector 3c or ideally repeated in each sector 3c; in order to ensure the greatest possibility of mutual approaching and engagement for two packages <part-num-ref name="greatest possibility of mutual approaching and engagement for two packages">1,</part-num-ref>
+ the matrix scheme described by the grip <confidence value="8">m</confidence>
+eans will be preferably the same for all sectors 3c of two <boundary-data type="line-number">10 </boundary-data>
+interfacing surfaces 2a designed to approach each other under piling up/packing conditions, in such a manner that <confidence value="8">m</confidence>
+utual meshing of two sectors accommodating a given distribution of protrusions 3a and/or recesses 3b does <confidence value="5">n</confidence>
+ot   hinder   a  simultaneous mutual meshing    of <boundary-data type="line-number">15 </boundary-data>
+different sectors 3c. The edges 3d can have any shape (see the accompanying figures, for example), depending on requirement<confidence value="88">s.</confidence>
+    </p>
+    <p id="p-47" num="47">Optionally, the grip means <part-num-ref name="grip means">3</part-num-ref>
+ may comprise elongated <boundary-data type="line-number">20 </boundary-data>
+protrusions 3a disposed parallel to each other and preferably   gathered   within  suitably   located   and delimited sectors 3c. Within the scope of the present invention,   still   more   preferably   the   elongated protrusions 3e belonging to different sectors 3c are <boundary-data type="line-number">25 </boundary-data>
+parallel to each other, again for the purpose of improving mutual and simultaneous meshing of several protrusion/recess    sectors   present   on  the    same interfacing   surface   2a.   Conveniently,   the   just described elongated protrusions 3e operate     following <boundary-data type="line-number">30 </boundary-data>
+the same principle previously illustrated a<confidence value="5">n</confidence>
+d can be conce<confidence value="8">i</confidence>
+ved in <confidence value="8">s</confidence>
+uch a manner as to achieve        a self- centring effect.    </p>
+    <p id="p-48" num="48">Depending on the different types of items/goods to be <part-num-ref name="different types of items/goods to be">35</part-num-ref>
+ packaged, the confining elements <part-num-ref name="confining elements">2</part-num-ref>
+ can be of any number <page-break num="13"/>
+      <boundary-data type="header">WO 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 13 -</boundary-data>
+and conformation, and the grip means <part-num-ref name="grip means">3</part-num-ref>
+ can be disposed with  great  free<confidence value="8">d</confidence>
+om   of  choice   on  the  respective interfacing surfaces 2a of one or more of the confining elements 2a.    </p>
+    <p id="p-49" num="49">
+      <boundary-data type="line-number">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+ In  an  embodiment   of  the  present   invention,  the confining elements <part-num-ref name="confining elements">2</part-num-ref>
+ comprise at least one base element <part-num-ref name="comprise at least one base element">5</part-num-ref>
+ (that can be conveniently associated with a bottom portion or a top portion of an item to be packaged);    </p>
+    <p id="p-50" num="50">
+      <boundary-data type="line-number">10 </boundary-data>
+this base element 5 has a main wall 5a (designed to constitute  the  package   bottom  or  top)   having  a predetermined edge and secondary walls 5b emerging from the main wall <confidence value="5">5</confidence>
+a at the sides of said edge.    </p>
+    <p id="p-51" num="51">
+      <boundary-data type="line-number">15 </boundary-data>
+Conveniently, the grip means <part-num-ref name="grip means">3</part-num-ref>
+ is formed on the outer surfaces of the ma<confidence value="8">i</confidence>
+n wall 5a and/or the secondary walls 5b; for instance, in the accompanying figures it is possible to see t<confidence value="8">h</confidence>
+at on the main wall 5a there is the presence of grip means <part-num-ref name="presence of grip means">3</part-num-ref>
+ disposed in two <confidence value="7">c</confidence>
+oncentric <boundary-data type="line-number">20 </boundary-data>
+series of sectors 3d, in which the protrusions    3a are disposed on substantially circular directrices (ideally going on from one    sector to the other), while the secondary walls <confidence value="5">5</confidence>
+b have elongated protrusions 3e for<confidence value="788">ced</confidence>
+ into  groups    of   sectors   3c  having  quadrangu<confidence value="788">lar</confidence>
+ <boundary-data type="line-number">25  </boundary-data>
+(rectangular, for  example) edges 3d; these elongated protrusions 3e are disposed on the interfacing surface 2a of at least one of the secondary walls 5b and extend in a direction parallel to the edge of the main wall 5a.    </p>
+    <p id="p-52" num="52">
+      <boundary-data type="line-number">
+        <confidence value="88">30</confidence>
+      </boundary-data>
+ In more detail,    the  base   element  <part-num-ref name="base   element">5</part-num-ref>
+  comprises  a predetermined number of sectors 3c having grip means <part-num-ref name="predetermined number of sectors 3c having grip means">3</part-num-ref>
+ on the interfacing surface 2a of the main wall <confidence value="5">5</confidence>
+a (but it is also possible to <confidence value="2222">seti</confidence>
+ these sectors 3c on at least <part-num-ref name="main wall 5a (but it is also possible to seti these sectors 3c on at least">35</part-num-ref>
+ one secondary wa<confidence value="8">l</confidence>
+l, should it be necessary due        to <page-break num="14"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                                PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 14 -</boundary-data>
+specific require<confidence value="8">m</confidence>
+ents); conveniently, these sectors 3d are formally div<confidence value="8">i</confidence>
+ded into two groups the first of which comprises sectors disposed in the vicinity of the edge of the main wa<confidence value="52">l]</confidence>
+ <confidence value="6">5</confidence>
+a and the second of which comprises <boundary-data type="line-number">5 </boundary-data>
+sectors disposed    along an inner crown 5c arranged internally of t<confidence value="5">h</confidence>
+e edge of the main wall 5a and at a substantially centred position relative to said main wall.    </p>
+    <p id="p-53" num="53">
+      <boundary-data type="line-number">10 </boundary-data>
+It is to be pointed out that the just described arrangement  of   sectors  3d  is  advantageous  during manufacture of the main element <part-num-ref name="main element">5</part-num-ref>
+ (which element can be for example obta<confidence value="8">i</confidence>
+ned by moulding or injection moulding of plastic materials such as polypropylene or the <boundary-data type="line-number">15 </boundary-data>
+like); actually, this arrangement of the grip means <part-num-ref name="grip means">3</part-num-ref>
+ enables  balanc<confidence value="8">i</confidence>
+ng   of  the   material  masses  during formation of the workpiece thus ensuring flatness of the main wall 5a<confidence value="2">.</confidence>
+    </p>
+    <p id="p-54" num="54">
+      <boundary-data type="line-number">20 </boundary-data>
+It is to be pointed out that the achieved flatness enables a constant support to be obtained on at least three points of the package when the latter is handled on parallel conveyor belts; on the other hand, the presence of this type of "perfectly planar" support is <boundary-data type="line-number">25 </boundary-data>
+important in order to avoid package <part-num-ref name="presence of this type of &quot;perfectly planar&quot; support is important in order to avoid package">1</part-num-ref>
+ from rotating when it is ha<confidence value="8">n</confidence>
+dled by parallel rollers        (in other words,  the   just   described  feature   allows  axial advancing and c<confidence value="8">o</confidence>
+rrect front orientation of package <part-num-ref name="just   described  feature   allows  axial advancing and correct front orientation of package">1</part-num-ref>
+ relative to the <confidence value="8">r</confidence>
+oller conveyor or belt conveyor)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-55" num="55">
+      <boundary-data type="line-number">
+        <confidence value="88">30</confidence>
+      </boundary-data>
+ In a further a<confidence value="8">l</confidence>
+ternative embodiment of the present invention, the   base  element  <part-num-ref name="base  element">5</part-num-ref>
+  comprises elongated protrusions 3e disposed in sectors 3c having edges 3d of  <confidence value="5">q</confidence>
+uadrangula<confidence value="52">r-</confidence>
+  (rectangular,   for  example)  shape <part-num-ref name="comprises elongated protrusions 3e disposed in sectors 3c having edges 3d of  quadrangular-  (rectangular,   for  example)  shape">35</part-num-ref>
+ disposed in a matrix scheme on the interfacing surface <page-break num="15"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 15 -</boundary-data>
+2a of the main wall 5a; in this case the elongated protrusions 3e extend in a direction transverse to at least one side of one of the edges 3d (so that they appear to be directed paral<confidence value="8">l</confidence>
+el to a diagonal of the <boundary-data type="line-number">5 </boundary-data>
+main wall)<confidence value="8">.</confidence>
+    </p>
+    <p id="p-56" num="56">In order to better explai<confidence value="8">n</confidence>
+ the present invention, it is pointed out that by <confidence value="2222">thie</confidence>
+     term  "transverse" it is intended a direction or (real or ideal) line forming a <boundary-data type="line-number">10 </boundary-data>
+given angle different fro<confidence value="8">m</confidence>
+ zero with the edge or corner of the main wall 5a and/or of at least one of the secondary walls 5b.    </p>
+    <p id="p-57" num="57">For assembly of package <confidence value="5">1</confidence>
+, the base element <part-num-ref name="base element">5</part-num-ref>
+ further <boundary-data type="line-number">15 </boundary-data>
+comprises means <part-num-ref name="further comprises means">9</part-num-ref>
+ for co<confidence value="8">u</confidence>
+pling with    at least another confining element <part-num-ref name="for coupling with    at least another confining element">2</part-num-ref>
+ (that will preferably be an upright <part-num-ref name="upright">6</part-num-ref>
+ or a crosspiece or the like); this coupling means <part-num-ref name="like); this coupling means">9</part-num-ref>
+ will be of any type and may for example comprise a peripheral groove extend<confidence value="8">i</confidence>
+ng (at least partly) on the <boundary-data type="line-number">20 </boundary-data>
+edges of the secondary faces <confidence value="5">5</confidence>
+b opposite to the edge of the main wall <confidence value="5">5</confidence>
+a (and/or on the face of the main wall 5a opposite to the interfacing surface 2a), which in <confidence value="2">-</confidence>
+turn  is   designed   to   receive,   under  operating conditions, an engagement  abutment (belonging to the <boundary-data type="line-number">25 </boundary-data>
+upright <part-num-ref name="upright">6</part-num-ref>
+ or any other type of confining element <part-num-ref name="or any other type of confining element">2)</part-num-ref>
+ conforming in shape to the main wall itself at least partly.    </p>
+    <p id="p-58" num="58">In more detail as regards the embodiment of the package <boundary-data type="line-number">30 </boundary-data>
+shown in the figures, the uprights <part-num-ref name="uprights">6</part-num-ref>
+ can be interposed between two base elements <part-num-ref name="can be interposed between two base elements">5</part-num-ref>
+ so as to define a holding volume of a substantially prismatic shape and more preferably parallelepiped shape.    </p>
+    <p id="p-59" num="59">35 In this manner according to the present invention, a <page-break num="16"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                                PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 16 -</boundary-data>
+returnable package is obtained by use of an open "container" as the <confidence value="22222222">base/lid</confidence>
+ and a plurality of "load bearing columns" enabling coupling by fitting into the "base" and the "lid"    (through the above described <boundary-data type="line-number">5 </boundary-data>
+grooves or equivalent tec<confidence value="8">h</confidence>
+nical means)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-60" num="60">Depending on the specific requirements, the uprights <part-num-ref name="uprights">6</part-num-ref>
+ will have any cross section and/or conformation; for instance, they can consist of section members having a <boundary-data type="line-number">10 </boundary-data>
+hollow and closed section or a solid section.    </p>
+    <p id="p-61" num="61">Conveniently, at least one and preferably all of the uprights <part-num-ref name="uprights">6</part-num-ref>
+ seen in cross section consist of a thin wall and define a concavity in a direction transverse to a <boundary-data type="line-number">15 </boundary-data>
+longitudinal extension axis of the upright itself (for instance, this cross section will have a V-shaped, L- shaped or more preferably C-shaped conformation)<confidence value="5">.</confidence>
+    </p>
+    <p id="p-62" num="62">The just described conformation     of the uprights <part-num-ref name="uprights">6</part-num-ref>
+ <boundary-data type="line-number">20 </boundary-data>
+allows a great compactness to be obtained when package <part-num-ref name="great compactness to be obtained when package">1</part-num-ref>
+ is dismantled; in fact<confidence value="5">,</confidence>
+ the uprights <part-num-ref name="uprights">6</part-num-ref>
+ thus shaped can be disposed in side     by   side relationship and superposed on each other and at the same time can be stored within two mutual<confidence value="5">l</confidence>
+y-approached main elements <part-num-ref name="same time can be stored within two mutually-approached main elements">5</part-num-ref>
+ <boundary-data type="line-number">25 </boundary-data>
+to form a box-shaped ele<confidence value="8">m</confidence>
+ent (keeping the longitudinal inner angle of the "ang<confidence value="8">u</confidence>
+lar columns" as the support point); in this way a great reduction in the volume of the container for return transportation is obtained.    </p>
+    <p id="p-63" num="63">
+      <boundary-data type="line-number">30 </boundary-data>
+From a structural point    of view, an upright has at least  one and preferab<confidence value="8">l</confidence>
+y    two walls   co-operatively defining the cross section shape; these walls in turn have a side edge 6a t<confidence value="5">o</confidence>
+      be given any conformation depending  on requirements. In the embodiment shown in <part-num-ref name="embodiment shown in">35</part-num-ref>
+ Fig. 1 it is possible to see that this side edge 6a has <page-break num="17"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 17 -</boundary-data>
+a converging-diverging extensi<confidence value="8">o</confidence>
+n in the direction of the longitudinal extension axis of the upright 6; due to this construction architecture, possible intrusions of the upright into the       holding volume can be <boundary-data type="line-number">5 </boundary-data>
+advantageously prevented on oc<confidence value="8">c</confidence>
+urrence of deformations induced  thereon  during   the   handling  or   storage operations of package <part-num-ref name="handling  or   storage operations of package">1.</part-num-ref>
+    </p>
+    <p id="p-64" num="64">Obviously, the edge    <confidence value="5">6</confidence>
+a can   have other extensions <boundary-data type="line-number">10 </boundary-data>
+depending on specific requirements; for instance, for obtaining the maximum simplest construction a linear edge preferably parallel to the longitudinal extension axis of the upright <part-num-ref name="upright">6</part-num-ref>
+ can be set.    </p>
+    <p id="p-65" num="65">
+      <boundary-data type="line-number">15 </boundary-data>
+Advantageously, the package <confidence value="5">i</confidence>
+n accordance with the present invention may further <confidence value="8">c</confidence>
+omprise shock-resistant means that can be operatively    activated within the holding volume and between the package <part-num-ref name="package">1</part-num-ref>
+ itself and an item contained therein. In other words, the holding <boundary-data type="line-number">20 </boundary-data>
+volume   can   accommodate  sho<confidence value="2">c</confidence>
+k-absorbers   that  are previously coupled with the rigid parts (base elements <part-num-ref name="rigid parts (base elements">5</part-num-ref>
+ and uprights <part-num-ref name="and uprights">6)</part-num-ref>
+ forming the package and the task of which  is  to   protect  the  article  of   manufacture contained therein. The shock-resistant means <part-num-ref name="shock-resistant means">7</part-num-ref>
+ can be <boundary-data type="line-number">25 </boundary-data>
+made of different materials (that in turn can be re- usable materials), such as expanded polypropylene, and can be suitably positioned relative to the uprights and/or base elements.    </p>
+    <p id="p-66" num="66">
+      <boundary-data type="line-number">30 </boundary-data>
+Operatively,   the  shock-resistant   means  <part-num-ref name="shock-resistant   means">7</part-num-ref>
+  enables uncoupling of the article of ma<confidence value="8">n</confidence>
+ufacture to be packaged relative to the "structural shell" consisting of the confining elements <part-num-ref name="confining elements">2,</part-num-ref>
+ so as to cause absorption of the vibrations and kinetic energy that is produced when the <part-num-ref name="">35</part-num-ref>
+ packaged item falls or is sub<confidence value="77">mi</confidence>
+tted to impacts as a <page-break num="18"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 18 -</boundary-data>
+result of wrong operations.    </p>
+    <p id="p-67" num="67">Should it be necessary (when particularly heavy uses are provided, for example), the p<confidence value="8">r</confidence>
+esent package may <boundary-data type="line-number">5 </boundary-data>
+comprise additional stiffening means associated with the confining elements <part-num-ref name="confining elements">2,</part-num-ref>
+ such as    reinforcing ribs, additional latticeworks and so or<confidence value="4">i</confidence>
+; this additional stiffening means will be suitably positioned at the inside and/or outside of the holding volume.    </p>
+    <p id="p-68" num="68">
+      <boundary-data type="line-number">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+ Should the stiffening means be positioned within the confining elements <part-num-ref name="confining elements">2</part-num-ref>
+ (or in other w<confidence value="8">o</confidence>
+rds, if said means faces the holding volume or are f<confidence value="8">o</confidence>
+rmed in the faces opposite to the interfacing surfaces 2a), the means 2a <boundary-data type="line-number">15 </boundary-data>
+can be advantageously used as anch<confidence value="8">o</confidence>
+ring means for the shock-resistant means 7; actually, due to the presence of possible ribs (or equivalent structures) at the inside of the confining elements <part-num-ref name="confining elements">2,</part-num-ref>
+ through a suitable conformation of the shock-resistant means <part-num-ref name="shock-resistant means">7</part-num-ref>
+ (in turn <boundary-data type="line-number">20 </boundary-data>
+having recesses at least partly matching the shape of said ribs or equivalent means),     a steady relative positioning between the elements <part-num-ref name="elements">2</part-num-ref>
+ and shock-absorbers <part-num-ref name="and shock-absorbers">7</part-num-ref>
+ can be maintained.    </p>
+    <p id="p-69" num="69">
+      <boundary-data type="line-number">25 </boundary-data>
+At   the  same   time  it  will  be   appreciated  that arrangement of the ribs on the       "inner" faces of elements <part-num-ref name="&quot;inner&quot; faces of elements">2</part-num-ref>
+ allows a great geometri<confidence value="8">c</confidence>
+ simplicity of the outer surfaces of package <part-num-ref name="outer surfaces of package">1</part-num-ref>
+ to be obtained, so that these surfaces can be cleaned more    easily, are more <boundary-data type="line-number">30 </boundary-data>
+regular and more suitable for resting on planes or being   handled  by   sliding   (without   encountering undesirable stoppages).    </p>
+    <p id="p-70" num="70">Still for the purpose of offeri<confidence value="7">n</confidence>
+g more structural <part-num-ref name="purpose of offering more structural">35</part-num-ref>
+ coherence (if required), additional confining elements <page-break num="19"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                                PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">- 19 -</boundary-data>
+(not shown in the accompanying drawings) can be set and interposed  between  th<confidence value="5">e</confidence>
+   confining   elements  <part-num-ref name="confining   elements">2</part-num-ref>
+  and preferably the uprights <part-num-ref name="uprights">6</part-num-ref>
+ at a median point thereof;    </p>
+    <p id="p-71" num="71">these additional confin<confidence value="8">i</confidence>
+ng elements can merely consist <boundary-data type="line-number">5 </boundary-data>
+of cross-pieces extending between two adjacent uprights and can also house suitably disposed and shaped shock- resistant means 7.    </p>
+    <p id="p-72" num="72">To enable the package to be  correctly maintained in an <boundary-data type="line-number">10 </boundary-data>
+assembled   condition, the    package  itself  can  have housing means designed    to receive pulling elements (such as straps or the <confidence value="88">li</confidence>
+ke); this housing means can be formed in at least one base element <part-num-ref name="like); this housing means can be formed in at least one base element">5</part-num-ref>
+ and can merely consist of grooves and/or recesses included between two <boundary-data type="line-number">15 </boundary-data>
+or more sectors 3d, through which said straps can be inserted and then tensio<confidence value="7">n</confidence>
+ed.    </p>
+    <p id="p-73" num="73">With reference to the    accompanying drawings, it is possible to see that on the side walls/faces as well as <boundary-data type="line-number">20 </boundary-data>
+on the outer base wall/face of the base/lid, shallow grooves have been formed for passage of straps or other fastening means.    </p>
+    <p id="p-74" num="74">The present invention can be put into practice using a <boundary-data type="line-number">25 </boundary-data>
+plurality of different materials, provided the choice of  said  materials   and  consequent   sizing  of  the different confining <confidence value="222222222">elernents</confidence>
+ (and possible accessory parts)   give   the  des<confidence value="8">i</confidence>
+red    degree   of  mechanical performance; taking into   account this point of view, <boundary-data type="line-number">30 </boundary-data>
+one of the basic materials that        can be used to accomplish   the  prese<confidence value="8">n</confidence>
+t      type   of  package   is polypropylene,  but  other   plastic,   metal  or  wood materials can give the same satisfactory results being at the same time advantageous from an economical point <part-num-ref name="economical point">35</part-num-ref>
+ of view.    </p>
+    <boundary-data type="header">
+      <confidence value="88">WO</confidence>
+ 2005/100181                               PCT/<confidence value="5">I</confidence>
+B2005/000957    </boundary-data>
+    <boundary-data type="header">- 20 -</boundary-data>
+    <p id="p-75" num="75">
+      <page-break num="20"/>
+The invention achieves important advantages.    </p>
+    <p id="p-76" num="76">First of all, the particular construction architecture of the present package e<confidence value="8">n</confidence>
+ables two or more packages <boundary-data type="line-number">5 </boundary-data>
+disposed   in mutual   side  by   side  and/or piled-up relationship to be maintained efficiently blocked; in fact, due to the presence and geometry of the grip means (that on the other hand can be indiscriminately positioned on different    components  of the package <boundary-data type="line-number">10 </boundary-data>
+itself),   every  possible   relative  sliding   of  the packages along the contact plane of same is efficiently prevented.    </p>
+    <p id="p-77" num="77">At the same time, the presence of the grip means <part-num-ref name="grip means">3</part-num-ref>
+ <boundary-data type="line-number">15 </boundary-data>
+enables package <part-num-ref name="enables package">1</part-num-ref>
+ to rest <confidence value="8">o</confidence>
+ptimally on the ground or on the bottom of loading compartments also when non- perfect evenness/cleanness   conditions of the bottom itself are present.    </p>
+    <p id="p-78" num="78">
+      <boundary-data type="line-number">20 </boundary-data>
+In this connection it is to be pointed out that the grip means as herein disc<confidence value="8">l</confidence>
+osed and claimed acts in an efficient manner both when several packages are handled by means of jaw lift trucks (and in this case said means enables the differe<confidence value="8">n</confidence>
+t side by side packages to <boundary-data type="line-number">25 </boundary-data>
+efficiently exchange    constraining reactions directed along the vertical planes     in mutual side by side relatioship) and when several packages are stored upon each other forming several layers (and in this case said  means   enables  constraining  reactions   to<confidence value="4">'</confidence>
+ be <boundary-data type="line-number">30 </boundary-data>
+exchanged both along verti<confidence value="8">c</confidence>
+al planes in mutual side by side relationship and along horizontal support planes).    </p>
+    <p id="p-79" num="79">It will be also appreciated that the wide variety of materials that can be used to define the different <part-num-ref name="different">35</part-num-ref>
+ structural elements of the present package enables high <page-break num="21"/>
+      <boundary-data type="header">
+        <confidence value="88">WO</confidence>
+ 2005/100181                                PCT/<confidence value="5">I</confidence>
+B2005/000957      </boundary-data>
+      <boundary-data type="header">
+        <confidence value="6">-</confidence>
+ 21 -      </boundary-data>
+mechanical features to be given to the package itself while at the same time substantially avoiding arising of problems connected with the environmental impact; in fact, due to a prolonged reuse in time of these <boundary-data type="line-number">5 </boundary-data>
+packages, all pr<confidence value="8">o</confidence>
+blems     connected  with  disposal of packages to be thr<confidence value="8">o</confidence>
+wn away after use are avoided.    </p>
+    <p id="p-80" num="80">The   shape  of   the   different   package  components susceptible of dismantling is also advantageous in <boundary-data type="line-number">10 </boundary-data>
+terms   of   package   compactness   under  disassembled conditions, which <confidence value="5">h</confidence>
+as   favourable repercussions on the logistic efficiency.    </p>
+    <p id="p-81" num="81">It will be also appreciated that the great simplicity <boundary-data type="line-number">15 </boundary-data>
+of the different package components offers advantages from an economical point of view; in fact, the present invention   enables   exploitation   of   the  logistic transportation  co<confidence value="6">m</confidence>
+partments   (railway  trucks,  lorry trailers  or   others)   and/or   storage  compartments <boundary-data type="line-number">20  </boundary-data>
+(warehouses, sheds and so on) to be maximised and, as a result, the logist<confidence value="8">i</confidence>
+c costs to be reduced; at the same time, due to the high structural performance of the present package,   over-sizing   of  the  goods  to  be packaged can be a<confidence value="8">v</confidence>
+oided; this generally involves an <boundary-data type="line-number">25 </boundary-data>
+important abatement   of all costs, i.e. not only of those connected with logistic problems but also as regards planning and manufacture of the package itself and even of the go<confidence value="8">o</confidence>
+ds to be packaged therein. It will be  finally appreciated   that  the  reduction  in  the <boundary-data type="line-number">30 </boundary-data>
+planning and manufacture costs of the package itself is also favourably influenced by the great simplicity of the  package  structure   and  great   variety  of  the materials used.    </p>
+  </description>
+</us-patent-application>
+

applicant/11553536.xml

@@ -0,0 +1,530 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11553536</doc-number>
+        <date>2006-10-27</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">Attorney Docket No. 3655/<confidence value="5885">0320</confidence>
+PUS<confidence value="5">1</confidence>
+    </boundary-data>
+    <heading id="h-1">DATA EXTRACTION FOR NETWORKED VOICE</heading>
+    <heading id="h-2">COMMUNICATION DEVICES</heading>
+    <heading id="h-3">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">1.    Field of the Invention <confidence value="588685">[00011</confidence>
+       Embodiments of the invention generally relate to the management of networked voice communication devices (NVCD), and more particularly, to methods and apparatuses for extracting operational data therefrom. Specifically, embodiments of the invention are directed to extracting operational data which may be used for a variety of purposes, including asset management, alter<confidence value="8">n</confidence>
+ative gatekeeper list determination, connection status, and network utilization assessment.    </p>
+    <p id="p-2" num="2">2.     Description of the Background Art [0002<confidence value="5">1</confidence>
+       Advances in reliability, performance, and cost effectiveness are motivating a transition to utilize packet switched networks for data traditionally carried over circuit switched networks. This trend can be readily appreciated in the area of voice communications, where Voice over Internet Protocol (Vo<confidence value="5">I</confidence>
+P) telephony is being used to supplement, and in some cases, replace, telephone networks based upon the Public Switched Telephone Network (PSTN).    </p>
+    <p id="p-3" num="3">[0003<confidence value="5">1</confidence>
+       The different nature of packet switched<confidence value="5">,</confidence>
+ networking and circuit switched networking can motivate the use of new diagnostic tools to build, troubleshoot, modify, and maintain such networks. Because VoIP telephone networks can scale rapidly and become very large in size, the establishment and administration of such networks may utilize special purpose tools to make these tasks manageable. Such administrative tools may include various hardware <boundary-data type="header">
+        <confidence value="8">1</confidence>
+      </boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">Attorney Docket No. 3655/<confidence value="5885">0320</confidence>
+PUS<confidence value="4">1</confidence>
+      </boundary-data>
+and software utilities to obtain information from a variety of NVCDs, including VoIP telephones.    </p>
+    <p id="p-4" num="4">[0004<confidence value="4">]</confidence>
+       Therefore, in order to establish and effectively maintain packet switched systems used for voice communication, a need exists for ways to obtain operational data and other types of information from NVCDs which is currently unavailable using existing approaches.    </p>
+    <heading id="h-4">SUMMARY OF THE EMBODIMENTS</heading>
+    <p id="p-5" num="5">
+      <confidence value="5">[</confidence>
+0005<confidence value="5">]</confidence>
+       Embodiments consistent with the present invention are directed to methods and apparatuses for extracting data from Networked Voice Communication Devices (NVCDs). One embodiment presented is an apparatus directed to extracting data from a networked voice <confidence value="8876">comm</confidence>
+unication device, which includes a processor, and a memory, which is functionally coupled to the processor and has executable instructions for causing the processor to iterate over a plurality of IP addresses within a subnet, and for each iteration, access a networked device at an IP address, determine whether the networked device is a VoIP telephone satisfying at least one predetermined criterion, and extract operational data from the VoIP telephone based upon the determination.    </p>
+    <p id="p-6" num="6">[0006<confidence value="5">]</confidence>
+       Another embodiment presented which is consistent with the present invention is a method directed to extracting data from an NVCD, which includes searching a network for a device f<confidence value="8">u</confidence>
+nctionally coupled to the network, determining whether the device is an NVCD satisfying at least one predetermined criterion, where the at least one predetermined criterion includes a manufacturer's name, and extracting data from the NVCD.    </p>
+    <p id="p-7" num="7">[0007]       In another embodiment consistent the present invention, a method directed to extracting data from a Voice Over Internet Protocol (VoIP) telephone is presented. The method includes accessing a networked device at an IP address, determining whether the networked <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+      <boundary-data type="header">Attorney Docket No. 3655/<confidence value="5885">0320</confidence>
+PUS<confidence value="4">1</confidence>
+      </boundary-data>
+device is a VoIP telephone satisfying at least one predetermined criterion, and extracting operational data from the VoIP telephone based upon the dete<confidence value="77">rm</confidence>
+ination.    </p>
+    <p id="p-8" num="8">[0008]       In yet another embodiment, a computer readable medium storing executable instructions for causing a processor to perform a method directed to extracting data from a networked voice communication device is presented, which includes iterating over a plurality of IP addresses within a subnet, and for each iteration, accessing a networked device at an IP address, determining whether the networked device is a VoIP telephone satisfying at least one predetermined criterion, and extracting operational data from the VoIP telephone based upon the determination.</p>
+    <heading id="h-5">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-9" num="9">[0009<confidence value="5">]</confidence>
+       Further aspects and advantages of the present invention will become apparent upon reading the following detailed description taken in conjunction with the accompanying drawings summarized below.    </p>
+    <p id="p-10" num="10">
+      <confidence value="5">[</confidence>
+0010<confidence value="4">]</confidence>
+       Fig. 1 shows a top-level exemplary flowchart depicting a method consistent with an embodiment of the invention.    </p>
+    <p id="p-11" num="11">
+      <confidence value="5">[</confidence>
+0011]       Fig. 2A depicts an exemplary flowchart providing greater detail of data extraction methods consistent with various embodiments of the invention.    </p>
+    <p id="p-12" num="12">[0012<confidence value="5">]</confidence>
+       Fig. 2<confidence value="5">B</confidence>
+ depicts an exemplary flowchart providing using consistent with various embodiments of the invention.    </p>
+    <p id="p-13" num="13">
+      <confidence value="5">[</confidence>
+0013]       Fig. 3 shows an exemplary flowchart providing additional details regarding management information base (MIB) scanning consistent with some embodiments of the invention.    </p>
+    <boundary-data type="header">
+      <confidence value="8">3</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3655<confidence value="5">/</confidence>
+0320PUS<confidence value="5">1</confidence>
+    </boundary-data>
+    <p id="p-14" num="14">
+      <page-break num="4"/>
+      <confidence value="5">[</confidence>
+0014<confidence value="4">]</confidence>
+       Figs. 4A-4C depict an exemplary flowcharts showing methods for determining talk-time, a percentage of talk-listen time, and bandwidth consumed consistent with another embodiment of the invention.    </p>
+    <p id="p-15" num="15">[0015<confidence value="5">]</confidence>
+       Fig. 5 shows an exemplary block diagram of a Network Voice Co<confidence value="5662">nnun</confidence>
+ication System (NVCS) consistent with another embodiment of the invention.    </p>
+    <p id="p-16" num="16">
+      <confidence value="5">[</confidence>
+0016<confidence value="4">]</confidence>
+       Fig. 6 depicts an exemplary block diagram of a Networked Voice Co<confidence value="66">mm</confidence>
+unication Device consistent with various embodiments of the invention.    </p>
+    <heading id="h-6">DETAILED DESCRIPTION</heading>
+    <p id="p-17" num="17">[0017]      Embodiments consistent with the present invention are more specifically set forth in the following description with reference to the appended figures. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.</p>
+    <p id="p-18" num="18">
+      <confidence value="5">[</confidence>
+0018<confidence value="4">]</confidence>
+       An exemplary Network Voice Com<confidence value="5">m</confidence>
+unication System (NVCS) <part-num-ref name="exemplary Network Voice Communication System (NVCS)">500</part-num-ref>
+ consistent with an embodiment of the invention is shown in Fig. 5, which is described only briefly here as an introduction. NVCS <part-num-ref name="introduction. NVCS">500</part-num-ref>
+ may include a diagnostic machine <part-num-ref name="diagnostic machine">510</part-num-ref>
+ which is functionally coupled to a packet switched network <part-num-ref name="packet switched network">530.</part-num-ref>
+ Diagnostic machine <part-num-ref name="packet switched network 530. Diagnostic machine">510</part-num-ref>
+ may be used to execute various embodiments for data extraction presented herein and presented in more detail below. A Communications Manager (CM) <part-num-ref name="Communications Manager (CM)">550</part-num-ref>
+ and a plurality of Network Voice Communication Devices (NVCDs) 560a-560n may also be functionally coupled to packet switched network <part-num-ref name="plurality of Network Voice Communication Devices (NVCDs) 560a-560n may also be functionally coupled to packet switched network">530.</part-num-ref>
+ CM <part-num-ref name="plurality of Network Voice Communication Devices (NVCDs) 560a-560n may also be functionally coupled to packet switched network 530. CM">550</part-num-ref>
+ may organize and route voice, data, image and video transmissions. CM <part-num-ref name="may organize and route voice, data, image and video transmissions. CM">550</part-num-ref>
+ may also co<confidence value="8">n</confidence>
+nect to private and/or public telephone networks, Ethernet LANs, ATM networks, and/or the Internet. Commercially available versions, such as, for example, Avaya Co<confidence value="588">mmu</confidence>
+nication Manager may be used in various embodiments of the invention. CM <part-num-ref name="invention. CM">550</part-num-ref>
+ allows centralization of <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+call processing and administration though a single machine, and defines redundant gateways at remote locations using Alternative Gatekeeper Lists.    </p>
+    <p id="p-19" num="19">
+      <confidence value="5">[</confidence>
+0019<confidence value="5">]</confidence>
+      NVCDs 560a-560n may be voice transceivers providing voice communication capability to users through packet switched network 530. Details regarding the above-presented components of NVCS <part-num-ref name="above-presented components of NVCS">500</part-num-ref>
+ will be described in more detail below.    </p>
+    <p id="p-20" num="20">[0020<confidence value="4">]</confidence>
+       Fig. 1 shows a top-level exemplary flowchart depicting a method <part-num-ref name="method">100</part-num-ref>
+ consistent with an embodiment of the invention. Method <part-num-ref name="invention. Method">100</part-num-ref>
+ may begin by searching packet switched network <part-num-ref name="may begin by searching packet switched network">530</part-num-ref>
+ for a device which satisfies one or more predetermined criterion. This may be accomplished by initially attempting access to the device using a specific network address <confidence value="88666">(S110</confidence>
+). A dete<confidence value="67">rm</confidence>
+ination can then be made if the device is found at the specified address (S120).    </p>
+    <p id="p-21" num="21">If no device is available, a new address is selected and the attempting step S<confidence value="5">1</confidence>
+20 is repeated.    </p>
+    <p id="p-22" num="22">Selecting step <confidence value="5">S</confidence>
+120 may be accomplished by simply incrementing the network address, or by other methods known to one skilled in the art. If, on the other hand, an available device is found in step S120, another check may then be performed to determine whether the found device satisfies one or more predetermined criterion (<confidence value="5">S</confidence>
+130). The predetermined criteria may include determining whether the found device is an NVCD, and if so, who manufactured the NVCD and/or any other designation describing one or more aspects the NVCD. If the found device fails to satisfy the predetermined criterion (<confidence value="5">S</confidence>
+130), a new network address is selected (<confidence value="5">S</confidence>
+135) and another attempt is performed (S 110). If the found device satisfies the one or more criterion in step <confidence value="5">S</confidence>
+130 (and thus it is determined that the found device is an NVCD), then data may be extracted from the NVCD in step (S140). The extracted data may be any type of data stored in the NVCD, and may include various types operational data which can <confidence value="2222222">confonn</confidence>
+ to standards associated with packet switched network <part-num-ref name="NVCD, and may include various types operational data which can confonn to standards associated with packet switched network">530,</part-num-ref>
+ and/or can be data particular to the NVCD itself.    </p>
+    <p id="p-23" num="23">Details regarding the extraction step S140 and the data associated therewith are presented in Fig.</p>
+    <boundary-data type="header">
+      <confidence value="8">5</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3655/<confidence value="5885">0320</confidence>
+PUS<confidence value="5">1</confidence>
+    </boundary-data>
+    <p id="p-24" num="24">
+      <page-break num="6"/>
+2A below. After the data has been extracted from the NVCD in step S140, a determination is made as to whether all network addresses of interest have been searched (S150). The method finishes if the network address search is complete, and if additional network address should searched, a new network address may be selected (S155) and the method repeats starting at step <confidence value="5">S</confidence>
+110.    </p>
+    <p id="p-25" num="25">Embodiments Using TCP/IP Networks [0021<confidence value="5">]</confidence>
+       The following description presents various embodiments wherein packet switched network <part-num-ref name="following description presents various embodiments wherein packet switched network">530</part-num-ref>
+ may utilize TCP/IP, and NVCD's 560a-560n may include VoIP telephones. An embodiment may find VoIP telephones within the TCP/IP network by looping over IP addresses within an individual class-C subnet. The entire TCP/IP network of interest may then be searched one class-C subnet at a time. The method may start by attempting to access a device connected to the TCP/IP network, starting at a selected IP address which is the lowest address in the class-C subnet (S 110). The attempt may be carried out by using techniques known to one of ordinary skill in the art, such as, for example, using the protocols under SNMP, which include performing a Management Info<confidence value="66">rm</confidence>
+ation Base (MIB) walk at the selected IP address. MIB walks may be implemented using, by way of example only, "smpwalk," or other techniques known to those skilled in the art<confidence value="5">.</confidence>
+ Details of performing MIB walks are presented below in the description of Fig.    </p>
+    <p id="p-26" num="26">
+      <confidence value="88">3.</confidence>
+    </p>
+    <p id="p-27" num="27">[0022<confidence value="5">]</confidence>
+       If a device is found at the selected IP address (S120), data may be read from an MIB residing on the device (which may be determined using the MIB walk process) and a check then be <confidence value="222222222">perfonned</confidence>
+ using the read data to determine if the found device satisfies one or more predetermined criterion (<confidence value="5">S</confidence>
+130). Such criterion may include determining if the found device is a VoIP telephone, whether the VoIP telephone is made by a specific manufacturer, such as, for <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+example, "Avaya," and/or whether the VoIP is a specific model corresponding to the manufacturer (for example, an Avaya "46xx" and/or Avaya "96xx" VoIP telephones) (S130).    </p>
+    <p id="p-28" num="28">This data may be stored in the MIB residing on the VoIP telephone, and can be accessed using the MIB walk tech<confidence value="8">n</confidence>
+ique. If the determining steps S<confidence value="5">1</confidence>
+20 and/or S130 are not satisfied, the last octet in the selected IP address may be incremented, and the method will return to step S <part-num-ref name="method will return to step S">110.</part-num-ref>
+    </p>
+    <p id="p-29" num="29">
+      <confidence value="2">[</confidence>
+0023<confidence value="5">]</confidence>
+       Once it is determined that the found device is a VoIP phone satisfying the at least one criterion, information may be extracted from the VoIP phone (<confidence value="5">S</confidence>
+140). This information may take the <confidence value="2222">forn</confidence>
+ of operational data residing in the MIB of the VoIP phone, and the extraction may be performed using the same MIB walk techniques mention above. Various embodiments of the invention may extract different information from the MIB in step S <part-num-ref name="MIB in step S">140.</part-num-ref>
+ As will be described in more detail below, an embodiment is presented which may extract asset management data;    </p>
+    <p id="p-30" num="30">another embodiment may extract Alternative Gatekeeper Lists (AGLs); yet another embodiment may determine connection status with respect to the co<confidence value="7787">mmun</confidence>
+ication manager of the VoIP telephone; and another embodiment may determine talk/listen time and the bandwidth consumed of the VoIP telephone.    </p>
+    <p id="p-31" num="31">
+      <confidence value="5">[</confidence>
+0024<confidence value="4">]</confidence>
+       In step S 150, a check is performed to determine if all of the addresses in the class C subnet have been searched. For a class C subnet, the last octet may not exceed a value of <part-num-ref name="value of">255,</part-num-ref>
+ therefore, step S<confidence value="666">150</confidence>
+ may simply check to the last octet is greater than this value. If so, the method may stop searching the class C subnet, and, if desired, another class C sub net may be searched (not shown). If the last octet of the specific address is not greater than <part-num-ref name="specific address is not greater than">255,</part-num-ref>
+ the last octet of the specific address may be incremented, and the method may branch back to step S<confidence value="666">110</confidence>
+ and reiterate. One of ordinary skill in the art would appreciate that networks of arbitrary size may be searched in the above described <confidence value="222222">maimer</confidence>
+ one class C subnet at a time.    </p>
+    <boundary-data type="header">
+      <confidence value="8">7</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3655/0320PU<confidence value="58">S1</confidence>
+    </boundary-data>
+    <p id="p-32" num="32">
+      <page-break num="8"/>
+[0025<confidence value="5">]</confidence>
+      Method 100 may be initiated manually by a user by initiating a command, or be programmed for automatic execution by machine on a periodic basis. Manual execution may be usef<confidence value="8">u</confidence>
+l for debug purposes during the development of the NVCS <part-num-ref name="NVCS">500.</part-num-ref>
+ Automatic execution may be set <confidence value="5">u</confidence>
+p on a periodic basis, having a frequency that may depend upon the type information data being extracted f<confidence value="8">r</confidence>
+om the NVCDs 560a-560n. For example, when extracting access management data, method <part-num-ref name="NVCDs 560a-560n. For example, when extracting access management data, method">100</part-num-ref>
+ may be performed automatically once every month. When determining AGLs and/or bandwidth consumed, method <part-num-ref name="may be performed automatically once every month. When determining AGLs and/or bandwidth consumed, method">100</part-num-ref>
+ may be automatically performed one or more times every day for daily maintenance of the NVCS <part-num-ref name="NVCS">500.</part-num-ref>
+    </p>
+    <p id="p-33" num="33">
+      <confidence value="5">[</confidence>
+0026<confidence value="5">]</confidence>
+      Fig. 2A depicts an exemplary flowcharts providing greater detail regarding the data extraction step S<confidence value="5">1</confidence>
+40 consistent with various embodiments of the invention. The data extraction step may include an asset management step S240, an obtaining AGL step <confidence value="5">S</confidence>
+242, a determining connection status step S246, and determining talk-time, a percentage of talk/listen time, and/or bandwidth consumed step S244. Steps S240-<confidence value="5">S</confidence>
+246 may be performed separately or in any combination. If the steps are being performed in some combination, any combination of these steps may grouped within a single iteration of the main loop of method <part-num-ref name="main loop of method">100.</part-num-ref>
+ Alternatively, any combination of steps S240-<confidence value="5">S</confidence>
+246 may be performed in a sequential manner, wherein each of the steps in the combination can be looped separately through the main loop of method <part-num-ref name="main loop of method">100,</part-num-ref>
+ and once finished, another step in the combination may separately iterated through the main loop.    </p>
+    <p id="p-34" num="34">This can continue until all the desired steps are looped through one after another.</p>
+    <p id="p-35" num="35">
+      <confidence value="5">[</confidence>
+0027<confidence value="5">]</confidence>
+      The Asset Management step <confidence value="5">S</confidence>
+240 may extract data from one or more of NVCDs 560a-560n which can be used in the both the development and day-to-day maintenance of NVCS <part-num-ref name="development and day-to-day maintenance of NVCS">500.</part-num-ref>
+ Asset Management S240 may include determining a network address (<confidence value="5">S</confidence>
+240A) from any of NVCDs 560a-560n. The network address may be based upon standards associated with packet switched network <part-num-ref name="network address may be based upon standards associated with packet switched network">530,</part-num-ref>
+ and may be, for example, an IP address. By determining the network <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+addresses of NVCDs 560a-560n, an administrator can better manage and allocate address resources across packet switched network <part-num-ref name="administrator can better manage and allocate address resources across packet switched network">530.</part-num-ref>
+ Toward this end, Media Access Controller (MAC) addresses may also be obtained from NVCDs 560a-560d (S240E). Asset Management step <confidence value="5">S</confidence>
+240 may also determine model nu<confidence value="8">m</confidence>
+bers (S240D) and serial numbers (S240B) from NVCDs 560a-560d. Model and serial nu<confidence value="8">m</confidence>
+bers may be assigned by the manufacturer of an NVCD, and having this information from NVCDs across packet switched network <part-num-ref name="NVCD, and having this information from NVCDs across packet switched network">530</part-num-ref>
+ may be useful for determining equipment usage and maintenance upgrade schedules.    </p>
+    <p id="p-36" num="36">[0028<confidence value="5">]</confidence>
+       Finally, station numbers of NVCDs 560a-560n, are nu<confidence value="8">m</confidence>
+bers which may be uniquely associated with a specific NVCD. Station nu<confidence value="8">m</confidence>
+bers may be utilized by users to access other NVCDs within switched packet network <part-num-ref name="specific NVCD. Station numbers may be utilized by users to access other NVCDs within switched packet network">530,</part-num-ref>
+ or used in conjunction other information for access by devices external to switched packet network <part-num-ref name="specific NVCD. Station numbers may be utilized by users to access other NVCDs within switched packet network 530, or used in conjunction other information for access by devices external to switched packet network">530.</part-num-ref>
+ For example, station <confidence value="787">num</confidence>
+bers may include extension numbers, such as, for example, a <part-num-ref name="">4</part-num-ref>
+ digit number which may be used to access an NVCD by another user within a same office building. Access to the NVCD from outside the building may utilize a standard <part-num-ref name="standard">10</part-num-ref>
+ digit phone number having the last four digits being same as the extension nu<confidence value="8">m</confidence>
+ber. The station number may be uniquely associated with a particular NVCD, and if the NVCD is moved to another connection point having a different network address within packet switched network <part-num-ref name="different network address within packet switched network">530,</part-num-ref>
+ or if the network address is reassigned to a different value using a dynamic addressing assignment scheme, the station number can remain static and be u<confidence value="8">n</confidence>
+iquely associated with the NVCD. Maintaining the same station number can be a convenient feature for users in that they do not have to memorize new extension numbers when their office location is moved. Tracking the station number may be useful for an administrator in managing, documenting, and planning NVCS <part-num-ref name="administrator in managing, documenting, and planning NVCS">500,</part-num-ref>
+ as specific NVCDs migrate about a facility and access switched packet network <part-num-ref name="facility and access switched packet network">530</part-num-ref>
+ using different network addresses.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3655/0320PUS <confidence value="8">1</confidence>
+    </boundary-data>
+    <p id="p-37" num="37">
+      <page-break num="10"/>
+[0029]       Extracting data from devices step S<confidence value="5">1</confidence>
+40 may further include obtaining Alternative Gatekeeper Lists (AGLs) step <confidence value="5">S</confidence>
+242. An AGL is a list of switched packet network address of various points in the NVCS <part-num-ref name="NVCS">500</part-num-ref>
+ where NVCDs 560a-560n can register to Co<confidence value="552">nmm</confidence>
+unications Manager (CM) <part-num-ref name="where NVCDs 560a-560n can register to Conmmunications Manager (CM)">550.</part-num-ref>
+ The registration process can facilitate user mobility by allowing the user to remain associated with a single station <confidence value="222222">munber</confidence>
+ while using various NVCDs. For example, if a user wishes to have his extension ring at a remote location utilizing a different NVCD, the user may register that NVCD to receive calls there. Alternatively, if a user wishes to use a software based phone on a personal computer, the software based phone may be registered with the user's station number.    </p>
+    <p id="p-38" num="38">[0030<confidence value="5">]</confidence>
+       Registration may be defined as the process of having CM <part-num-ref name="process of having CM">550</part-num-ref>
+ associate a station number with a particular NVCD by having a user log into the NVCD using, for example, a station and a password. Using this information, CM <part-num-ref name="password. Using this information, CM">550</part-num-ref>
+ may validate the particular NVCD with the station number. If the user no longer wishes to use that particular NVCD, the association may be terminated by having the user log off. An AGL may be dynamically built by CM <part-num-ref name="AGL may be dynamically built by CM">550</part-num-ref>
+ at registration time, and, once created, the AGL may then be downloaded to NVCDs 560a-560d over switched packet network <part-num-ref name="AGL may then be downloaded to NVCDs 560a-560d over switched packet network">530</part-num-ref>
+ to be stored in an NVCD itself. After being stored in an NVCD, CM <part-num-ref name="NVCD, CM">550</part-num-ref>
+ may typically discard the AGLs. Because CM discards the AGLs, there is no central location from which AGLs can be obtained by an administrator, thus motivating the need for utilizing step S242.    </p>
+    <p id="p-39" num="39">[0031<confidence value="5">]</confidence>
+       Extracting data from  devices step <confidence value="5">S</confidence>
+140 may further include the step of determining talk-time, the percentage of talk/listen time, and/or bandwidth cons<confidence value="677">ume</confidence>
+d (<confidence value="5">S</confidence>
+244).    </p>
+    <p id="p-40" num="40">Talk time and listening time is the a<confidence value="8">m</confidence>
+ount of time which is an NVCD is used for talking and listening, respectively. It may be computed by obtaining the amount of data cumulative input and output to the NVCD, and utilizing algorithms k<confidence value="8">n</confidence>
+own in the art to convert the amount of <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS<confidence value="5">1</confidence>
+      </boundary-data>
+input and output data into a time values. Talk time, listen time, and percentage of talk/listen time may be used to determine NVCD usage and/or monitoring the amount of time individuals using the NVCD. The percentage of talk/listen time can be a useful metric for the evaluation of employee performance, for example, the performance of agents at a call center. An additional metric which may be computed is the amount of bandwidth consumed by the NVCD, which also may be dete<confidence value="77">rm</confidence>
+ined by the amount input and/or output data utilized by the NVCD using algorithms known in the art. Bandwidth consumed can be a usef<confidence value="8">u</confidence>
+l metric for determining the load on switched packet network <part-num-ref name="load on switched packet network">530.</part-num-ref>
+ Details regarding how this is perfo<confidence value="77">rm</confidence>
+ed are presented below in the description of Figs. 4A-4C.    </p>
+    <p id="p-41" num="41">
+      <confidence value="2">{</confidence>
+0032<confidence value="5">]</confidence>
+      Finally, extracting data from devices step S<confidence value="5">1</confidence>
+40 may further include determining a network connection status of any of NVCDs 560a-560n (S246). The connection status may include three network states: <part-num-ref name="connection status may include three network states:">1)</part-num-ref>
+ "Listening" - when an NVCD is connected to switched packet network <part-num-ref name="NVCD is connected to switched packet network">530</part-num-ref>
+ and is awaiting with its ports opened; <part-num-ref name="and is awaiting with its ports opened;">2)</part-num-ref>
+ "Closed" - when an NVCD is connected to switched packet network <part-num-ref name="NVCD is connected to switched packet network">530</part-num-ref>
+ but is not yet registered to CM 550; and <part-num-ref name="but is not yet registered to CM 550; and">3)</part-num-ref>
+ "Established" - when an NVCD is connected to the network and is registered to CM <part-num-ref name="network and is registered to CM">550.</part-num-ref>
+ The connection status information may be very usef<confidence value="8">u</confidence>
+l to determine which NVCDs 560a-560n are not registered to CM <part-num-ref name="connection status information may be very useful to determine which NVCDs 560a-560n are not registered to CM">550.</part-num-ref>
+ For example, an administrator may determine if a particular NVCD is unregistered if its connection status is in the "Listening" or "Closed' state. Moreover, by utilizing the network address (e.g., IP address), the administrator may be able to locate the NVCD within the switched packet network <part-num-ref name="switched packet network">530</part-num-ref>
+ and determine the NVCD's physical location. Utilizing these network states can provide a convenient and efficient way to determine which NVCDs 560a-560n are unregistered and further deter<confidence value="8">m</confidence>
+ining their physical location, which may be very useful for administering, configuring, and debugging the NVCS <part-num-ref name="NVCS">500.</part-num-ref>
+    </p>
+    <boundary-data type="header">
+      <confidence value="88">11</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3<confidence value="88885885">655/0320</confidence>
+PUS<confidence value="8">1</confidence>
+    </boundary-data>
+    <p id="p-42" num="42">
+      <page-break num="12"/>
+      <confidence value="5">[</confidence>
+0033<confidence value="5">]</confidence>
+       Fig. 2B shows an exemplary flowchart for a method 200B consistent with another embodiment of the invention. Method 200B is a different embodiment of method <part-num-ref name="different embodiment of method">100,</part-num-ref>
+ and may utilize TCP/IP network protocols and a specific predetermined criterion for NVCD. There, the process Loop-Walk-Co<confidence value="5">m</confidence>
+ect loops over the 4<confidence value="22">"'</confidence>
+ octet of IP addresses to search for an NVCD which may be a VoIP telephone manufactured by Avaya. Once an Avaya VoIP telephone is found, <confidence value="22222222222">infonnation</confidence>
+ may be extracted from the phone as presented above. All of the addresses from 0-255 are tested in the class-C subnet for Avaya VoIP telephones. Once the class-C is completely searched, the process terminates, and other class-C subnets may be searched. The sub-process Co<confidence value="66">nn</confidence>
+Awk may be used to provide an output listing of each VoIP telephone and its associated parameters.    </p>
+    <p id="p-43" num="43">[0034<confidence value="5">]</confidence>
+       Fig. 3 shows an exemplary flowchart providing additional details regarding management information base (MIB) scanning consistent with some embodiments of the invention. A MIB is a collection of hierarchically organized <confidence value="22222222222">infonnation</confidence>
+ which may stored in a NVCD. The information stored in the MIB can be organized in a tree-like structure which may contain objects describing information regarding the NVCD. The objects may have associated object identifiers to provide efficient access to information stored within the MIB. The MIB may be accessed using network management standards defined under the Simple Network Management Protocol (SNMP), and may include SNMP walks. SNMP walks can query the tree-like structure for information associated with objects using specified object identifiers of interest. A top-level flowchart, which outlines a method which may be performed on diagnostic machine <part-num-ref name="method which may be performed on diagnostic machine">510</part-num-ref>
+ for performing an SNMP walk <part-num-ref name="SNMP walk">300,</part-num-ref>
+ is exemplified in Fig. 3.    </p>
+    <p id="p-44" num="44">
+      <confidence value="5">[</confidence>
+0035]       Initially, method 300 starts by opening a UDP port on a device (<confidence value="68">S3</confidence>
+10) which is <confidence value="22222222">comected</confidence>
+ to network <part-num-ref name="device (S310) which is comected to network">530</part-num-ref>
+ and accessed using a specific IP address. This port is typically port UDP <part-num-ref name="specific IP address. This port is typically port UDP">161,</part-num-ref>
+ but other ports known by one of ordinary skill in the art which may be utilized with <boundary-data type="header">
+        <confidence value="88">12</confidence>
+      </boundary-data>
+      <page-break num="13"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+SNMP can be used. Then a command is sent to the device instructing it to provide specific information, using a designated IP address (which may correspond to the IP address of diagnostic machine 510), through the open UDP port on the device (<confidence value="68">S3</confidence>
+15). This requested information may reside in the MIB on the device, and may be accessed by using the appropriate <confidence value="222222222">Connunity</confidence>
+ Public Object Identifier (O<confidence value="5">I</confidence>
+D) of interest. The O<confidence value="5">I</confidence>
+D may be standard identifies, or may be identifiers designated by manufactures and/or programmers of the device, which are used to designate specific portions of data in the MIB. The device itself may access its MIB using standard methods known to one of ordinary skill in the art. Once the data corresponding to the <confidence value="86">OI</confidence>
+D is accessed, the device then responds by sending the requested information of interest, which is received at the provided IP address of diagnostic server <part-num-ref name="provided IP address of diagnostic server">510</part-num-ref>
+ (S320). A check may then be performed to determine if an error occurred in steps S315 and/or S3<confidence value="686">20,</confidence>
+ if so, the method may terminate (<confidence value="5">S</confidence>
+330). If not, another determination may then made whether additional information corresponding to other O<confidence value="5">I</confidence>
+Ds is to be obtained (<confidence value="5">S</confidence>
+330). If so, steps <part-num-ref name="method may terminate (S330). If not, another determination may then made whether additional information corresponding to other OIDs is to be obtained (S330). If so, steps">315,</part-num-ref>
+ <part-num-ref name="method may terminate (S330). If not, another determination may then made whether additional information corresponding to other OIDs is to be obtained (S330). If so, steps 315,">320,</part-num-ref>
+ and <part-num-ref name="method may terminate (S330). If not, another determination may then made whether additional information corresponding to other OIDs is to be obtained (S330). If so, steps 315, 320, and">325</part-num-ref>
+ are repeated, and if not, the UDP port is closed (S335) and method <part-num-ref name="UDP port is closed (S335) and method">300</part-num-ref>
+ may terminate. Standard <confidence value="222222222">connnands</confidence>
+, such as those provided under SNMP, may be used to send the information request to the device obtain information in the MIB with the O<confidence value="5">I</confidence>
+D of interest.    </p>
+    <p id="p-45" num="45">
+      <confidence value="5">[</confidence>
+0036<confidence value="4">]</confidence>
+       One of ordinary skill in the art would appreciate that other embodiments of the invention may utilize standard SNMP tools to perform MIB scanning, such as for example, the program "<confidence value="22222222">snmpwalk</confidence>
+."  S<confidence value="68">mn</confidence>
+pwalk may be run through a command line interface within a shell of an operating system, such as, for example, the Bash shell running under Linux and/or Unix.    </p>
+    <p id="p-46" num="46">
+      <confidence value="5">[</confidence>
+0037<confidence value="5">]</confidence>
+       Fig. 4A depicts a top level exemplary flowchart showing methods for determining talk-time, the percentage of talk-listen time, and/or bandwidth consumed consistent with another embodiment of the invention. Within the MIB, the number of User Datagram Protocol (UDP) packets, which have been input and output from the NVCD, may be accessed by diagnostic <boundary-data type="header">
+        <confidence value="88">13</confidence>
+      </boundary-data>
+      <page-break num="14"/>
+      <boundary-data type="header">Attorney Docket No. 3655/<confidence value="5885">0320</confidence>
+PUS<confidence value="8">1</confidence>
+      </boundary-data>
+machine <part-num-ref name="NVCD, may be accessed by diagnostic machine">510.</part-num-ref>
+ This may performed by first accessing the MIB stored in the NVCD's memory, which can be done by finding the O<confidence value="5">I</confidence>
+D corresponding to the number of input-output UDP packets <confidence value="868">(S4</confidence>
+10). Once the location corresponding to the input-output packets in the MIB is found, the values are read from the MIB (<confidence value="588">S41</confidence>
+5). Based upon the nu<confidence value="8">m</confidence>
+ber of input and output packets, the duration for which the phone has been used, referred to herein as "listen-time" and "talk-time," may be computed (<confidence value="5">S</confidence>
+420 and <confidence value="5">S</confidence>
+425). Talk-time is the duration of time for which a user has been using the NVCD to talk, and listen time is the duration of time for which a user has been using the NVCD to listen. The talk-time and bandwidth consumed may be used by a network designer in construction the network, and/or be used by a network administrator in the day-to-day maintenance of the network.    </p>
+    <p id="p-47" num="47">[0038<confidence value="4">]</confidence>
+       By determining the talk and listen time, it may be an easy matter to compute a metric, such as, for example, a percentage, comparing the talk time versus the listen time of the NVCD. This metric may be determined from the number of input and output UDP packets is the percentage of talk/listen time versus connect time. This metric may be useful in evaluating call centers to determine if call-center agents are doing more talking than listening, or vise-versa.    </p>
+    <p id="p-48" num="48">[0039]      Algorithm<confidence value="8">s</confidence>
+ known to those skilled in the art which may be used to determine bandwidth for VoIP systems may be modified to determine listen-time and talk-time. These algorithms may depend on the codec(s) being used by the NVCD. Another metric which may be computed from the <confidence value="2222222">nrunber</confidence>
+ if input and output UDP packets may be the amount of bandwidth consumed by the NVCD (<confidence value="588">S43</confidence>
+0). The bandwidth consumed may be computed using algorit<confidence value="778">hms</confidence>
+ known in the art, which may depend upon the codec(s) the NVCD is using. Details of method <part-num-ref name="NVCD is using. Details of method">400</part-num-ref>
+ are f<confidence value="7">u</confidence>
+rther exemplified in Figs. 4B and 4<confidence value="5">C</confidence>
+. Fig. 4B shows details regarding determining talk-time and bandwidth consu<confidence value="8">m</confidence>
+ed (showing exemplary formulae for talk-time and bandwidth consumed for different codec's G.71<confidence value="5">1</confidence>
+ <part-num-ref name="are further exemplified in Figs. 4B and 4C. Fig. 4B shows details regarding determining talk-time and bandwidth consumed (showing exemplary formulae for talk-time and bandwidth consumed for different codec's G.711">
+        <confidence value="8">1</confidence>
+      </part-num-ref>
+ through G. <part-num-ref name="through G.">711</part-num-ref>
+ <part-num-ref name="">6</part-num-ref>
+ and G.729 <part-num-ref name="and G.729">1</part-num-ref>
+ through <confidence value="5">G</confidence>
+.729 6). Fig.    </p>
+    <boundary-data type="header">
+      <confidence value="88">14</confidence>
+    </boundary-data>
+    <boundary-data type="header">Attorney Docket No. 3655/0320PUS<confidence value="8">1</confidence>
+    </boundary-data>
+    <p id="p-49" num="49">
+      <page-break num="15"/>
+4C shows details regarding determining percentage talk/listen time using exemplary formulae associated with different codec's G.71<confidence value="5">1</confidence>
+ <confidence value="8">1</confidence>
+ through G. <part-num-ref name="through G.">711</part-num-ref>
+ <part-num-ref name="">6</part-num-ref>
+ and G.729 <part-num-ref name="and G.729">1</part-num-ref>
+ through G.729 <part-num-ref name="through G.729">6.</part-num-ref>
+    </p>
+    <p id="p-50" num="50">
+      <confidence value="5">[</confidence>
+0040]       Fig. <confidence value="5">5</confidence>
+ shows an exemplary block diagram of a Network Voice Co<confidence value="52">nm</confidence>
+unication System (NVCS) <part-num-ref name="Network Voice Conmunication System (NVCS)">500</part-num-ref>
+ consistent with another embodiment of the invention. NVCS <part-num-ref name="invention. NVCS">500</part-num-ref>
+ may include diagnostic machine <part-num-ref name="may include diagnostic machine">510,</part-num-ref>
+ packet switched network <part-num-ref name="may include diagnostic machine 510, packet switched network">530,</part-num-ref>
+ CM <part-num-ref name="may include diagnostic machine 510, packet switched network 530, CM">550,</part-num-ref>
+ and NVCDs 560a-560n.    </p>
+    <p id="p-51" num="51">CM 550, NVCDs 560a-560n, and diagnostic machine 510 all may interface with packet switched network <part-num-ref name="all may interface with packet switched network">530.</part-num-ref>
+    </p>
+    <p id="p-52" num="52">
+      <confidence value="5">[</confidence>
+0041<confidence value="5">]</confidence>
+       Diagnostic machine may include processor 512, system bus 518, mass storage unit 520, I/O interface 535, memory 515, and network interface 525. Processor 512 may interface with memory <part-num-ref name="may interface with memory">515</part-num-ref>
+ and mass storage unit <part-num-ref name="and mass storage unit">520</part-num-ref>
+ via system bus <part-num-ref name="via system bus">518.</part-num-ref>
+ Memory <part-num-ref name="via system bus 518. Memory">515</part-num-ref>
+ and/or mass storage unit <part-num-ref name="and/or mass storage unit">520</part-num-ref>
+ may contain executable instructions and data for implementing the steps in method <part-num-ref name="steps in method">100.</part-num-ref>
+ Network interface <part-num-ref name="steps in method 100. Network interface">525</part-num-ref>
+ may interface with processor <part-num-ref name="may interface with processor">512</part-num-ref>
+ over system bus <part-num-ref name="over system bus">518,</part-num-ref>
+ and provide an interface for communication with external devices, such as NVCDs 560a-560n, over packet switched network <part-num-ref name="interface for communication with external devices, such as NVCDs 560a-560n, over packet switched network">530.</part-num-ref>
+ An I/O interface <part-num-ref name="I/O interface">535</part-num-ref>
+ may be provided to permit a user to interface to diagnostic machine <part-num-ref name="user to interface to diagnostic machine">510</part-num-ref>
+ via user interface <part-num-ref name="via user interface">540.</part-num-ref>
+ Processor <part-num-ref name="via user interface 540. Processor">512</part-num-ref>
+ may f<confidence value="777">urt</confidence>
+her communicate with either an internal and/or external database <part-num-ref name="internal and/or external database">570,</part-num-ref>
+ which may be used to store the results of program execution suitable for database applications. For example, asset management results could be presented as output delineated by colons as field separator for import into applications such as, for example, Microsoft Excel, Microsoft Access, Oracle, etc. Output may also be provided on terminal within user interface <part-num-ref name="results of program execution suitable for database applications. For example, asset management results could be presented as output delineated by colons as field separator for import into applications such as, for example, Microsoft Excel, Microsoft Access, Oracle, etc. Output may also be provided on terminal within user interface">
+        <confidence value="5">5</confidence>
+40      </part-num-ref>
+ interactively, or off loaded for reporting or archive purposes.    </p>
+    <p id="p-53" num="53">
+      <confidence value="5">[</confidence>
+0042<confidence value="5">]</confidence>
+       Diagnostic machine 510 may be a management server or client device. One of ordinary skill in the art would appreciate that diagnostic machine <part-num-ref name="art would appreciate that diagnostic machine">510</part-num-ref>
+ may be any type of computer utilizing any operating system. For example, processor <part-num-ref name="may be any type of computer utilizing any operating system. For example, processor">
+        <confidence value="5">5</confidence>
+12      </part-num-ref>
+ may be an x86 based CPU, and utilize any variant of the Linux operating system, f<confidence value="8">u</confidence>
+rther using, for example, the Bash <boundary-data type="header">
+        <confidence value="88">15</confidence>
+      </boundary-data>
+      <page-break num="16"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+shell, and the Pe<confidence value="66">rl</confidence>
+ scripting language for programming. Alternatively, digital machine <part-num-ref name="Perl scripting language for programming. Alternatively, digital machine">510</part-num-ref>
+ may be implemented as special purpose hardware. Other implementations could be based on portable form factors, for example, a Personal Digital Assistant, which may be usef<confidence value="8">u</confidence>
+l for technicians and administrators troubleshooting NVCS problems in a remote location.    </p>
+    <p id="p-54" num="54">[0043]      Switched packet network 530 may use any physical networking layer known in the art, such as, for example, twisted pair wiring, wireless implementations over 801.11 x, etc., and/or any combinations thereof<confidence value="5">.</confidence>
+    </p>
+    <p id="p-55" num="55">[0044<confidence value="5">]</confidence>
+      CM 550 may be a software module running which can run on a separate server (not shown) or may run on diagnostic machine <part-num-ref name="separate server (not shown) or may run on diagnostic machine">510</part-num-ref>
+ and residing in memory <part-num-ref name="and residing in memory">515</part-num-ref>
+ and/or mass storage unit. In other embodiments, CM <part-num-ref name="and/or mass storage unit. In other embodiments, CM">550</part-num-ref>
+ may be implemented as a dedicated hardware module.    </p>
+    <p id="p-56" num="56">[0045<confidence value="5">]</confidence>
+      Fig. 6 depicts an exemplary block diagram of a Networked Voice Co<confidence value="52">nm</confidence>
+unication Device (NVCD) consistent with various embodiments of the invention. NVCD <part-num-ref name="invention. NVCD">560</part-num-ref>
+ may include at least one processor <part-num-ref name="may include at least one processor">610,</part-num-ref>
+ a network interface <part-num-ref name="network interface">620,</part-num-ref>
+ and a memory unit <part-num-ref name="memory unit">630,</part-num-ref>
+ each interconnected via an interface bus <part-num-ref name="interface bus">640.</part-num-ref>
+ At least one processor <part-num-ref name="interface bus 640. At least one processor">610</part-num-ref>
+ may include general-purpose processors and/or Digital Signal Processing units. NVCD <part-num-ref name="may include general-purpose processors and/or Digital Signal Processing units. NVCD">560</part-num-ref>
+ may further include an I/O interface <part-num-ref name="I/O interface">650,</part-num-ref>
+ connected to processor <part-num-ref name="I/O interface 650, connected to processor">630</part-num-ref>
+ via interface bus <part-num-ref name="via interface bus">640,</part-num-ref>
+ and may be f<confidence value="88">ur</confidence>
+ther interfaced to A/D unit <part-num-ref name="via interface bus 640, and may be further interfaced to A/D unit">660</part-num-ref>
+ and D/A unit <part-num-ref name="and D/A unit">670.</part-num-ref>
+ A/D unit <part-num-ref name="and D/A unit 670. A/D unit">660</part-num-ref>
+ may be further coupled to microphone <part-num-ref name="may be further coupled to microphone">680,</part-num-ref>
+ and D/A unit <part-num-ref name="may be further coupled to microphone 680, and D/A unit">670</part-num-ref>
+ may be further coupled to speaker <part-num-ref name="may be further coupled to speaker">690.</part-num-ref>
+ Voice input provided by a user may be converted to an electrical signal by microphone <part-num-ref name="electrical signal by microphone">680,</part-num-ref>
+ and may be digitized by A/D <part-num-ref name="electrical signal by microphone 680, and may be digitized by A/D">660.</part-num-ref>
+ The digitized voice signal may be carried by I/O interface <part-num-ref name="digitized voice signal may be carried by I/O interface">650</part-num-ref>
+ to at least one processor <part-num-ref name="to at least one processor">610</part-num-ref>
+ for various coding and processing functions, and subsequently sent over switched packet network <part-num-ref name="for various coding and processing functions, and subsequently sent over switched packet network">530</part-num-ref>
+ for voice <confidence value="88776">commu</confidence>
+nications with other party/parties. Incoming encoded digital voice signals may come over network <part-num-ref name="for voice communications with other party/parties. Incoming encoded digital voice signals may come over network">530</part-num-ref>
+ from other NVCDs 560a-560n, and pass through network interface <part-num-ref name="from other NVCDs 560a-560n, and pass through network interface">620</part-num-ref>
+ to at <boundary-data type="header">
+        <confidence value="88">16</confidence>
+      </boundary-data>
+      <page-break num="17"/>
+      <boundary-data type="header">Attorney Docket No. 3655/0320PUS1</boundary-data>
+least one processor <part-num-ref name="to at least one processor">610,</part-num-ref>
+ where it may be decoded and sent to I/O interface <part-num-ref name="to at least one processor 610, where it may be decoded and sent to I/O interface">650.</part-num-ref>
+ <confidence value="686">I/O</confidence>
+ interface <part-num-ref name="to at least one processor 610, where it may be decoded and sent to I/O interface 650. I/O interface">650</part-num-ref>
+ may pass the decoded digital voice signals to D/A converter, where the digital signal may be converted to an analog voice signal. The analog voice signal may then be played through speaker <part-num-ref name="analog voice signal may then be played through speaker">690</part-num-ref>
+ so the user may hear other party/parties being in the conversation. Network interface <part-num-ref name="conversation. Network interface">620</part-num-ref>
+ allows NVCD <part-num-ref name="allows NVCD">560</part-num-ref>
+ to <confidence value="22222222222">conmunicate</confidence>
+ with other devices (for example, diagnostic machine <part-num-ref name="to conmunicate with other devices (for example, diagnostic machine">510)</part-num-ref>
+ over switched packet network <part-num-ref name="over switched packet network">530.</part-num-ref>
+    </p>
+    <p id="p-57" num="57">
+      <confidence value="5">[</confidence>
+0046<confidence value="5">]</confidence>
+       Memory unit 630 may store the Management Information Base (MIB). MIB may further include various operational and other forms of data, including, for example: device type, I.P. Address, M.A.C. address, model number, Serial number, AGLs, connection status, and number of input/output UDP packets.    </p>
+    <p id="p-58" num="58">
+      <confidence value="5">[</confidence>
+0047<confidence value="4">]</confidence>
+       NVCD 560 may be any type networking voice communications device known to one of ordinary skill in the art. For example, NVCD <part-num-ref name="art. For example, NVCD">560</part-num-ref>
+ may be a VoIP telephone, such as, for example, an Avaya 46xx or 96xx unit. Alternatively, NVCD may be a software module (e.g., a soft-phone) running on a computer (e.g., a laptop, desktop, workstation, server, and/or etc.).    </p>
+    <p id="p-59" num="59">NVCD 560 may be a portable device, such as, for example, a PDA or multi-f<confidence value="66">un</confidence>
+ction cellular telephone, a desktop handset, other wireless radio-telephones, or other devices using WiFi 801.1<confidence value="5">1</confidence>
+ x or any other switched packet network known to one of ordinary skill in the a<confidence value="66">rt</confidence>
+. One of ordinary skill in the art would appreciate that various embodiments of the invention described herein may also be utilized for networked communication devices transferring video and/or still image info<confidence value="67">rm</confidence>
+ation, either alone or in combination with voice information.    </p>
+    <p id="p-60" num="60">[0048<confidence value="5">]</confidence>
+       Although detailed embodiments and implementations of the present invention have been described above, it should be apparent that various modifications are possible without departing from the spirit and scope of the present invention.    </p>
+    <boundary-data type="header">
+      <confidence value="88">17</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11554213.xml

@@ -0,0 +1,413 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11554213</doc-number>
+        <date>2006-10-30</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <heading id="h-1">MET<confidence value="8">H</confidence>
+OD OF IMPROVED VIEWING OF VISUAL OBJECTS    </heading>
+    <heading id="h-2">ON A DISPLAY, AN<confidence value="5">D</confidence>
+ HAND<confidence value="8">H</confidence>
+ELD ELECTRONIC DEVICE    </heading>
+    <heading id="h-3">BACKGROUND</heading>
+    <p id="p-1" num="1">Field [0001] The disclosed and claimed concept relates generally to handheld electronic devices and, more particularly, to a method of facilitating the viewing of subject matter output on a display of a handheld electronic device.</p>
+    <p id="p-2" num="2">Related Art <confidence value="88">[0</confidence>
+002] Numerous types of handheld electronic devices are known. Examples of such hand<confidence value="8">h</confidence>
+eld electronic devices include, for instance, personal data assistants (PDAs), handheld computers, two-way pagers, cellular telephones, and the like. Many handheld electronic devices also feature a wireless communication capability, although many such handheld electronic devices are stand-alone devices that are functional without communication with other devices.    </p>
+    <p id="p-3" num="3">[0003] Handheld electronic devices typically are configured to be relatively small, i.e., handheld, and thus oftentimes have physically small components such as keypads and displays. As such, users can occasionally have difficulty viewing certain of the details on the display screen. This situation is exacerbated by the fact that users oftentimes are able to pay only a limited amount of attention to a display of a handheld electronic device during use because, for instance, the user may be doing other things such as walking, participating in a meeting, etc. It thus would be desired to provide an improved method and handheld electronic device wherein the user is more readily able to see certain subject matter that is output on a display.</p>
+    <heading id="h-4">BRIEF DESCRIPTION OF THE DRAWING</heading>
+    <p id="p-4" num="4">[0004] A full understanding of the disclosed and claimed concept can be gained from the following Description when read in conjunction with the accompanying drawings in which:</p>
+    <p id="p-5" num="5">[0005] Fig. 1 is an improved hand<confidence value="8">h</confidence>
+eld electronic device in accordance with the disclosed and claimed concept and having an exemplary output on a display thereof<confidence value="5">;</confidence>
+    </p>
+    <p id="p-6" num="6">[0006] Fig. 2 is a schematic depiction of the handheld electronic device of Fig. 1;</p>
+    <p id="p-7" num="7">[0007] Fig. 3 is a depiction of another exemplary output on the display of the handheld electronic device of Fig. 1;</p>
+    <p id="p-8" num="8">[0008] Fig. 4 is a view of another exemplary output on the display;</p>
+    <boundary-data type="header">
+      <confidence value="7">1</confidence>
+    </boundary-data>
+    <p id="p-9" num="9">
+      <page-break num="2"/>
+[0009]  Fig. 4A is a view of another exemplary output on the display;    </p>
+    <p id="p-10" num="10">[0010]  Fig. 4B is a view of another exemplary output on the display;</p>
+    <p id="p-11" num="11">[0011]  Fig. 5 is a view of another exemplary output on the display;</p>
+    <p id="p-12" num="12">[0012]  Fig. 6 is a view of another exemplary output on the display;</p>
+    <p id="p-13" num="13">[0013]  Fig. 7 is a view of another exemplary output on the display;</p>
+    <p id="p-14" num="14">[0014]  Fig. 8 is a view of another exemplary output on the display;</p>
+    <p id="p-15" num="15">[0015]  Fig. 9 is a view of another exemplary output on the display;</p>
+    <p id="p-16" num="16">[0016]  Fig. 10 is a view of another exemplary output on the display; and [0017]  Fig. 11 is a view of another exemplary output on the display.</p>
+    <p id="p-17" num="17">[0018]  Similar numerals refer to similar parts throughout the specification.</p>
+    <heading id="h-5">DESCRIPTION</heading>
+    <p id="p-18" num="18">[0019]  An improved ha<confidence value="8">n</confidence>
+dheld electronic device <part-num-ref name="improved handheld electronic device">4</part-num-ref>
+ in accordance with the disclosed and claimed concept is depicted generally in Fig. 1 and is depicted schematically in Fig. 2.    </p>
+    <p id="p-19" num="19">The ha<confidence value="8">n</confidence>
+dheld electronic device 4 comprises an input apparatus <part-num-ref name="input apparatus">8,</part-num-ref>
+ a processor apparatus <part-num-ref name="processor apparatus">12,</part-num-ref>
+ and an output apparatus <part-num-ref name="output apparatus">16,</part-num-ref>
+ all of which are disposed on a case <part-num-ref name="case">18.</part-num-ref>
+ The input apparatus <part-num-ref name="input apparatus">8</part-num-ref>
+ is structured to provide input signals to the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+ The output apparatus <part-num-ref name="output apparatus">16</part-num-ref>
+ is structured to receive output signals from the processor apparatus <part-num-ref name="processor apparatus">12</part-num-ref>
+ and to responsively provide output.    </p>
+    <p id="p-20" num="20">[0020] The input apparatus <part-num-ref name="input apparatus">8</part-num-ref>
+ comprises a plurality of actuatable keys <part-num-ref name="plurality of actuatable keys">20</part-num-ref>
+ and a track wheel <part-num-ref name="track wheel">24.</part-num-ref>
+ The track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ is rotatable as is indicated at the numeral <part-num-ref name="numeral">28</part-num-ref>
+ to provide navigational inputs and other inputs to the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+ The track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ additionally is translatable in a direction toward the case <part-num-ref name="case">18,</part-num-ref>
+ as is indicated at the numeral <part-num-ref name="numeral">32,</part-num-ref>
+ to provide selection inputs and other inputs to the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+ It is noted that other input devices such as track balls, joysticks, and the like could be provided in place of or in addition to the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ without departing from the present concept.    </p>
+    <p id="p-21" num="21">[0021]  The processor apparatus <part-num-ref name="processor apparatus">12</part-num-ref>
+ comprises a processor <part-num-ref name="processor">36</part-num-ref>
+ and a memory <part-num-ref name="memory">40</part-num-ref>
+ within which are stored are a number of routines <part-num-ref name="number of routines">44.</part-num-ref>
+ As employed herein, the expression "a number <confidence value="882">of'</confidence>
+ and variations thereof shall refer broadly to any nonzero quantity, including a quantity of one. The routines <part-num-ref name="routines">44</part-num-ref>
+ are executable on the processor <part-num-ref name="processor">36.</part-num-ref>
+    </p>
+    <p id="p-22" num="22">[0022]  The output apparatus <part-num-ref name="output apparatus">16</part-num-ref>
+ comprises a display <part-num-ref name="display">48</part-num-ref>
+ which can be any of a wide variety of display devices such as LCD, and the like. In Fig. 1, the display <part-num-ref name="display">48</part-num-ref>
+ has a first output <part-num-ref name="first output">52</part-num-ref>
+ displayed thereon, with the first output <part-num-ref name="first output">52</part-num-ref>
+ comprising a number of visual objects which include a plurality of icons <part-num-ref name="plurality of icons">56.</part-num-ref>
+ It can be seen that one of the icons <part-num-ref name="icons">56</part-num-ref>
+ is an initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ that appears larger than any of the other icons <part-num-ref name="other icons">56</part-num-ref>
+ and is depicted as being surrounded by a <boundary-data type="header">
+        <confidence value="8">2</confidence>
+      </boundary-data>
+      <page-break num="3"/>
+box <part-num-ref name="box">58.</part-num-ref>
+ The box <part-num-ref name="box">58</part-num-ref>
+ is indicative of a visual focus being on the initial icon <part-num-ref name="initial icon">60.</part-num-ref>
+ Hereinafter, the expression "visual focus" and variations thereof shall refer broadly to a visual object, such as in a graphical user interface (GUI), that is currently selected, is currently selectable, or is otherwise the subject of special treatment by the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+ Since the visual focus is on the initial icon <part-num-ref name="initial icon">60,</part-num-ref>
+ a selection input from the track wheel <part-num-ref name="track wheel">24,</part-num-ref>
+ such as might result from translating or clicking the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction of the arrow <part-num-ref name="arrow">32,</part-num-ref>
+ will cause the routine <part-num-ref name="routine">44</part-num-ref>
+ that is represented by the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ to be executed on the processor <part-num-ref name="processor">36.</part-num-ref>
+ The box <part-num-ref name="box">58</part-num-ref>
+ is depicted herein for purposes of explanation and may or may not actually be output on the display <part-num-ref name="display">48.</part-num-ref>
+    </p>
+    <p id="p-23" num="23">[0023]  In Fig. 1, the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ is depicted as being larger than a first icon 64A and a second icon 68A therein. Fig. 1 depicts the first and second icons 64A and 68A as being roughly of the same size. The relatively larger size of the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ in Fig. 1 advantageously visually indicates to a user that in Fig. 1 the visual focus is on the initial icon <part-num-ref name="initial icon">60.</part-num-ref>
+ Such relative enlargement of a visual object is advantageous because it highlights to a user the visual object that the user is <confidence value="8">t</confidence>
+rying to view. This is particularly useful for users who are, for instance, visually impaired or otherwise impaired.    </p>
+    <p id="p-24" num="24">[0024] Fig. 1 also depicts a space <part-num-ref name="space">66,</part-num-ref>
+ i.e., a blank region, between the first and second icons 64A and 68A. The spacing between any adjacent pair of icons <part-num-ref name="spacing between any adjacent pair of icons">56</part-num-ref>
+ is roughly the same as the space <part-num-ref name="space">66</part-num-ref>
+ between the first and second icons 64A and 68A in Fig. 1, except that the relatively larger initial icon <part-num-ref name="relatively larger initial icon">60</part-num-ref>
+ in Fig. 1 is disposed relatively closer to its adjacent icons than could be accommodated by the space <part-num-ref name="space">66</part-num-ref>
+ of Fig. 1.    </p>
+    <p id="p-25" num="25">[0025] Fig. 3 depicts a second output <part-num-ref name="second output">76</part-num-ref>
+ on the display <part-num-ref name="display">48.</part-num-ref>
+ The second output <part-num-ref name="second output">76</part-num-ref>
+ comprises the icons <part-num-ref name="icons">56,</part-num-ref>
+ with the first icon 64B being an enlarged version of the first icon 64A of Fig. 1. Such enlargement indicates that the visual focus in Fig. 3 is on the first icon 64B rather than on the initial icon <part-num-ref name="initial icon">60.</part-num-ref>
+ It can also be seen that the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ in Fig. 3 is no longer enlarged as in Fig. 1, which further visually indicates to a user that the visual focus no longer is on the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ or on the routine <part-num-ref name="routine">44</part-num-ref>
+ that it represents. The second icon 68A in Fig. 3 is the same size as it was depicted at the numeral 68A in Fig. 1.    </p>
+    <p id="p-26" num="26">[0026] The visual focus could have been shifted from the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ in Fig. 1 to the first icon 64B in Fig. 3 by rotating the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction indicated at the numeral <part-num-ref name="numeral">28</part-num-ref>
+ to provide, for instance, a navigational input <part-num-ref name="navigational input">28</part-num-ref>
+ to the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+    </p>
+    <p id="p-27" num="27">Since the visual focus has been shifted from the initial icon <part-num-ref name="initial icon">60</part-num-ref>
+ in Fig. 1 to the first icon <part-num-ref name="first icon">64</part-num-ref>
+ in Fig. 3, the processor apparatus <part-num-ref name="processor apparatus">12</part-num-ref>
+ has provided to the output apparatus <part-num-ref name="output apparatus">16</part-num-ref>
+ instructions indicating that the enlarged initial icon <part-num-ref name="enlarged initial icon">60</part-num-ref>
+ in Fig. 1 should be redisplayed in its default, i.e., <boundary-data type="header">
+        <confidence value="8">3</confidence>
+      </boundary-data>
+      <page-break num="4"/>
+relatively smaller, size in Fig. 3, and that the first icon 64A depicted in Fig. <confidence value="5">1</confidence>
+ at its default, i.e., relatively smaller size, should be redisplayed in Fig. 3 in an enlarged form as the first icon 64B.    </p>
+    <p id="p-28" num="28">[0027] The change in size of the visual objects such as the icons <part-num-ref name="icons">56</part-num-ref>
+ between the initial size thereof and the enlarged size thereof could be depicted as, for example, a given icon <part-num-ref name="given icon">56</part-num-ref>
+ displayed at the initial size being redisplayed at the enlarged size, and vi<confidence value="68">ce</confidence>
+-versa.    </p>
+    <p id="p-29" num="29">Alternatively, a visual object such as a given icon <part-num-ref name="given icon">56</part-num-ref>
+ could be depicted as progressively changing in size between the initial size and the enlarged size. For instance, the given icon <part-num-ref name="given icon">56</part-num-ref>
+ could be depicted as gradually growing in size from the initial size to the enlarged size, and as gradually shrinking in size from the enlarged size to the initial size. Other variations will be apparent.    </p>
+    <p id="p-30" num="30">[0028] Also, the change in size of a given visual object between the initial and enlarged sizes need not occur immediately upon the visual focus being on the given visual object or being removed from the given visual object. For instance, the system might visually depict the change in size of a given visual object between the initial and enlarged sizes only after the visual focus has remained on the given visual object or another visual object for a predetermined period of time. This would be helpful if, for instance, the user is quickly scrolling past a number of visual objects without waiting, because it would avoid unnecessarily enlarging visual objects in which the user is not interested, thereby avoiding the processing burden and the visual distraction of numerous visual objects being depicted as quickly shifting between initial and enlarged sizes.</p>
+    <p id="p-31" num="31">[0029]   The initial icon <part-num-ref name="initial icon">60,</part-num-ref>
+ the first icon 64A and 64<confidence value="5">B</confidence>
+, and the second icon 68A are each depicted at the same position on the display <part-num-ref name="display">48</part-num-ref>
+ relative to one another in each of Figs. 1 and <part-num-ref name="and">3.</part-num-ref>
+ It can be seen, however, from Fig. 3 that the first icon 64B in an enlarged form occupies at least a portion of the space <part-num-ref name="space">66</part-num-ref>
+ of Fig. 1. In this regard, it can be seen that the icons <part-num-ref name="icons">56</part-num-ref>
+ in their default, i.e., relatively smaller, size are spaced apart from one another sufficiently to enable each to be visually distinguished from one another. When the visual focus moves to a particular icon <part-num-ref name="particular icon">56,</part-num-ref>
+ such as to the icon 64B in Fig. 3, the enlargement of the first icon 64B helps to visually highlight the first icon 64B from the other non-enlarged icons <part-num-ref name="other non-enlarged icons">56,</part-num-ref>
+ and to highlight in the user's mind the particular routine <part-num-ref name="particular routine">44</part-num-ref>
+ which is represented by the first icon 64B that is currently the subject of the visual focus. Additionally in Fig. 3, by occupying at least a portion of the space <part-num-ref name="space">66</part-num-ref>
+ that was present between the first and second icons 64A and 68A in Fig. 1, the enlarged first icon 64B is disposed closer to the icons <part-num-ref name="icons">56</part-num-ref>
+ that are adjacent thereto. Such a visual distinction in the spacing among the icons <part-num-ref name="icons">56</part-num-ref>
+ <boundary-data type="header">
+        <confidence value="8">4</confidence>
+      </boundary-data>
+      <page-break num="5"/>
+provides a visual aberration on the display <part-num-ref name="display">48,</part-num-ref>
+ which tends to further highlight the fact in Fig.    </p>
+    <p id="p-32" num="32">3 that the visual focus is currently on the enlarged first icon 64B.</p>
+    <p id="p-33" num="33">[0030] Fig. 4 depicts a third output <part-num-ref name="third output">80</part-num-ref>
+ being displayed on the display <part-num-ref name="display">48.</part-num-ref>
+ In Fig. 4, the first icon 64A has been returned to its default, i.e. relatively smaller, size but the second icon 68B has been redisplayed in an enlarged form when compared with the second icon 68A of Fig. 3. The second icon 68<confidence value="5">B</confidence>
+, being enlarged in Fig. 4, occupies at least a portion of the space <part-num-ref name="space">66</part-num-ref>
+ that had existed between the first and second icons 64A and 68A when displayed at their default size in Fig. 1.    </p>
+    <p id="p-34" num="34">[0031]  It thus can be seen from Figs. 1, 3, and 4 that as the visual focus changes from one visual object, i.e., icon <part-num-ref name="icon">56,</part-num-ref>
+ on the display <part-num-ref name="display">48</part-num-ref>
+ to another, the particular icon <part-num-ref name="particular icon">56</part-num-ref>
+ that is currently the subject of the visual focus is redisplayed from its default size to an enlarged size. The enlarged size of the particular icon <part-num-ref name="particular icon">56,</part-num-ref>
+ along with the relatively smaller spacing between the particular icon <part-num-ref name="particular icon">56</part-num-ref>
+ and the icons <part-num-ref name="icons">56</part-num-ref>
+ adjacent thereto, advantageously provide to a user two visual indications that the particular icon <part-num-ref name="particular icon">56,</part-num-ref>
+ and the routine <part-num-ref name="routine">44</part-num-ref>
+ which the particular icon <part-num-ref name="particular icon">56</part-num-ref>
+ represents, is the subject of the visual focus.    </p>
+    <p id="p-35" num="35">[0032] It is noted that the degree of enlargement of a visual object between the initial size and the enlarged size may be user-customizable. For instance, an ordinary user may desire to have the visual objects enlarged only to a nominal degree, such as might be depicted in Figs. 1, <part-num-ref name="nominal degree, such as might be depicted in Figs. 1,">3,</part-num-ref>
+ and <part-num-ref name="nominal degree, such as might be depicted in Figs. 1, 3, and">4.</part-num-ref>
+ Another user, such as one which is visually impaired or otherwise impaired, might desire that the enlarged visual objects have a much greater degree of enlargement. For instance, Fig. 4A depicts the second icon 68BB enlarged to a substantially greater degree than the enlarged second icon 68B in Fig. 4. That is, the second icon 68A in Fig. 3 might be enlarged to the size of the second icon 68BB in Fig. 4A upon the visual focus being on the second icon 68<confidence value="66">BB</confidence>
+. Depending upon the degree of enlargement of a visual object, the enlarged visual object might overlap at least a portion of an adjacent visual object, such as is the case in Fig. 4A. In such a situation, it might be desirable to depict the highly enlarged second icon 68BB in such a fashion that at least a portion of it appears to be at least partially transparent so as to enable at least a portion of the overlapped region of an adjacent icon <part-num-ref name="adjacent icon">56</part-num-ref>
+ to be viewed by the user.    </p>
+    <p id="p-36" num="36">[0033] As the visual focus is shifted from one icon <part-num-ref name="visual focus is shifted from one icon">56</part-num-ref>
+ to another icon <part-num-ref name="to another icon">56,</part-num-ref>
+ the another icon <part-num-ref name="another icon">56</part-num-ref>
+ is redisplayed in enlarged form, which indicates t<confidence value="8">h</confidence>
+at it is now the subject of the visual focus, and the one icon <part-num-ref name="one icon">56</part-num-ref>
+ is redisplayed from its enlarged size to its default, i.e., relatively smaller, size indicating that the visual focus is no longer on the one icon <part-num-ref name="one icon">56.</part-num-ref>
+ While Figs. 1, <part-num-ref name="one icon 56. While Figs. 1,">3</part-num-ref>
+ and <part-num-ref name="and">4</part-num-ref>
+ suggest that successive navigational inputs by the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction <boundary-data type="header">
+        <confidence value="8">5</confidence>
+      </boundary-data>
+      <page-break num="6"/>
+indicated at the numeral <part-num-ref name="numeral">28</part-num-ref>
+ cause the visual focus to shift in a left-right, i.e., east-west direction, it is noted that other navigational inputs or other inputs from the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ or from other input members of the input apparatus <part-num-ref name="input apparatus">8,</part-num-ref>
+ whether or not expressly depicted herein, can cause the visual focus to be shifted in an up-down, i.e., north-south direction or in other directions among the icons <part-num-ref name="icons">56.</part-num-ref>
+    </p>
+    <p id="p-37" num="37">[0034] For instance, the visual objects need not be in the grid pattern of the icons of Fig. 1, and the visual objects rather could be in numerous other arrangements. A track ball input device would allow navigation to any Cartesian coordinate on the display <part-num-ref name="display">48.</part-num-ref>
+ Also, the visual objects need not be limited to the icons <part-num-ref name="icons">56,</part-num-ref>
+ and rather could be any visual object on the display <part-num-ref name="display">48.</part-num-ref>
+ For example, many handheld electronic devices have a battery level indicator that could usefully be enlarged in accordance with the disclosed and claimed concept. Similarly, a handheld electronic device having a wireless communication capability likely would have a signal strength indicator which could similarly be enlarged in accordance with the disclosed and claimed concept.    </p>
+    <p id="p-38" num="38">[0035]  It is noted that the visual objects need not be the same size. Even in the situation of the icons <part-num-ref name="icons">56,</part-num-ref>
+ which all appear in Figs. 1, <part-num-ref name="icons 56, which all appear in Figs. 1,">3,</part-num-ref>
+ and <part-num-ref name="icons 56, which all appear in Figs. 1, 3, and">4</part-num-ref>
+ to have the same initial size, could have different initial sizes. For instance, certain icons <part-num-ref name="same initial size, could have different initial sizes. For instance, certain icons">56</part-num-ref>
+ for routines <part-num-ref name="for routines">44</part-num-ref>
+ that might be used with more frequency by the user could have a larger initial size than other icons <part-num-ref name="larger initial size than other icons">56</part-num-ref>
+ for routines <part-num-ref name="for routines">44</part-num-ref>
+ that are less frequently used. In such a situation, enlargement of the various visual objects could be handled in various ways. For instance, the enlarged size of each visual object could be a certain percentage in excess of its initial size, regardless of the specific initial size. Alternatively, all of the visual objects of different initial sizes could all be of the same enlarged size. Other alternatives will be readily apparent.    </p>
+    <p id="p-39" num="39">[0036] Fig. 4B depicts another type of visual object that can be enlarged from an initial size to an enlarged size. Specifically, Fig. 4B depicts a menu <part-num-ref name="menu">92</part-num-ref>
+ having a plurality of menu items <part-num-ref name="plurality of menu items">96.</part-num-ref>
+ In the exemplary embodiment depicted herein, the menu items <part-num-ref name="menu items">96</part-num-ref>
+ serve as visual objects that are enlarged from an initial size to an enlarged size when the visual focus is thereon.    </p>
+    <p id="p-40" num="40">[0037] It is noted that the subject of the visual focus can be indicated in alternative or additional ways. For instance, a visual object that is the subject of the visual focus could appear in color whereas the other visual objects appear in grayscale. Similarly, a visual object that is the subject of the visual focus could appear in relatively brighter colors than the colors of the other visual objects. A visual object that is the subject of the visual focus could be depicted at a higher level of brightness than the other visual objects. Similarly, a visual <boundary-data type="header">
+        <confidence value="8">6</confidence>
+      </boundary-data>
+      <page-break num="7"/>
+object that is the subject of the visual focus could appear at a higher level of contrast than the other visual objects. For instance, such higher contrast could be with respect to the background of the display <part-num-ref name="display">48,</part-num-ref>
+ other visual objects on the display <part-num-ref name="display">48,</part-num-ref>
+ or with respect to any other reference. Any one or more of these can be used to highlight a visual object that is the subject of the visual focus, whether or not the visual object additionally is being depicted in an enlarged form.    </p>
+    <p id="p-41" num="41">[0038]   Figs. 5 and <part-num-ref name="and">6</part-num-ref>
+ depict other outputs on the display <part-num-ref name="display">48.</part-num-ref>
+ Specifically, Fig. 5 depicts on the display <part-num-ref name="display">48</part-num-ref>
+ one output <part-num-ref name="one output">174</part-num-ref>
+ that comprises a quantity of text <part-num-ref name="quantity of text">184.</part-num-ref>
+ Such a quantity of text <part-num-ref name="quantity of text">184</part-num-ref>
+ could be provided as part of a text input routine <part-num-ref name="text input routine">44,</part-num-ref>
+ and e-mail routine <part-num-ref name="text input routine 44, and e-mail routine">44,</part-num-ref>
+ a web browser routine <part-num-ref name="web browser routine">44,</part-num-ref>
+ or any of a number of other routines <part-num-ref name="number of other routines">44.</part-num-ref>
+ Fig. 5 depicts a first sentence 164<confidence value="5">B</confidence>
+ of the quantity of text <part-num-ref name="quantity of text">184</part-num-ref>
+ being displayed in a font that is relatively larger than the other portions of the text in the quantity of text <part-num-ref name="quantity of text">184.</part-num-ref>
+ For example, the quantity of text <part-num-ref name="quantity of text">184</part-num-ref>
+ might be output on the display <part-num-ref name="display">48</part-num-ref>
+ with a default size of twelve point type. The passage of text that is the subject of the visual focus, i.e., the first sentence 164<confidence value="5">B</confidence>
+ in Fig. 5, may be displayed in sixteen point type. That is, the first sentence 164<confidence value="5">B</confidence>
+ is output in sixteen point type, and a second sentence 168A adjacent the first sentence 164B is output in twelve point type. The first sentence 164A and 164B, and the second sentence 168A and 168<confidence value="5">B</confidence>
+, are visual objects on the display <part-num-ref name="display">48.</part-num-ref>
+    </p>
+    <p id="p-42" num="42">[0039] Fig. 6 depicts on the display <part-num-ref name="display">48</part-num-ref>
+ another output <part-num-ref name="another output">178</part-num-ref>
+ wherein the visual focus has shifted from the first sentence 164A to the second sentence 168<confidence value="5">B</confidence>
+. In shifting the visual focus from the first sentence <confidence value="5">1</confidence>
+64A to the second sentence 168<confidence value="5">B</confidence>
+, the first sentence 164<confidence value="5">B</confidence>
+ of Fig. 5 is redisplayed in its default, i.e., smaller, font size as the first sentence 164A in Fig. 6, and the second sentence 168A in Fig. 5 is redisplayed with a relatively larger font as the enlarged second sentence 168<confidence value="5">B</confidence>
+ in Fig. 6.    </p>
+    <p id="p-43" num="43">[0040] The shifting of the visual focus from the first sentence 164<confidence value="5">B</confidence>
+ in Fig. 5 to the second sentence 168<confidence value="5">B</confidence>
+ in Fig. 6 may have resulted from a navigational input from the track wheel <part-num-ref name="track wheel">24,</part-num-ref>
+ such as by rotation in the direction indicated at the numeral <part-num-ref name="numeral">28,</part-num-ref>
+ or could have resulted from other navigation inputs and/or selection inputs. With each such successive navigation input, for example, a successive passage in the quantity of text <part-num-ref name="quantity of text">184</part-num-ref>
+ is enlarged.    </p>
+    <p id="p-44" num="44">The particular passages employed herein are sentences, i.e., the first sentence 164<confidence value="5">B</confidence>
+ of Fig. 5 and the second sentence 168<confidence value="5">B</confidence>
+ of Fig. 6, within the quantity of text <part-num-ref name="quantity of text">184.</part-num-ref>
+ Each sentence represents a complete thought or expression within the quantity of text <part-num-ref name="quantity of text">184.</part-num-ref>
+ By successively enlarging such successive passages in the quantity of text <part-num-ref name="quantity of text">184,</part-num-ref>
+ sentences in the present example, the successively enlarged visual objects are successive complete thoughts within the <boundary-data type="header">
+        <confidence value="8">7</confidence>
+      </boundary-data>
+      <page-break num="8"/>
+quantity of text <part-num-ref name="quantity of text">184.</part-num-ref>
+ However, other types of passages of text may be successively enlarged, i.e., clauses within the text between punctuation marks, predetermined phrases, and the like.    </p>
+    <p id="p-45" num="45">[0041]  The successive enlargement allows the user to quickly read the enlarged text and to perceive its meaning on the basis of consecutive complete thoughts that are successively perceived by the user. The system enables the user to enlarge successive passages, i.e., sentences in the present example, and f<confidence value="8">u</confidence>
+rther allows the user to quickly scroll through a quantity of text to a desired passage for selective enlargement of the passage. Such enlargement occurs automatically when the visual focus is on a particular passage, i.e., the sentence of the present example.    </p>
+    <p id="p-46" num="46">[0042] The output apparatus <part-num-ref name="output apparatus">16</part-num-ref>
+ of the handheld electronic device may also comprise an audio output, and the routines <part-num-ref name="routines">44</part-num-ref>
+ may include a voice synthesis routine <part-num-ref name="voice synthesis routine">44</part-num-ref>
+ that can convert text into an audible output that is representative of the passage of text being spoken. Such a configuration is particularly usef<confidence value="8">u</confidence>
+l for users who are visually impaired or otherwise impaired.    </p>
+    <p id="p-47" num="47">Such a system also could be configured to audibly output a spoken expression representative of another visual object such as an icon <part-num-ref name="icon">56</part-num-ref>
+ or other visual object when it is the subject of the visual focus. For instance, the system might output an audible output of the spoken word "telephone" when a telephone icon <part-num-ref name="telephone icon">56</part-num-ref>
+ is the subject of the visual focus.    </p>
+    <p id="p-48" num="48">[0043]  Addition outputs on the display <part-num-ref name="display">48</part-num-ref>
+ are depicted in Figs. 7 and <part-num-ref name="and">8.</part-num-ref>
+ Fig. 7 depicts one output <part-num-ref name="depicts one output">274,</part-num-ref>
+ such as an output of an address book routine <part-num-ref name="address book routine">44</part-num-ref>
+ or other routine <part-num-ref name="or other routine">44,</part-num-ref>
+ having a plurality of input fields and a label for each such input field. For instance, the one output <part-num-ref name="one output">274</part-num-ref>
+ comprises a name input field <part-num-ref name="name input field">262</part-num-ref>
+ and a name label 264<confidence value="5">B</confidence>
+ that are associated with one another.    </p>
+    <p id="p-49" num="49">The name label 264B in Fig. 7 is displayed in a font that is slightly enlarged when compared with the other labels in the one output <part-num-ref name="one output">274.</part-num-ref>
+    </p>
+    <p id="p-50" num="50">[0044]  For instance, the one output <part-num-ref name="one output">274</part-num-ref>
+ additionally includes an e-mail input field <part-num-ref name="e-mail input field">270</part-num-ref>
+ and, associated therewith, an e-mail label 268A which is depicted in the one output <part-num-ref name="one output">274</part-num-ref>
+ as being of a relatively smaller font than that of the name label 264<confidence value="5">B</confidence>
+. The name label 264<confidence value="5">B</confidence>
+ being displayed in the one output <part-num-ref name="one output">274</part-num-ref>
+ with a larger font than that of the <confidence value="5">e</confidence>
+-mail label 268A indicates that an input focus of the system is on the name input field <part-num-ref name="name input field">262.</part-num-ref>
+ Hereinafter, the expression "input focus" and variations thereof shall refer broadly to a visual object, such as in a graphical user interface (GUI), that is currently capable of being the subject of an input by a user. That is, the input focus of the system is on the name input field <part-num-ref name="name input field">262</part-num-ref>
+ and, since the name input field <part-num-ref name="name input field">262</part-num-ref>
+ and the name label 264<confidence value="5">B</confidence>
+ are associated with one another, the displaying of the name label 264<confidence value="5">B</confidence>
+ with an enlarged font visually indicates to a user that the input focus <boundary-data type="header">
+        <confidence value="8">8</confidence>
+      </boundary-data>
+      <page-break num="9"/>
+of the system is on the name input field <part-num-ref name="name input field">262.</part-num-ref>
+ A cursor <part-num-ref name="cursor">282</part-num-ref>
+ in the name input field <part-num-ref name="name input field">262</part-num-ref>
+ further illustrates that the input focus is on the name input field <part-num-ref name="name input field">262.</part-num-ref>
+    </p>
+    <p id="p-51" num="51">[0045] Fig. 8 depicts on the display <part-num-ref name="display">48</part-num-ref>
+ another output <part-num-ref name="another output">278</part-num-ref>
+ wherein the e-mail label 268B is shown as an enlarged version of the e-mail label 268A of Fig. 7. This visually indicates to a user that the input focus in Fig. 8 is on the e-mail input field <part-num-ref name="e-mail input field">270</part-num-ref>
+ since the e- mail input field <part-num-ref name="e- mail input field">270</part-num-ref>
+ and the e-mail label 268B are associated with one another. Since the input focus had shifted from the name input field <part-num-ref name="name input field">262</part-num-ref>
+ in Fig. 7 to the e-mail input field <part-num-ref name="e-mail input field">270</part-num-ref>
+ in Fig. 8, the enlarged name label 264B of Fig. 7 was redrawn as the relatively smaller name label 264A at its default, i.e., relatively smaller, font size in Fig. 8, and the e-mail label 268A at its default, i.e., relatively smaller, font size in Fig. 7 was redrawn as the enlarged e-mail label 268<confidence value="5">B</confidence>
+ in Fig. 8. Such a shift in the input focus from the name field <part-num-ref name="name field">262</part-num-ref>
+ in Fig. 7 to the e-mail input field <part-num-ref name="e-mail input field">270</part-num-ref>
+ in Fig. 8 could have resulted from, for instance, a navigation input by the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction indicated at the numeral <part-num-ref name="numeral">28,</part-num-ref>
+ although other inputs could have been employed.    </p>
+    <p id="p-52" num="52">[0046]  Since the address book routine <part-num-ref name="address book routine">44</part-num-ref>
+ potentially can have a large number of input fields and, associated with each input field, a label, the ability to rapidly determine which input field is the subject of the input focus of the processor apparatus <part-num-ref name="processor apparatus">12</part-num-ref>
+ is highly advantageous. As can be understood from Figs. 7 and <part-num-ref name="and">8,</part-num-ref>
+ since a given input field and its label are associated with one another, whenever a given input field is the subject of the input focus, the associated label is made the subject of the visual focus and is displayed in an enlarged fashion at a font larger than the default font size.    </p>
+    <p id="p-53" num="53">[0047] Figs. 9-<confidence value="66">11</confidence>
+ depict additional outputs on the display <part-num-ref name="display">48,</part-num-ref>
+ such as might result from a web browser routine <part-num-ref name="web browser routine">44</part-num-ref>
+ or other routine <part-num-ref name="or other routine">44.</part-num-ref>
+ Specifically, Fig. 9 depicts on the display <part-num-ref name="display">48</part-num-ref>
+ a first output <part-num-ref name="first output">352</part-num-ref>
+ comprising a plurality of clickable buttons <part-num-ref name="plurality of clickable buttons">356.</part-num-ref>
+ Each such clickable button might be representative of a uniform resource locator (URL) on a network or might initiate the execution of another routine <part-num-ref name="execution of another routine">44,</part-num-ref>
+ etc. One of the clickable buttons <part-num-ref name="clickable buttons">356</part-num-ref>
+ is depicted as being an enlarged clickable button 356<confidence value="5">B</confidence>
+, i.e., the "GAMES" button. Fig. 9 indicates that a user has entered sufficient navigational inputs to cause the visual focus of the processor apparatus <part-num-ref name="processor apparatus">12</part-num-ref>
+ to be on the "GAMES" clickable button <part-num-ref name="&quot;GAMES&quot; clickable button">356,</part-num-ref>
+ thus resulting in such button being displayed as the enlarged clickable button 356<confidence value="5">B</confidence>
+ in an enlarged font compared with the font size of the other clickable buttons <part-num-ref name="other clickable buttons">356.</part-num-ref>
+ Since the visual focus is on the enlarged clickable button <part-num-ref name="enlarged clickable button">356,</part-num-ref>
+ a select or click input of the track wheel <part-num-ref name="track wheel">24,</part-num-ref>
+ such as by translating the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction indicated by the numeral <part-num-ref name="numeral">32,</part-num-ref>
+ will initiate the action represented by the clickable button 356B.    </p>
+    <boundary-data type="header">
+      <confidence value="8">9</confidence>
+    </boundary-data>
+    <p id="p-54" num="54">
+      <page-break num="10"/>
+[0048] A second output <part-num-ref name="second output">376</part-num-ref>
+ is depicted on the display <part-num-ref name="display">48</part-num-ref>
+ in Fig. 10. In Fig. 10, all of the clickable buttons <part-num-ref name="clickable buttons">356</part-num-ref>
+ are displayed in the same size font since the visual focus is not on any of the clickable buttons <part-num-ref name="clickable buttons">356.</part-num-ref>
+ Rather, an input focus is on a first selectable input field <part-num-ref name="first selectable input field">362,</part-num-ref>
+ and the visual focus is on the label 364B "THIS YEAR" which is depicted as being output in an enlarged font compared with its appearance as the label 364A "THIS YEAR" at the default, i.e., relatively smaller, font in Fig. 9. The first selectable input field <part-num-ref name="first selectable input field">362</part-num-ref>
+ is one of a plurality of alternately selectable input fields comprising, for example, the first selectable input field <part-num-ref name="first selectable input field">362,</part-num-ref>
+ a second selectable input field <part-num-ref name="second selectable input field">370,</part-num-ref>
+ and a third selectable input field <part-num-ref name="third selectable input field">388.</part-num-ref>
+ The first selectable input field <part-num-ref name="first selectable input field">362</part-num-ref>
+ and the label 364B "THIS YEAR" are associated with another, and the enlargement in Fig. 10 of the label 364B "THIS YEAR" compared with its appearance in Fig. 9 and compared the appearance of the other labels nearby in Fig. 10 indicates that the first selectable input field <part-num-ref name="first selectable input field">362</part-num-ref>
+ is the subject of the input focus of the processor apparatus <part-num-ref name="processor apparatus">12.</part-num-ref>
+    </p>
+    <p id="p-55" num="55">[0049]   The first, second, and third selectable input fields <part-num-ref name="first, second, and third selectable input fields">362,</part-num-ref>
+ <part-num-ref name="first, second, and third selectable input fields 362,">370,</part-num-ref>
+ and <part-num-ref name="first, second, and third selectable input fields 362, 370, and">388</part-num-ref>
+ are alternately selectable by the user. That is, as the input focus of the system shifts among the first, second, and third selectable input fields <part-num-ref name="first, second, and third selectable input fields">362,</part-num-ref>
+ <part-num-ref name="first, second, and third selectable input fields 362,">370,</part-num-ref>
+ and <part-num-ref name="first, second, and third selectable input fields 362, 370, and">388,</part-num-ref>
+ a selection input that occurs when the input focus is on a particular selectable input field will be considered to be a selection input with respect to the label associated with the particular selectable input field.    </p>
+    <p id="p-56" num="56">As the input focus shifts among the first, second, and third selectable input fields <part-num-ref name="first, second, and third selectable input fields">362,</part-num-ref>
+ <part-num-ref name="first, second, and third selectable input fields 362,">370,</part-num-ref>
+ and <part-num-ref name="first, second, and third selectable input fields 362, 370, and">388,</part-num-ref>
+ the visual focus correspondingly shifts among and enlarges the associated labels.    </p>
+    <p id="p-57" num="57">[0050]   For instance, and as is depicted generally in Fig. 11, the label 368B "<confidence value="5">I</confidence>
+N THE NEXT TEN YEARS" is depicted in a larger font size than in Fig. 10 and in larger font size than that of the other labels associated with the first and third selectable fields <part-num-ref name="first and third selectable fields">362</part-num-ref>
+ and <part-num-ref name="and">388.</part-num-ref>
+    </p>
+    <p id="p-58" num="58">Moreover, the second selectable field 370A in Fig. 11 is shown as being filled, i.e., as having had a selection input made in association therewith. Also, the label 364A "THIS YEAR" in Fig. 11 is redisplayed in at its default, i.e., relatively smaller, font size.</p>
+    <p id="p-59" num="59">[0051]  It thus can be seen that the input focus has shifted from the first selectable input field <part-num-ref name="first selectable input field">362</part-num-ref>
+ in Fig. 10 to the second selectable input field <part-num-ref name="second selectable input field">370</part-num-ref>
+ in Fig. 11, such as might result from a navigation input from the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction indicated by the numeral <part-num-ref name="numeral">28.</part-num-ref>
+ It can further be seen that the second selectable input field <part-num-ref name="second selectable input field">370</part-num-ref>
+ has been the subject of a selection input, such as might have resulted from a selection input or click input of the track wheel <part-num-ref name="track wheel">24</part-num-ref>
+ in the direction indicated at the numeral <part-num-ref name="numeral">32.</part-num-ref>
+ By enlarging the label associated with a selectable input field that is the subject of the input focus of the system enables the user to more readily determine which selectable input field is the subject of the <boundary-data type="header">
+        <confidence value="88">10</confidence>
+      </boundary-data>
+      <page-break num="11"/>
+input focus and thus can potentially be the subject of a selection input. This facilitates use of the handheld electronic device <part-num-ref name="handheld electronic device">4.</part-num-ref>
+    </p>
+    <p id="p-60" num="60">[0052]  It is noted that functions or routines 44 on the handheld electronic device <part-num-ref name="handheld electronic device">4</part-num-ref>
+ can be represented by an icon <part-num-ref name="icon">56,</part-num-ref>
+ a symbol, one or more characters, or any other graphic representation in any of a wide variety of forms. As such, the representation herein of icons <part-num-ref name="representation herein of icons">56,</part-num-ref>
+ clickable buttons <part-num-ref name="representation herein of icons 56, clickable buttons">356,</part-num-ref>
+ and the like is exemplary and is not intended to be limiting.    </p>
+    <p id="p-61" num="61">[0053]   While specific embodiments of the disclosed and claimed concept have been described in detail, it will be appreciated by those skilled in the art that various modifications and alternatives to those details could be developed in light of the overall teachings of the disclosure. Accordingly, the particular arrangements disclosed are meant to be illustrative only and not limiting as to the scope of the disclosed and claimed concept which is to be given the f<confidence value="8">u</confidence>
+ll breadth of the claims appended and any and all equivalents thereof.    </p>
+    <boundary-data type="header">
+      <confidence value="88">11</confidence>
+    </boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11560437.xml

@@ -0,0 +1,292 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11560437</doc-number>
+        <date>2006-11-16</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <boundary-data type="header">2006009819</boundary-data>
+    <heading id="h-1">PROCESS FOR ABUSE MITIGATION</heading>
+    <heading id="h-2">BACKGROUND OF THE INVENTION</heading>
+    <p id="p-1" num="1">1.    Field of the Invention The present invention relates to methods and systems associated with <boundary-data type="line-number">5    </boundary-data>
+reducing malicious communications over an Internet Protocol (IP) network, such as but not limited to reducing messaging associated with Spa<confidence value="5">m</confidence>
+ and Denial of Service (DoS) attacks.    </p>
+    <p id="p-2" num="2">2.    Background Art <boundary-data type="line-number">10                 </boundary-data>
+Spa<confidence value="5">m</confidence>
+, Denial of Service (Dos) attacks, and any number of other attacks may disrupt network based services. Spa<confidence value="8">m</confidence>
+ can be described as transmission of unsolicited email messages to a large number of users and devices on public or private data networks. Spa<confidence value="8">m</confidence>
+ constitutes up to 90% of email traffic on the Internet.    </p>
+    <p id="p-3" num="3">Spa<confidence value="8">m</confidence>
+ is a vehicle for phishing attacks on internet users and it is leading to distrust <boundary-data type="line-number">15    </boundary-data>
+of the Internet and reduced usage of some services as a result. Spa<confidence value="8">m</confidence>
+ can be sent knowingly by a user (Spammer) or unknowingly when the user's device is compromised with mal-ware (BOTS) that gives another user control of that user's device. Typically, the user is completely unaware that their device has been compromised. The purpose of BOTS is to compromise the user's privacy, financial <boundary-data type="line-number">20    </boundary-data>
+data (phishing) and to seek other vulnerable targets on data networks and infect them as well.    </p>
+    <p id="p-4" num="4">While one BOT would have minimal effect on the ISP's network, BOTS belonging to BOTnets can generate large amounts of traffic in the form of Spa<confidence value="8">m</confidence>
+ and DoS attacks. In the normal course of mal-ware operations command and <part-num-ref name="normal course of mal-ware operations command and">25</part-num-ref>
+    control centers provide instructions to BOTS. Typically assigned instructions <boundary-data type="header">-1-</boundary-data>
+      <page-break num="2"/>
+      <boundary-data type="header">2006009819</boundary-data>
+include a list of nodes or IP address which the BOT is to target with DNS queries, replication attempts and open mail servers. The BOT generates large numbers amounts of DNS queries to resolve domain names pre-fix such as Mail or SMTP to a valid IP address and vise a versa, for example the BOT will attempt to when <boundary-data type="line-number">5    </boundary-data>
+resolve "mail.comcast.net" to a valid IP address, i.e. 63.240.76.7210. Once the BOT finds an open Mail System, it will attempt send out either vast quantities of unsolicited mail containing advertisements and or phishing scams. BOTS are also self-contained, in that they have the ability to act as mail-relay agents if they can not find any one mail servers. The purpose of phishing is to obtain financial <boundary-data type="line-number">10    </boundary-data>
+information such as credit card numbers and account information from the mail's recipient. Typically by tricking the user to believe that the email is legitimate.    </p>
+    <p id="p-5" num="5">Another common problem includes ICMP "Ping" and Port scans of IP addresses in order to infect other devices on the Internet. These are devices are typically insecure computers with either outdated or no anti-viral software and or <boundary-data type="line-number">15    </boundary-data>
+lacking operating system security updates.    </p>
+    <p id="p-6" num="6">To counteract the effects of BOTS, Internet Service Providers (ISPs) have to increase spending on anti-abuse systems and provide tools for its subscriber base. The ISP absorbs this cost in most cases but not all users download the free software which keeps their computers vulnerable. The other risk that ISPs faces is <boundary-data type="line-number">20    </boundary-data>
+to increase spending on high-availability of its systems, especially mail and DNS systems. This is because email severs process millions of messages and has to determine the legitimacy of each email.    </p>
+    <p id="p-7" num="7">As stated previously 90% of messages are spa<confidence value="7">m</confidence>
+ so when the operator's mail system receives an outbound mail it would have to scan each <boundary-data type="line-number">25    </boundary-data>
+message to determine if it is Spa<confidence value="5">m</confidence>
+ or contains a virus or is a valid email.    </p>
+    <p id="p-8" num="8">Continuous transmission by thousands of BOTS and the sheer volume eventually results in a significant slow down of the system to a state which interferes with the normal email delivery of benevolent/worthy users or possibly a system crash. Email systems are not 100% accurate in identifying and filtering Spa<confidence value="5">m</confidence>
+ email such that <part-num-ref name="system crash. Email systems are not 100% accurate in identifying and filtering Spam email such that">30</part-num-ref>
+    Spa<confidence value="5">m</confidence>
+ email gets delivered to a vast array of users who in turn complain to their ISP.    </p>
+    <boundary-data type="header">-2-</boundary-data>
+    <boundary-data type="header">2006009819</boundary-data>
+    <p id="p-9" num="9">
+      <page-break num="3"/>
+This leads to another problem faced by the ISP in having mail and IP addresses from their domain name, i.e. "comcast.net," black-listed because users within that domain are identified as hosting BOT-nets. Unfortunately, because of BOTS, mail from creditable users is also blocked by the receiving ISP.    </p>
+    <p id="p-10" num="10">
+      <boundary-data type="line-number">5                 </boundary-data>
+Deep packet inspection (DPI) technology is accurate for identifying friend or foe SMTP traffic as it relies on heuristics and various rule sets to categorize SMTP traffic for legitimacy. Additionally, statistical analysis of DNS query pattern analysis can also be used to identify BOTS on the network. These systems and processes coupled with PacketCable Multimedia form an effective <boundary-data type="line-number">10    </boundary-data>
+detection and enforcement process to stop Spa<confidence value="5">m</confidence>
+ and other forms of malicious traffic.    </p>
+    <heading id="h-3">BRIEF DESCRIPTION OF THE DRAWINGS</heading>
+    <p id="p-11" num="11">The present invention is pointed out with particularity in the appended <boundary-data type="line-number">15    </boundary-data>
+claims. However, other features of the present invention will become more apparent and the present invention will be best understood by referring to the following detailed description in conjunction with the accompany drawings in which:    </p>
+    <p id="p-12" num="12">FIGURE 1 illustrates a system for providing media content in accordance with one non-limiting aspect of the present invention; and <boundary-data type="line-number">20                 </boundary-data>
+FIGURE 2 illustrates a flowchart of a method of mitigating malicious messages in accordance with one non-limiting aspect of the present invention.    </p>
+    <heading id="h-4">DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)</heading>
+    <p id="p-13" num="13">FIGURE 1 illustrates a system <part-num-ref name="system">10</part-num-ref>
+ for providing media content in <part-num-ref name="for providing media content in">25</part-num-ref>
+    accordance with one non-limiting aspect of the present invention. The system <part-num-ref name="system">10</part-num-ref>
+ <boundary-data type="header">-3-</boundary-data>
+      <page-break num="4"/>
+      <boundary-data type="header">2006009819</boundary-data>
+may include a media provider (not shown) for providing media services over an operator network <part-num-ref name="operator network">12</part-num-ref>
+ to subscribers at one or more subscriber locations <part-num-ref name="to subscribers at one or more subscriber locations">14.</part-num-ref>
+ The system <part-num-ref name="system">10</part-num-ref>
+ may <part-num-ref name="may">10</part-num-ref>
+ include elements suitable for the mitigation of malicious messages carried over the network <part-num-ref name="network">12,</part-num-ref>
+ such as but not limited to elements associated with <boundary-data type="line-number">5    </boundary-data>
+mitigating malicious messages use with Spa<confidence value="5">m</confidence>
+ and Denial of Service (DoS) attacks.    </p>
+    <p id="p-14" num="14">The media provider, for exemplary purpose, is most prominently described with respect to being a cable television service provider having capabilities for providing cable television, telecommunications, and high-speed data services to the subscriber locations, primarily through wired and/or wireless <boundary-data type="line-number">10    </boundary-data>
+communications. The present invention, however, is not so limited and fully contemplates the provider being associated with any type of service provider, including other television providers (IP, broadcast, satellite, etc.) and non-television providers, such as those associated with high-speed data, telecommunications, cellular communications, and the like.    </p>
+    <p id="p-15" num="15">
+      <boundary-data type="line-number">15                 </boundary-data>
+The media provider may be configured to support and/or facilitate the use of any number of television and non-television services and applications, such as, but not limited to email services, data transmission service, linear and non-linear television programming/signaling (cable, satellite, broadcast, etc.), Video on Demand (VOD), interactive television (iTV), interactive gaming, pay-per-view <boundary-data type="line-number">20    </boundary-data>
+(PPV), digital video recording (local and remote), and/or broadcasting of signals associated with supporting television programming, movies, audio, and other multimedia, as well as, downloading of clips or full-length versions of the same.    </p>
+    <p id="p-16" num="16">The messages associated with these and any number of other services may be limited in accordance with the present invention.</p>
+    <p id="p-17" num="17">
+      <boundary-data type="line-number">25                 </boundary-data>
+The network 12 may include any number of features and devices to facilitate signal transportation and other operations associated with interfacing the subscriber locations with each other and otherwise supporting communications associated with services of the media provider. The network <part-num-ref name="network">12</part-num-ref>
+ may include terrestrial and extraterrestrial components and infrastructures, including cable lines, <part-num-ref name="may include terrestrial and extraterrestrial components and infrastructures, including cable lines,">30</part-num-ref>
+    telephone lines, and/or satellite or other wireless architectures. The network <part-num-ref name="network">12</part-num-ref>
+ may <boundary-data type="header">-4-</boundary-data>
+      <page-break num="5"/>
+      <boundary-data type="header">2006009819</boundary-data>
+be associated with other private and/or public networks, such as the Internet and dedicated or virtual private networks.    </p>
+    <p id="p-18" num="18">Each subscriber location 14 may include one or more media devices, such as but not limited to a personal computer <part-num-ref name="personal computer">16,</part-num-ref>
+ to facilitate user interaction with <boundary-data type="line-number">5    </boundary-data>
+the media content/services. The scope of such interaction may be based on subscriptions and other parameters set by the media provider. The subscriptions may specify various classes of services and other parameters associated with usage rights and services available to the corresponding subscriber.    </p>
+    <p id="p-19" num="19">The media devices may relate to any number of devices suitable for <boundary-data type="line-number">10   </boundary-data>
+interfacing and/or facilitating interfacing the subscribers. For example, the media devices may be a settop box (STB), digital video recorder (DVR), personal computer (PC), television (which may include embedded user interface and processing capabilities), outlet digital adapter (ODA), media terminal adapter (MTA), cable modem (CM), personal digital assistant (PDA), computer, mobile <boundary-data type="line-number">15    </boundary-data>
+device (phone, computer, etc.), personal media device, and any other item having capabilities to supporting access to any number of the services. The messages associated with supporting or interacting with these and any number of other media devices may be limited in accordance with the present invention.    </p>
+    <p id="p-20" num="20">The media devices may be configured to descramble and to support <boundary-data type="line-number">20    </boundary-data>
+and/or facilitate the use of any number of television and non-television related signals, such as, but not limited to, Hyper Text Transfer Protocol (HTTP), Dynamic Host Configuration Protocol (DHCP), Syslog, Simple Network Management Protocol (SNMP), Trivial File Transfer Protocol (TFTP), Data Over Cable Service Interface Specification (DOCSIS), Domain Name System (DNS) applications, <boundary-data type="line-number">25    </boundary-data>
+DOCSIS Settop Gateway (DSG), out-of-band (<confidence value="55">OO</confidence>
+B) messaging, and others.    </p>
+    <p id="p-21" num="21">The content sources be associated with the media provider (which in turn may receive the content from other sources) and/or one or more of the subscriber devices or other non-subscriber devices connected to the network. For example, if the media provider is a television service provider, a portion of the <boundary-data type="header">-5-</boundary-data>
+      <page-break num="6"/>
+      <boundary-data type="header">2006009819</boundary-data>
+media content may relate to television programs, movies, and other multimedia packets. This content may be delivered from the media service provider to the subscribers through streaming, downloading, broadcast, peer-to-peer, and any number of other processes.    </p>
+    <p id="p-22" num="22">
+      <boundary-data type="line-number">5                </boundary-data>
+The media content may be delivered to the subscriber locations directly from the media service provider and/or from one or more of the other devices in communication therewith. In more detail, as is common with larger media content providers, multiple regional enterprises, such as headend units and the like, may be configured to provide regional programming to a number of <boundary-data type="line-number">10   </boundary-data>
+subscribers associated therewith. Each of the headends may store various types of media content for distribution to the subscribers it services. Optionally, the headends may be configured to support headend to headend communications such that non-direct subscribers, i.e., those supported by other headends, may similarly receive content from other headends.    </p>
+    <p id="p-23" num="23">
+      <boundary-data type="line-number">15               </boundary-data>
+In addition, some of the media content may be sourced from the subscribers themselves, such as by transporting content stored locally on the home networks of the subscribers to other locations within the same home network and/or to other locations beyond the home network that are in communication therewith by way of the network. The media provider may include features and capabilities to <boundary-data type="line-number">20   </boundary-data>
+facilitate such inter-subscriber communications.    </p>
+    <p id="p-24" num="24">The system 10 may include any number of elements associated with mitigating malicious messaging in accordance with the present invention. For exemplary purposes only, and without intending to limit the scope and contemplation of the present invention, the present invention is predominately <boundary-data type="line-number">25    </boundary-data>
+described with respect to limiting BOTS, Zombies, or other attackers from utilizing the subscribers PC <part-num-ref name="subscribers PC">16</part-num-ref>
+ to send Spa<confidence value="5">m</confidence>
+ and/or execute DoS attacks. The present invention, however, fully contemplates the mitigation of malicious messaging associated with and originating from any number of locations and element, both inside and outside of the system, and not just PCs associated with subscriber <part-num-ref name="system, and not just PCs associated with subscriber">30</part-num-ref>
+   locations.    </p>
+    <boundary-data type="header">-6-</boundary-data>
+    <boundary-data type="header">2006009819</boundary-data>
+    <p id="p-25" num="25">
+      <page-break num="7"/>
+The system 10 may include a cable modem (CM) <part-num-ref name="cable modem (CM)">22</part-num-ref>
+ or digital subscriber line (DSL) modem, a cable modem termination system (CMTS) <part-num-ref name="cable modem termination system (CMTS)">24</part-num-ref>
+ or digital subscriber line access multiplexer (DSLAM), a first router <part-num-ref name="first router">26,</part-num-ref>
+ a deep packet inspector <part-num-ref name="deep packet inspector">28,</part-num-ref>
+ a second router <part-num-ref name="second router">32,</part-num-ref>
+ a policy server <part-num-ref name="policy server">34,</part-num-ref>
+ an application manager <part-num-ref name="application manager">36,</part-num-ref>
+ a <boundary-data type="line-number">5    </boundary-data>
+domain name system (DNS) <part-num-ref name="domain name system (DNS)">38,</part-num-ref>
+ a voicemail/email system <part-num-ref name="voicemail/email system">40,</part-num-ref>
+ a statistical analysis server <part-num-ref name="statistical analysis server">42,</part-num-ref>
+ a DNS/email sink-hole <part-num-ref name="DNS/email sink-hole">44,</part-num-ref>
+ a walled garden <part-num-ref name="walled garden">46,</part-num-ref>
+ and an open network (not controlled by media provider) <part-num-ref name="open network (not controlled by media provider)">48.</part-num-ref>
+ These elements may operate in conjunction with each other and other elements to facilitate limiting messaging associated with the same or other elements.    </p>
+    <p id="p-26" num="26">
+      <boundary-data type="line-number">10                </boundary-data>
+The Deep Packet Inspection system 28 may be responsible for identifying malicious traffic originating from the subscriber device <part-num-ref name="subscriber device">16.</part-num-ref>
+ The Packet Inspection system <part-num-ref name="Packet Inspection system">28</part-num-ref>
+ may also be responsible for signaling to the Application Manager (AM) <part-num-ref name="Application Manager (AM)">36</part-num-ref>
+ to mitigate the abuse. The AM <part-num-ref name="AM">36</part-num-ref>
+ may receive a request for a Quality of Service policy to be enforced for an IP address on the ISP's network <boundary-data type="line-number">15    </boundary-data>
+which has been identified as generating malicious messaging. The AM <part-num-ref name="AM">36</part-num-ref>
+ serves as a Policy Decision Point (PDP) to determine if the intended action is authorized for the particular user.    </p>
+    <p id="p-27" num="27">The Policy Server (PS) 34 may be a component which acts as a policy decision point for the CMTS <part-num-ref name="CMTS">24</part-num-ref>
+ and a policy enforcement point to the AM <part-num-ref name="AM">36.</part-num-ref>
+ The <boundary-data type="line-number">20    </boundary-data>
+PS <part-num-ref name="PS">34</part-num-ref>
+ may be responsible for managing CMTS resources and establishing the service flow on the CMTS <part-num-ref name="CMTS">24</part-num-ref>
+ when requested by the AM <part-num-ref name="AM">36.</part-num-ref>
+ The CMTS <part-num-ref name="CMTS">24</part-num-ref>
+ may maintain a state for each CM <part-num-ref name="state for each CM">22</part-num-ref>
+ in the form of provisioning and admission control.    </p>
+    <p id="p-28" num="28">It may also act as a routing device which converts Radio Frequency (RF) signals from the CM <part-num-ref name="CM">22</part-num-ref>
+ into binary (packetized) format for transport on the network.    </p>
+    <p id="p-29" num="29">
+      <boundary-data type="line-number">25                </boundary-data>
+The routers 26, 32 may then be used to further interface signal between the CMTS <part-num-ref name="CMTS">24</part-num-ref>
+ and other elements in the system <part-num-ref name="system">10</part-num-ref>
+ for further transport over the network <part-num-ref name="network">12.</part-num-ref>
+ The packet inspector <part-num-ref name="packet inspector">28</part-num-ref>
+ may utilize a set of heuristics for identifying application level attacks based on the contents of the packet. The DNS and email sink-hole <part-num-ref name="DNS and email sink-hole">44</part-num-ref>
+ may be a spoofed DNS or email server that responds with <part-num-ref name="spoofed DNS or email server that responds with">30</part-num-ref>
+    a non-valid IP address when queried with a type A DNS query request or a SMTP <boundary-data type="header">-7-</boundary-data>
+      <page-break num="8"/>
+      <boundary-data type="header">2006009819</boundary-data>
+mail-server which responds with successful acknowledgements to outbound emails such that it may be used to keep Spa<confidence value="5">m</confidence>
+ email and DNS query messages from leaving the operator's network.  The walled garden <part-num-ref name="walled garden">46</part-num-ref>
+ may be a captive web-portal, typically on the operator's network, where all HTTP queries are redirected to for <boundary-data type="line-number">5    </boundary-data>
+purposes of self-care, self-registration and notifications.    </p>
+    <p id="p-30" num="30">For example, if the PC <part-num-ref name="PC">16</part-num-ref>
+ initiates the transmission of vast quantities of mail messages via the SMTP protocol on port <part-num-ref name="SMTP protocol on port">25</part-num-ref>
+ or a DNS DoS attack on port <part-num-ref name="DNS DoS attack on port">53,</part-num-ref>
+ the DPI <part-num-ref name="DPI">28</part-num-ref>
+ may analyze the frequency, count, or other indicator of traffic against a desired traffic threshold and provide an indication of the same to the AM <boundary-data type="line-number">10    </boundary-data>
+      <part-num-ref name="AM">36.</part-num-ref>
+ For example, if the message type (email (port 25), DNS query (port 53), etc.) from the same user/device (IP address or host-name) exceeds a pre-set threshold <part-num-ref name="pre-set threshold">(500</part-num-ref>
+ message per minute), a signal may be sent to the AM <part-num-ref name="AM">36</part-num-ref>
+ regarding the triggering event. The contents of the signal may include the IP address, source port and destination port of the originating device, i.e., the spammer.    </p>
+    <p id="p-31" num="31">
+      <boundary-data type="line-number">15                </boundary-data>
+The AM 36 may then parse the message, veri<confidence value="8">f</confidence>
+y that the IP address of the source falls within its managed domain, and trigger an action against the user based on a policy defined by the media provider or other operator associated with the system. For example, the AM <part-num-ref name="AM">36</part-num-ref>
+ may trigger the policy server <part-num-ref name="policy server">34</part-num-ref>
+ to set a bandwidth restriction policy on the subscriber's bridging device, such as the CM <part-num-ref name="CM">22.</part-num-ref>
+    </p>
+    <p id="p-32" num="32">
+      <boundary-data type="line-number">20    </boundary-data>
+The policy restriction may be limited to the port or other interface associated with the message. This allows the subscriber to execute normal operations of the other ports, such as allowing an unsuspecting subscriber to maintain at least PC functionality. The policy may include throttling the bandwidth of the port, for example to <part-num-ref name="port, for example to">500</part-num-ref>
+ bits per second, on any traffic associated with the port, i.e., port <part-num-ref name="port">25</part-num-ref>
+ <boundary-data type="line-number">25    </boundary-data>
+for email, port <part-num-ref name="for email, port">53</part-num-ref>
+ for DNS queries, and port <part-num-ref name="for DNS queries, and port">80</part-num-ref>
+ for web activities.    </p>
+    <p id="p-33" num="33">The SMTP packets or other packets associated with email, for example, may be tagged with a Type of Service marking so that any packet from the PC <part-num-ref name="PC">16</part-num-ref>
+ bound on port <part-num-ref name="bound on port">25</part-num-ref>
+ may be diverted to the sink-hole email system <part-num-ref name="sink-hole email system">44</part-num-ref>
+ by the router <part-num-ref name="router">26</part-num-ref>
+ residing on the operator's domain. This allows the sink-hole email system <part-num-ref name="sink-hole email system">30</part-num-ref>
+    <part-num-ref name="">44</part-num-ref>
+ to respond with a successful acknowledgment message to purposely mislead the <boundary-data type="header">-8-</boundary-data>
+      <page-break num="9"/>
+      <boundary-data type="header">2006009819</boundary-data>
+Spammer/BOT, which can be helpful in making certain that the Spammer/BOT does not switch ports and re-initiate its efforts. The packets or other information associated with DNS queries may be similarly diverted to the DNS sink-hole <part-num-ref name="DNS sink-hole">44</part-num-ref>
+ for the same purposes. The DNS sink-hole <part-num-ref name="DNS sink-hole">44</part-num-ref>
+ may respond with a invalid IP for any <boundary-data type="line-number">5    </boundary-data>
+type A DNS query such that DoS or ICMP packets attached to valid websites are prevented from exiting the PC.    </p>
+    <p id="p-34" num="34">Other traffic, i.e. that are not particularly associated with the attached ports (HTTP/HTTPS), may be associated may be diverted to a sink-hole garden <part-num-ref name="sink-hole garden">44</part-num-ref>
+ in order to prevent the further spread of the virus to other elements in contact with <boundary-data type="line-number">10   </boundary-data>
+the network. Any HTTP/HTTPS traffic is redirected to the walled-garden <part-num-ref name="walled-garden">46</part-num-ref>
+ where users may be notified about the specifics of the abuse and be provided with anti-virus / anti-malware tools to clean their PC. Optionally, the operator may also set up a rule to drop all packets from that modem <part-num-ref name="rule to drop all packets from that modem">22</part-num-ref>
+ outside the routing domain of the operator. Such a policy would force the subscriber to either clean their devices <boundary-data type="line-number">15    </boundary-data>
+manually or stop the abuse of the network.    </p>
+    <p id="p-35" num="35">BOTS and Spammers could potentially adapt overtime to undermine the use of Deep Packet Inspection systems the chances are that small percent of Spa<confidence value="8">m</confidence>
+ and DoS packets will go undetected by the DPI technology.  As such, application usage via statistical analysis such as DNS query pattern analysis becomes <boundary-data type="line-number">20   </boundary-data>
+important. In addition to or in place of the packet inspector, the statistical analysis <part-num-ref name="statistical analysis">42</part-num-ref>
+ system may be used to identify BOTS on the network. The statistical analysis system <part-num-ref name="statistical analysis system">42</part-num-ref>
+ may continuously monitor application server usage such as that of DNS, Email or Voice Mail Systems. It may perform a query, for example, of the top <part-num-ref name="top">20</part-num-ref>
+ clients queering the DNS servers or voice-mail system on a random interval. The <boundary-data type="line-number">25    </boundary-data>
+AM <part-num-ref name="AM">36,</part-num-ref>
+ such as the DNS server <part-num-ref name="DNS server">38,</part-num-ref>
+ may provide the IP address and query rate of users. Similar to the packet inspector heuristics, the statistical analysis system <part-num-ref name="statistical analysis system">42</part-num-ref>
+ may determine if the query rate, type and statistics, warrants a notification via a mediation layer to both the AM <part-num-ref name="AM">36</part-num-ref>
+ and the packet inspector <part-num-ref name="packet inspector">28</part-num-ref>
+ to implement the protection procedures described above. The message may contain a unique event-id, <boundary-data type="line-number">30   </boundary-data>
+IP address of the suspected abuser, abuse type, in this example DNS, and the port number for DNS, (TCP 53).    </p>
+    <boundary-data type="header">-9-</boundary-data>
+    <boundary-data type="header">2006009819</boundary-data>
+    <p id="p-36" num="36">
+      <page-break num="10"/>
+As described above, various elements in the system may collaborate to mitigate malicious message attacks. The various elements are shown to be separate features within the system, however, the present invention is not intended to be so limited. The present invention fully contemplates any one or more of the <boundary-data type="line-number">5    </boundary-data>
+operations described above with respect to the separate elements to be combined or otherwise executed by a common or standalone entity, such as for example with a traffic agent having capabilities to execute any number of the operations described above.    </p>
+    <p id="p-37" num="37">FIGURE 2 illustrates a flowchart <part-num-ref name="flowchart">60</part-num-ref>
+ of a method of mitigating <boundary-data type="line-number">10    </boundary-data>
+malicious messages communicated over a network from a computer to one or more remotely located network elements associated with a network in accordance with one non-limiting aspect of the present invention. The method may be implemented with one or more of the elements associated with the system and/or through some other entity or element having capabilities sufficient to support the operations described <boundary-data type="line-number">15    </boundary-data>
+herein.    </p>
+    <p id="p-38" num="38">Block 62 relates to monitoring malicious messaging traffic levels for one or more elements associated with a network, such as but not limited to a PC of a subscriber associated with a provider of the network. The monitoring may include inspecting traffic, bandwidth consumption, and/or any number of operations <boundary-data type="line-number">20    </boundary-data>
+associated with transmitting messages over the network. The monitored messages may be associated with any type of network element and traffic associated therewith.    </p>
+    <p id="p-39" num="39">The message may comprise a complete set of data and/or individual bits, bytes, or packets of data.</p>
+    <p id="p-40" num="40">Block 64 relates to determining whether the messaging traffic is <boundary-data type="line-number">25    </boundary-data>
+above a threshold associated with normal messaging activities, i.e., determining whether the traffic is indicative of malicious messaging. The threshold may be set according to any number of operating parameters and requirements of the service provider and/or subscriber. Optionally, different thresholds may be established for different messaging types, i.e. email, DNS, web, etc., such the present invention <part-num-ref name="present invention">30</part-num-ref>
+    may be able to monitor one or more types of messaging associate with the PC.    </p>
+    <boundary-data type="header">-10-</boundary-data>
+    <boundary-data type="header">2006009819</boundary-data>
+    <p id="p-41" num="41">
+      <page-break num="11"/>
+Block 62 is returned to if the messaging traffic is commiserating with normal messaging activities, i.e., no corrective action is deemed necessary. Block <part-num-ref name="no corrective action is deemed necessary. Block">66,</part-num-ref>
+ however, is reached if the messaging traffic indicates an attack or other abnormal activity that may be associated with malicious conduct by a PC and/or the <boundary-data type="line-number">5    </boundary-data>
+like. Block <part-num-ref name="like. Block">66</part-num-ref>
+ generally relates to limiting the communication capabilities of the offending entity so as to limit the proliferation of the malicious messages. This may include mitigating the malicious traffic to levels below the normal threshold, which may be referred to as a restricted threshold.    </p>
+    <p id="p-42" num="42">The communication capabilities may be limited according to any <boundary-data type="line-number">10    </boundary-data>
+number of parameters associated with the offending messages. For example, bandwidth allocated to a port associated with the offending message type may be throttled or otherwise limited. The bandwidth may be restricted so as to permit some of the offending messages to be transmitted from the computer without alerting the BOT or zombie of the restriction. This may include limiting bandwidth allocated <boundary-data type="line-number">15   </boundary-data>
+to particular ports as a function of the message type, such as but not limited to throttling port <part-num-ref name="message type, such as but not limited to throttling port">25</part-num-ref>
+ for offending email message, port <part-num-ref name="for offending email message, port">53</part-num-ref>
+ for offending DNS queries, and port <part-num-ref name="for offending DNS queries, and port">80</part-num-ref>
+ for offending web queries.    </p>
+    <p id="p-43" num="43">Block 68 relates to diverting the offending messages that are permitted to be transported over the throttled bandwidth. These messages may be <boundary-data type="line-number">20    </boundary-data>
+diverted to a sink-hole or other entity suitable for preventing the messages from reaching locations beyond the provider network. The entity may also include capabilities to acknowledge delivery of the offending messages such that the BOT/Spammers is mislead into believing the message reached the intended recipient. Optionally, non-offending messages may be similarly diverted and/or <boundary-data type="line-number">25    </boundary-data>
+held until the BOT/virus is cleaned from the PC or others removed so as to prevent the spread of the BOT/virus from the offending PC.    </p>
+    <p id="p-44" num="44">Block 70 relates to diverting HTTP queries or other traffic of the offending PC to a walled garden or other entity in the control or directed by media provider. The entity may be a webpage or other portal having capabilities for <part-num-ref name="webpage or other portal having capabilities for">30</part-num-ref>
+    notifying the subscriber of the communication restrictions. The entity may further <boundary-data type="header">-11-</boundary-data>
+      <page-break num="12"/>
+      <boundary-data type="header">2006009819</boundary-data>
+include utilities or other tools for download that may be used by the subscriber to eliminate the BOT/virus from their computer.    </p>
+    <p id="p-45" num="45">Block 72 relates to restoring the restricted communication capabilities after removal or cleansing of the BOT(s) associated with implementing the same.</p>
+    <p id="p-46" num="46">
+      <boundary-data type="line-number">5    </boundary-data>
+This may include increasing the bandwidth allocated to the offending messaging type from the restricted threshold to the normal threshold or non-restricted threshold such that the associated port may be free to communicate at any level. Block may be returned to monitor future messaging of the PC.    </p>
+    <p id="p-47" num="47">As demonstrated above, one non-limiting aspect of the present <boundary-data type="line-number">10   </boundary-data>
+invention relates to significantly reducing Spa<confidence value="5">m</confidence>
+ and Denial of Service attacks generated by a customer on an ISP 's network. The invention may include a process to utilize packet inspection technology along with various network services, such as DNS, coupled with PCMM Application Manager and Policy Servers to dynamically identify, signal, throttle, and notify abusive subscribers. The process may include <boundary-data type="line-number">15    </boundary-data>
+a solution to re-direct or otherwise divert malicious traffic to a "sink-hole" system and re-direct HTTP queries to a walled-garden where the Spammers can be notified of their actions and provided tools for self-care if the user is unaware of their computer being infected.    </p>
+    <p id="p-48" num="48">Optionally, the present invention provides an end-to-end solution for <boundary-data type="line-number">20    </boundary-data>
+detecting and mitigating various types of abuse scenarios. Additionally, the process introduces other concepts such as defining the use of Type of Service (ToS) an DiffServ Code Point (DSCP) marking of malicious IP packets so they may be redirected to a walled-garden or sink-hole systems. The proposal also defines the option where the Operator's DNS, E-Mail or Voice Mail system can detect and <boundary-data type="line-number">25    </boundary-data>
+signal the PCMM Application Manager if the packet inspection technology fails to identify abuse. The process also includes an Email and DNS sink-hole to generate false notification to Spammer to keep them from going dormant or utilizing alternate ports.    </p>
+    <boundary-data type="header">-12-</boundary-data>
+    <boundary-data type="header">2006009819</boundary-data>
+    <p id="p-49" num="49">
+      <page-break num="13"/>
+As required, detailed embodiments of the present invention are disclosed herein; however, it is to be understood that the disclosed embodiments are merely exemplary of the invention that may be embodied in various and alternative forms. The figures are not necessarily to scale, some features may be exaggerated <boundary-data type="line-number">5    </boundary-data>
+or minimized to show details of particular components. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a representative basis for the claims and/or as a representative basis for teaching one skilled in the art to variously employ the present invention.    </p>
+    <p id="p-50" num="50">While embodiments of the invention have been illustrated and <boundary-data type="line-number">10    </boundary-data>
+described, it is not intended that these embodiments illustrate and describe all possible forms of the invention. Rather, the words used in the specification are words of description rather than limitation, and it is understood that various changes may be made without departing from the spirit and scope of the invention.    </p>
+    <boundary-data type="header">-13-</boundary-data>
+  </description>
+</us-patent-application>
+

applicant/11592365.xml

@@ -0,0 +1,29 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE us-patent-application SYSTEM "PATI-v1.0.3-2011-06-23.dtd">
+<us-patent-application lang="EN" dtd-version="v1.0.3 2011-06-23" id="us-patent-application" country="US">
+  <us-bibliographic-data-application lang="EN" country="US">
+    <application-reference appl-type="utility">
+      <document-id>
+        <doc-number>11592365</doc-number>
+        <date>2010-01-25</date>
+      </document-id>
+    </application-reference>
+  </us-bibliographic-data-application>
+  <description id="description">
+    <p id="p-1" num="1">Application No. 11<confidence value="5">/</confidence>
+592365                                                  Amendment Page 2                                          Attorney Docket No. S63.2B-1318<confidence value="888855">7-US01</confidence>
+ Amendments To The Specification:    </p>
+    <p id="p-2" num="2">Please amend paragraph [0031 of the published application as follows:</p>
+    <p id="p-3" num="3">[0031]Catheter 30 has an inner shaf<confidence value="8">t</confidence>
+ <part-num-ref name="inner shaft">44</part-num-ref>
+ that extends through both balloon portions to provide a guide wire lumen. Radiopaque markers <part-num-ref name="guide wire lumen. Radiopaque markers">4<confidence value="5">6</confidence>
+      </part-num-ref>
+ <part-num-ref name="">50</part-num-ref>
+ may be provided to facilitate fluoroscopic location of the catheter in processing. In some embodiments such markers may be provided along the inner shaf<confidence value="8">t</confidence>
+ within the globular portion <part-num-ref name="globular portion">34</part-num-ref>
+ of the balloon <part-num-ref name="balloon">36,</part-num-ref>
+ for instance near the longitudinal center thereof, and within the cylindrical portion, for instance near the ends of the cylindrical portion.    </p>
+    <p id="p-4" num="4">Other locations may be marked in addition or in alternative to these locations.</p>
+  </description>
+</us-patent-application>
+