Abstract:
A personalized content recommendation system includes a client interface device configured to monitor a user&#39;s information data stream. A collaborative filter remote from the client interface device generates automated predictions about the interests of the user. A database server stores personal behavioral profiles and user&#39;s preferences based on a plurality of monitored past behaviors and an output of the collaborative user personal interest inference engine. A programmed personal content recommendation server filters items in an incoming information stream with the personal behavioral profile and identifies only those items of the incoming information stream that substantially matches the personal behavioral profile. The identified personally relevant content is then recommended to the user following some priority that may consider the similarity between the personal interest matches, the context of the user information consumption behaviors that may be shown by the user&#39;s content consumption mode.

Description:
RELATED APPLICATION 
       [0001]    This application claims the benefit of priority of U.S. Provisional Pat. App. No. 61/607,800 filed Mar. 7, 2012 and titled “Recommending Personally Interested Contents by Text Mining, Filtering, and Interfaces,” which is incorporated by reference. 
     
    
     STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH AND DEVELOPMENT 
       [0002]    This application was made with United States government support under Contract No. DE-AC05-00OR22725 awarded by the United States Department of Energy. The United States government has certain rights in these inventions. 
     
    
     BACKGROUND 
       [0003]    1. Technical Field 
         [0004]    This disclosure relates to text mining and content recommendations through automated analysis of user activities or events that may include on-line reading, writing, browsing, and/or navigation, for example. 
         [0005]    2. Related Art 
         [0006]    Search engine rankings may provide information about selected topics or answer specific questions. Unfortunately some search engines cannot return the latest information about a topic or question when that information has not had sufficient time to establish its cyber reputation. Additionally, many Web search services require user to compose their own Web queries. To receive sought after information, the search engines require the users to ask the right questions and convey those questions through a required language expression following a specific query structure. Besides its counter-intuitive nature, such queries directed to sought-after information may not exist. 
         [0007]    Unfortunately, most of the search engines do not offer an integrated experience of one stop information shop for any user. Unlike known technology, the technology disclosed in the Detailed Description that follows, un-intrusively observes the user&#39;s own information consumption behaviors in time, automatically infers that user&#39;s information interests, and proactively recommends personally high-value content for the user under a given context of a certain information consumption mode of the user (such as 9 am Monday morning, later Sunday afternoon, or during Christmas holidays). Some of the systems described in the Detailed Description do not require a more tactic query formulation or manual information searching and end-user filtering. The new technology discloses recommendation techniques and focuses on proactively delivering relevant content to an end user in a personalized way. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0008]      FIG. 1  is a block diagram of an exemplary architecture. 
           [0009]      FIG. 2  is a functional diagram of an exemplary process. 
           [0010]      FIG. 3  is an alternative functional diagram of an exemplary process. 
       
    
    
       [0011]    Appendices 1-6 describe a personalized re-ranking algorithm. 
       DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0012]    The disclosed customized system  100  shown in  FIG. 1  includes front end client interfaces (or client interface device)  102  that may run on an array of remote clients through a background processing. Some front end client interfaces  102  are embedded in hardware allowing the system  100  to directly connect to other front end system buses. Alternative front end client interfaces  102  comprise software, applications, or plug-ins that are integrated into larger software applications such as a Web browser  104  that resides on a client device in a client/server architecture. The client interfaces  102  may be retained in a non-transient media and may be executed on one or multiple stationary or mobile computing devices  106  or platforms that may execute Windows OS, Apple/Macintosh OS, Linux OS, iPad OS, iPhone OS, Android OS, and other operating systems (OSs). The front end client interfaces  102  may render the same look and feel and possess functionality that captures user operations and activities (e.g., user events) when a user is accessing and/or consuming content from remote content providers. Exemplary user events  202  (shown in  FIG. 2 ) may occur during online reading, browsing, writing, and/or navigation. The front end client interface  102  records a time stamped user behavior record in the user device&#39;s local cache. A user event may also occur when a user opens, closes, scrolls within, and/or zooms in/out of a particular part of content in a computer rendered document, object, or file that may be displayed on a visual output device. In other words, a user event may be an action or occurrence generated by a user, to which a program might respond, for example, key presses, button clicks, a gesture on a touch sensitive display or mouse movements. The document or file affected by the user event may comply with an electronic document specification such as the TXT, PDF, DOC, PPT, or HTML file format. 
         [0013]    Some front end client interfaces  102  may capture other time stamped user events too such as executing a file saving routine, a forwarding routine, a bookmarking routine, a printing routine, switching between active and inactive windows in one or multiple window-based programs, typing, physical or manual gestures, hand strokes, and/or other user actions performed on the computing device. Through a multi-task process, the client interface  102  may extract a portion of the consumed content that is currently under view by the user and the address of the consumed content (e.g., Uniform Resource Locator or URL). The consumed content may comprise a parsed Hypertext Markup Language (HTML) file or a PDF or Word or TXT file that may be substantially free of content relevant to the user&#39;s personal information interests such as ads, navigation bars, tags, redirection links, navigation links, etc., that are detected and removed through one or more front end client filters on the client device that are file format dependent (e.g., advertisement content filters for HTML files). The content filters may run on the client device and/or on backend servers. 
         [0014]    Through a parallel processing with the consumed content extraction, the front end client interface  102  may request or extract a content signature (through a process executed on a cloud based computing platform  118  although it can also be executed on other platforms in alternative systems) for the parsed text currently under view or edited by the user. Such a content signature may include multiple semantically salient content elements embodied in the text, the address of the content, and respective densities of semantic topics embodied in the text, whose detection methods are executed by the system and methods described in the Appendices or in U.S. Provisional Pat. App. No. 61/607,800, which is incorporated by reference. A cloud or cloud based computing platform  118  may refer to a scalable platform that provides a combination of services including computing, durable storage of both structured and unstructured data, network connectivity and other services. Metered services provided by a cloud or cloud based computing platform  118  may be interacted with (provisioned, de-provisioned, or otherwise controlled) via one or more front end client interfaces  102 . 
         [0015]    Consumed content at the screen snapshot level may be identified through a comparison of time stamps of adjacent snapshots. If a time difference between two user events lies within an interval the system  100  may infer a user&#39;s content consumption. The duration needs to be within a certain reasonable range to establish a user&#39;s interaction with a piece of content. For example, the duration may have a lower limit or low threshold that establishes that a user is viewing content (e.g., rather than just passing through it) and an upper limit or high threshold that may establish that a user is not ignoring the content. In these systems the limits that define the durations may be tunable or adaptable (e.g., programmable) to a user&#39;s information browsing or consuming behavior and in some instances, may also reflect if the content is focused. In other words, if received content is fully or partially occluded (e.g., defocused), such as when a portion of the rendered content is entirely or partially blocked by an active window in a windows-based environment, the content may be designated not consumed by appending or corresponding an inactive status identifier to its immediately previous time stamp. When the received content regains focus, in other words it is re-displayed in an active window the content may be designated active at that instance by appending or corresponding an active status identifier to its immediately preceding time stamp in another snapshot. 
         [0016]    As a content signature is generated, it is appended to the corresponding time stamped user behavior record and to the parsed file (e.g., a parsed HTML file) to render a snapshot. The snapshots, also known as contextual user information consumption behavior data, short for contextual user behavior data, may be encrypted with an encryption validation code at the client and periodically transmitted to a perimeter network that may include a Web server or cluster  110  linked to the front end client interfaces  102  through a publicly accessible distributed network  108 . A server may refer to one or more computers and/or programs stored on a non-transient media that respond to commands received from the client devices or applications. In some systems and processes it is a machine&#39;s or software application&#39;s role that establishes it as a server. 
         [0017]    In some systems, transmissions occur according to an incremental schedule. Initially, snapshots may be transmitted in real time. A real time process may match a human&#39;s perception of time or a virtual process that is processed at the same rate (or perceived to be at the same rate) as a physical or an external process. This may occur as behavioral profiles are first created or the snapshots demonstrate a strong shift in the user&#39;s interest. As personal behavioral profiles  206  (stored in a memory or the database server  116 ) are established and are substantially unchanging (e.g., within three standard deviations of an existing profile, for example), transmissions from the front-end client interface  102  may decline and may occur according to a batch schedule. When network connections are lost, snapshots are buffered on the client device until the network connection is restored that may occur through a callback. A callback may comprise a scheme where a connection or a recommending session is broken and a subsequent connection or recommending session is automatically or manually re-established to facilitate additional data interchanges between the front end client interfaces  102  and the Web server or cluster  110 . 
         [0018]    Upon verification of the encryption validation code, the perimeter network and Web server  110  will direct the front end client interfaces  102  or the Web browser  104  it may plug into to clear the client side cache by transmitting a command, an acknowledgement through the publicly accessible distributed network  108 , or through cache control directives. An off-line server  112  isolated from the front end client interfaces  102  may automatically query the Web server  110  asynchronously or on a periodic schedule through an intervening firewall and private network like a Local Area Network (LAN)  114 . Upon initiation of the query, a connection channel may be established with the perimeter network and Web server  110  to receive snapshots, which may then be removed from or made inaccessible to the Web server  110  so that only the off-line server  112  and a database server  116  store the snapshots and any associated files in a record pool. The off-line server  112  controls the timing and activation of the transfer of the snapshots to the database server  116  via the private LAN  114  to minimize the risk and exposure to untrusted networks and compromised systems. The private network is configured to support high volume traffic with the perimeter network and the back end systems  122 . 
         [0019]    To better deliver relevant content to the user without having the user manually express the user&#39;s interests through search queries, the contextual user behavior data are parsed to generate the personal behavioral profile  206 . A recommendation engine  204  resident to the off-line server  112  detects topic phrases that comprise one or more words, their frequencies and durations within a snapshot. If a user consumes content through multiple devices, using multiple browsers and front end client interfaces  102 , operating on similar or disparate operating systems, the snapshots are linked together according to the timestamps, integrated into a single user record pool and processed individually. In one implementation each topic phrase is associated with a salience score that indicates the user&#39;s interest in a particular phrase under a certain context of the user&#39;s information consumption mode, such as holiday mode, Monday morning office mode, or vacation mode. 
         [0020]    The recommendation engine&#39;s  204  conversions from the phrase level to an object (e.g., an entity exchanged), page, or document level may consider multiple aspects including those system and methods described in U.S. Provisional Pat. App. No. 61/607,800, in which concept words in the Provisional patent application (and Appendices 1-6) refer to the term “topic phrases” as used in this disclosure. In addition to those systems and methods, alternative aspect may be the frequency of an individual phrase of interest that may have a relatively high salience score. A document containing two interest points may be given more weight than a document having one interest point provided that the semantic relations between the interest points are distinguishable and represent discriminate concepts. Phrase inhibitors (e.g., avoided topic phrases) and saturation topic phrases (e.g., occurrences in an object that are beyond a user&#39;s point of interest) are given weight in some processes, just as the source of the content (e.g., originating from a government source such as the USPTO patent site; a corporate source, etc.); the user&#39;s preferred sources (e.g., prefers US news to British BBC news), the timing of a user&#39;s request (e.g., morning, afternoon, evening, day of the week, etc.); a user&#39;s location (e.g., via a Global Positioning Service (GPS) the system may identify whether the user is at home or on vacation), the user&#39;s consumption mode, and/or etc. may also contribute to a document&#39;s utility score or a priority score that establishes the ranking, or relevance of the document to the user&#39;s information needs at a particular moment. Higher utility scores or priority scores for objects and/or documents (when compared to each other) may reflect that some objects and/or documents include content that is designated well-matched with the personal interest of a user. A user&#39;s consumption mode in some systems  100  may comprise a user&#39;s designation that occurs at the front end client interfaces  102  that tags requests or queries to a classification, such as school classification, social classification, work classification (e.g., a working mode may include: job1, job2, etc.), religious classification, or other classification. 
         [0021]    An exemplary document or object (referred to as document) scoring process may establish C as the corpus for a set of all documents, a as the author for whom to score the document, and C a,i  as the set of all documents have a coauthor distance i from a. So then C a,0  is the set of documents written by author a. Also, let C a,i   (s)  be the set of documents that are a distance i to author a that contain the itemset s. Finally, let D be the document, page, or object (referred to as the document) to be scored, where a document is characterized as the set of all its frequent item sets, so that {s|sεD} is the set of all frequent itemsets in document D. 
         [0022]    The weighted distance of a document D to the author a is given by 
         [0000]    
       
         
           
             
               θ 
                
               
                 ( 
                 
                   a 
                   , 
                   D 
                 
                 ) 
               
             
              
             
               = 
               Δ 
             
              
             
               2 
                
               
                 ( 
                 
                   
                     1 
                     
                       1 
                       + 
                       
                          
                         
                           
                             - 
                             β 
                           
                            
                           
                               
                           
                            
                           
                             dis 
                              
                             
                               ( 
                               
                                 a 
                                 , 
                                 D 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   - 
                   
                     1 
                     2 
                   
                 
                 ) 
               
             
           
         
       
     
         [0000]    where dis(a, D) is the absolute coauthor distance from a to any author of document D, and β is a free parameter. 
         [0023]    The normalization factor for a frequent itemset s in a given document D is 
         [0000]    
       
         
           
             
               Nf 
                
               
                 ( 
                 
                   s 
                   , 
                   D 
                 
                 ) 
               
             
              
             
               = 
               Δ 
             
              
             
               
                 ( 
                 
                   a 
                   , 
                   D 
                 
                 ) 
               
                
               
                 
                   ∑ 
                   
                     s 
                     ∈ 
                     D 
                   
                 
                  
                 
                   
                     sup 
                     α 
                   
                    
                   
                     ( 
                     
                       s 
                       , 
                       D 
                     
                     ) 
                   
                 
               
             
           
         
       
     
         [0000]    where ∝ is a free parameter and sup(s, D) is the support of an itemset s in a document D (i.e., the number of times s occurs in D). 
         [0024]    The weight of a given itemset s with respect to an author a&#39;s documents is given by 
         [0000]    
       
         
           
             
               w 
                
               
                 ( 
                 
                   s 
                   , 
                   a 
                 
                 ) 
               
             
             = 
             
               
                 
                    
                   
                     { 
                     
                       D 
                       | 
                       
                         D 
                         ∈ 
                         
                           C 
                           a 
                           
                             ( 
                             s 
                             ) 
                           
                         
                       
                     
                     } 
                   
                    
                 
                 
                    
                   
                     { 
                     
                       D 
                       | 
                       
                         D 
                         ∈ 
                         
                           C 
                           a 
                         
                       
                     
                     } 
                   
                    
                 
               
                
               
                 
                   ∑ 
                   
                     D 
                     ∈ 
                     
                       C 
                       a 
                     
                   
                 
                  
                 
                   
                     sup 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                   
                     Nf 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0000]    and the weight of the same itemset with respect to the document being scored is 
         [0000]    
       
         
           
             
               w 
                
               
                 ( 
                 
                   s 
                   , 
                   a 
                 
                 ) 
               
             
             = 
             
               
                 
                    
                   
                     { 
                     
                       D 
                       | 
                       
                         D 
                         ∈ 
                         
                           C 
                           a 
                           
                             ( 
                             s 
                             ) 
                           
                         
                       
                     
                     } 
                   
                    
                 
                 
                    
                   
                     { 
                     
                       D 
                       | 
                       
                         D 
                         ∈ 
                         
                           C 
                           a 
                         
                       
                     
                     } 
                   
                    
                 
               
                
               
                 
                   ∑ 
                   
                     D 
                     ∈ 
                     
                       C 
                       a 
                     
                   
                 
                  
                 
                   
                     sup 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                   
                     Nf 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0025]    The density of the itemset s in author a&#39;s documents is 
         [0000]    
       
         
           
             
               
                 ρ 
                 a 
               
                
               
                 ( 
                 
                   s 
                   , 
                   
                     C 
                     a 
                   
                 
                 ) 
               
             
             = 
             
               
                 1 
                 
                    
                   
                     { 
                     
                       D 
                       | 
                       
                         D 
                         ∈ 
                         
                           C 
                           a 
                         
                       
                     
                     } 
                   
                    
                 
               
                
               
                 
                   ∑ 
                   
                     D 
                     ∈ 
                     
                       C 
                       a 
                     
                   
                 
                  
                 
                   
                     sup 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                   
                     Nf 
                      
                     
                       ( 
                       
                         s 
                         , 
                         D 
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0000]    and the density of the itemset in the entire corpus is 
         [0000]    
       
         
           
             
               
                 ρ 
                 a 
               
                
               
                 ( 
                 
                   s 
                   , 
                   
                     C 
                     a 
                   
                 
                 ) 
               
             
             = 
             
               
                 1 
                 7 
               
                
               
                 
                   ∑ 
                   
                     i 
                     = 
                     0 
                   
                   6 
                 
                  
                 
                   
                     ∑ 
                     
                       D 
                       ∈ 
                       
                         C 
                         
                           a 
                           , 
                           i 
                         
                       
                     
                   
                    
                   
                     
                       
                         sup 
                          
                         
                           ( 
                           
                             s 
                             , 
                             D 
                           
                           ) 
                         
                       
                       · 
                       
                         θ 
                          
                         
                           ( 
                           
                             a 
                             , 
                             D 
                           
                           ) 
                         
                       
                     
                     
                       Nf 
                        
                       
                         ( 
                         
                           s 
                           , 
                           D 
                         
                         ) 
                       
                     
                   
                 
               
             
           
         
       
     
         [0000]    so the relative density of the itemset s with respect to the author a and the corpus is 
         [0000]    
       
         
           
             
               v 
                
               
                 ( 
                 
                   s 
                   , 
                   a 
                   , 
                   C 
                 
                 ) 
               
             
              
             
               = 
               Δ 
             
              
             
               
                 
                   
                     ρ 
                     a 
                   
                    
                   
                     ( 
                     
                       s 
                       , 
                       
                         C 
                         a 
                       
                     
                     ) 
                   
                 
                 
                   
                     ρ 
                     c 
                   
                    
                   
                     ( 
                     
                       s 
                       , 
                       C 
                     
                     ) 
                   
                 
               
               . 
             
           
         
       
     
         [0026]    Using these definitions, an exemplary score of document D with respect to author a and corpus C may be expressed as 
         [0000]    
       
         
           
             
               ψ 
                
               
                 ( 
                 
                   D 
                   , 
                   a 
                   , 
                   C 
                 
                 ) 
               
             
              
             
               = 
               Δ 
             
              
             
               
                 ∑ 
                 
                   s 
                   ∈ 
                   D 
                 
               
                
               
                 
                   [ 
                   
                     
                       
                         w 
                          
                         
                           ( 
                           
                             s 
                             , 
                             a 
                           
                           ) 
                         
                       
                       · 
                       tf_idf 
                     
                      
                     
                       
                         ( 
                         
                           s 
                           , 
                           D 
                         
                         ) 
                       
                       · 
                       
                         v 
                          
                         
                           ( 
                           
                             s 
                             , 
                             a 
                             , 
                             C 
                           
                           ) 
                         
                       
                     
                   
                   ] 
                 
                 . 
               
             
           
         
       
     
         [0027]    The relevant content delivered to the user devices may originate from many sources including caching proxies and surrogates. Originally, the content may be harvested from a back end content corpus rendered by an automated spider or bot executed through an account server  120 . Alternatively, the searched content may be generated by a search service provider such as Google®, Bing®, or Yahoo® that may independently harvest information. The top content or documents, such as those identified by documents&#39; utility or priority scores, may be recommended to the user through the content recommendation engine  204  and internal or external network. The result may be rendered through user devices through a hierarchical sequence with a priority-based display order so that content having higher utility scores is presented before lower scored content or the content may be presented through some other priority scheme such as taking the diversity between content into consideration when determining the content display order. 
         [0028]    To maintain privacy and increase the relevance of content delivery, users may access and edit their own personal behavioral profiles by logging into the system. Through a remote graphical user interface (GUI) resident to the client devices, users may view the relevance of selected topic phrases to other topic phrases associated with their accounts. Some GUIs allow users to access and edit their behavioral profiles through social networks like Google®, Facebook®, Twitter®, LinkedIn®, and others that create user accounts and provide authentication services. Once authenticated, users may modify or delete phrases individually, by topic, or by group. Behavioral profiles may also be modified or automatically generated through email addresses and affiliation information. When an email address or affiliation information is received, the account server  120  may automatically retrieve content through an automated program that searches a publicly accessible distributed network like the Internet for content associated with the email address or affiliation information to modify or create personal behavioral profiles  206 . For example, the account server may automatically harvest information from a user&#39;s homepage, a previous speech, blogs, or prior publications. The system may leverage such content to augment the captured information identified as relevant to the user. 
         [0029]    In alternative systems and processes content recommendations are not made solely according to a single personal behavioral profile. In this alternative shown in  FIG. 3  users having similar profiles are aggregated into a virtual “hyper user” profile  308  stored in a memory or the database server  116  through a user-based collaborative filtering of a plurality of personal behavioral profiles  206  executed through the off-line server  112 . The collaborative filter  306  is resident to a non-transient media that is accessible and executable by the off-line server  112 . The collaborative filter  306  that may comprise a collaborative personal information interest inference engine generates automatic predictions (filtering) about the interests of a user by collecting preferences from many users (collaborating). The engine may comprise a processor or a portion of a program retained in a non-transient media that determines how the program processes the personal behavioral profiles. The hyper user profile  308  may bridge behavior data from one real user to another real user of close resemblance and serve as a sample user to avoid highly redundant computation repeatedly performed for each user. The hyper user profile  308  may then be used to rank content with the highest rated content being delivered to the user through the Web server  110 , publicly accessible distributed network  108 , and optionally through the front end client interface  102 . Based on the user feedback, some customized systems and processes  300  automatically monitor and detect whether and when a user&#39;s interests exhibit a statistically significant shift, upon which the system automatically updates the inferred personal behavioral profile of the user and may assign the user to a statistically different hyper user profile  308 . Some customized systems and processes  300  are dynamic and autonomous self-tuning and are sensitive to changes in user&#39;s interest and drift. 
         [0030]    To optimize system run-time efficiency and minimize computational overheads a parallel computing architecture  310  is implemented to increase the throughput of the systems  300 . For each user group represented by a hyper user profile  308 , computation may be executed independently from other groups and loads balanced through load balancers. 
         [0031]    In another alternative system the front end client interfaces  102 , Web server or cluster  110 , and off-line server  112  may be implemented in software, encoded in a non-transitory signal bearing medium, or may reside in a memory resident to or interfaced to one or more processors or controllers that may support a tangible communication interface, wireless communication interface, or a wireless system. The memory may retain an ordered listing of executable instructions for implementing logical functions and may retain one or more engines that access files. The software is embodied in any non-transitory computer-readable medium or signal-bearing medium, for use by, or in connection with an instruction executable system, apparatus, and device, resident to system that may maintain a persistent or non-persistent connection with a destination. Such a system may include a computer-based system, a processor-containing system, or another system that includes an input and output interface that may communicate with a publicly accessible distributed network and/or privately accessible distributed network through a wireless or tangible communication bus through a public and/or proprietary protocol. 
         [0032]    A “computer-readable medium,” “machine-readable medium,” “propagated-signal” medium, and/or “signal-bearing medium” may comprise a non-transitory medium that contains or stores software for use by or in connection with an instruction executable system, apparatus, or device. The machine-readable medium may selectively be, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. A non-exhaustive list of examples of a machine-readable medium would include: an electrical connection having one or more wires, a portable magnetic or optical disk, a volatile memory such as a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM or Flash memory), or an optical fiber. A machine-readable medium may also include a tangible medium upon which software is printed, as the software may be electronically stored as an image or in another format (e.g., through an optical scan), then compiled, and/or interpreted or otherwise processed. The processed medium may then be stored in a computer and/or machine memory. 
         [0033]    The term “coupled” disclosed in this description may encompass both direct and indirect coupling. Thus, first and second parts are said to be coupled together when they directly contact one another, as well as when the first part couples to an intermediate part which couples either directly or via one or more additional intermediate parts to the second part. The term “substantially” or “about” may encompass a range that is largely, but not necessarily wholly, that which is specified. It encompasses all but a significant amount. When devices are responsive to commands events, and/or requests, the actions and/or steps of the devices, such as the operations that devices are performing, necessarily occur as a direct or indirect result of the preceding commands, events, actions, and/or requests. In other words, the operations occur as a result of the preceding operations. A device that is responsive to another requires more than an action (i.e., the device&#39;s response to) merely follow another action. 
         [0034]    While various embodiments of the invention have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the invention. Accordingly, the invention is not to be restricted except in light of the attached claims and their equivalents.