Patent Grant
8306982
1. Field of the Invention
This invention relates generally to computer systems and more specifically to user interfaces and search query definition that facilitate localization and display of search results in relation with an object. This invention also relates to technical document classification and more precisely to engineering and patent documents applied to a graphical representation of an object.
2. Description of the Related Art
Method for Building a Search Algorithm
Internet is a significant source of information. Browsing into such a mass of information remains difficult given search tools that are available. A search tool generally uses keywords to dig into Internet and find relevant Internet pages.
The relevant pages are found and ranked using various techniques depending on the search engine. Most techniques are using data and metadata found in an Internet page. The data is, mostly, the content, often text but not limited thereto, inside the Internet page. The metadata can be of different types, inter alia: registration pages, speed of play of the page, location of the page, HTML title, meta tags, keyword frequency, link popularity.
The tags in the source code usually occur in a particular sequence. If, for example, the Web page consists of a title, a heading, and two paragraphs of text, the tags would be of the sequence: (<html>, <head>, <title>, </title>, </head>, <body>, <h1>, </h1>, <p>, </p>, <p>, </p>, </body>, </html>). The sequence of tags in the source code has one or more sub-sequences, which are generally contiguous portions of the sequence. The sub-sequences can and usually have different lengths, which is the number of tags included in a sub-sequence. The above listed sequence has, for example, the sub-sequence (<title>) and the sub-sequence (<title>, </title>). As can be seen, a sub-sequence can have a length of one tag. The sub-sequences can start at different positions in the sequence. The above listed sequence has, for example, the sub-sequence (</h1>, <p>), which starts at the eighth position in the sequence, and the sub-sequence (<p>, </p>, <p>, </p>), which starts at the ninth position in the sequence. Sub-sequences can overlap with each other, i.e., share common tags. The above listed sequence has, for example, the sub-sequence (<title>, </title>, </head>, <body>, <h1>), and also the sub-sequence (</title>, </head>, <body>, <h1>, </h1>, <p>, </p>). The common tags here are </title>, </head>, <body>, and <h1>. Sequence and sub-sequences are denoted in the instant application by enclosing their elements in parentheticals.
Each sub-sequence of tags is associated with the particular portion of source code that starts and ends with the first tag and the last tag, respectively, of the sub-sequence. The particular portion of source code can define corresponding content of the Web page. The tag in a sub-sequence that includes only one tag is both the first and the last tag.
Each search engine uses its own unique formula, called search algorithm, to index, score and rank web sites. Search engines' algorithms weight various factor, such as a page's design and links, and various other keywords related criterions to rank pages in their search results.
The search engine suggests Internet page results based on the keywords from the user. This implies the user knows how is referred to what s/he is looking for; which is sometimes not exactly the case. It also happens that the search engine provides a list of results from which a few results are relevant to the searcher. Search techniques in the art do not allow the user to tell the search engine which documents are the most relevant such that the search algorithm be modified to focus on the relevant terms/metadata to provide more accurate search results. It could be desirable that a search engine suggests to the user to refine the search based on the most significant terms and/or metadata used in the algorithm. This way, the algorithm could be modified according to the user's input and cooperatively refined to narrow the query and therefore provides better search results.
The same problem can found in databases searches and other data deposits where searches and/or taxonomy is required.
Method for Linking Documents with an Object
Engineers and patent agents are generally using databases to collect and manage documents related to an object, a product or a method. These prior art databases are not drawing intuitive relationship between the document and the product/method. It is actually difficult for a user to make a link between a document and its precise relationship with the product or the method.
Document management systems and method available in the art to organize technical information and patent documents related to a product or a method fail to provide a simple and intuitive way to retrieve documents related to a specific aspect of an object, a product or a method and vice-versa.
Mostly, people that are not familiar with taxonomy or method for classifying documents will have a hard time finding the right documents based on their knowledge of the object, the product or the method.
It is therefore desirable to provide an improved apparatus and an improve method to draw links between documents and an object.
Other deficiencies will become apparent to one skilled in the art to which the invention pertains in view of the following summary and detailed description with its appended figures.
The following presents a simplified summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not an extensive overview of the invention. It is not intended to identify key/critical elements of the invention or to delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.
Method for Building a Search Algorithm
It is one aspect of the present invention to provide the most significant metadata from a document to a user so that the user can select which is the most appropriate metadata according to his/her search, once the selection is done a search engine can build a new query and perform a search, or refine the actual query and perform a search based on the updated query, in accordance with the selected metadata.
One aspect of the present invention provides a means for a user to get suggestions from a search engine about the most significant metadata, tags and/or keywords found inside an Internet page to better build a search query to retrieve related documents.
It is one additional aspect of the present invention to provide user-selectable elements representing metadata from an Internet page.
An aspect of the present invention provides a search engine using inputs from a user selecting suggested metadata, tags and/or keywords found inside an Internet page to refine a search.
An additional aspect of the present invention provides search results in the form of an array from which a user can infer the significance of the results between them by the position they use in the array.
It is an aspect of the present invention to provide user-selectable elements associated with an internet page, the user-selectable elements being adapted to represent the most significant metadata from the internet page and being selectable by the user to improve the accuracy of the search based on suggested wording inspired from the metadata from the internet page.
One other aspect of the present invention provides user-selectable elements displayed in graphical cooperation with a search result, at least some of the user-selectable elements being based on the metadata from the result, a selection of a user-selectable element being adapted to influence a query used to retrieve more relevant search results.
Another aspect of the present invention provides a search method, and/or a search engine adapted to carry on the method, adapted to suggests terms or elements considered in the search query, or algorithm, to the user such that the user can select which are the most relevant terms to help the search engine to refine the query, or algorithm, and provide more accurate search results. The suggested terms or elements can be displayed as user-selected elements such that the searcher can see and select the desired ones. The suggested terms can be reflecting the entire search or can be associated individually with each result. In the latter situation, the displayed terms can consider the metadata or each results to distinguish why each results appears in the results and further help the user to narrow down the search query by improving the search algorithm of the search engine.
Another aspect of the present invention provides a search algorithm that displays relevant algorithm elements collectively or individually associated with the provided search results. The algorithm elements being selectable by a user to help refine the algorithm. Algorithm elements can also include metadata from each search result to better identify which metadata term is the most relevant and be used in the search algorithm.
A computer-readable medium including computer-readable information thereon including instructions providing a method for refining a search algorithm, the method comprising displaying a document, displaying at least one metadata about the search result, receiving instructions about a selection of at least one of the metadata; and modifying a search algorithm by including the selected metadata in the search algorithm.
A computer-implemented method for identifying Web page content, the method comprising receiving a string of HTML source code that includes meta tags, determining the most relevant meta tags, receiving instructions based on the selection of at least one of the most relevant meta tags from a user, modifying a search algorithm, performing a search among web pages content based on the modified algorithm; and displaying search results.
Method for Linking Documents with an Object
The present invention provides a computerized system enabling a graphical link between a graphical representation of a product/method and documents related to the product.
The present invention provides a two dimensional—or a three dimensional—graphical representation (i.e. picture or avatar) of a product and pinpoints the locations on the graphical representation where related documents are available.
The present invention provides a direct link between the pinpoint locations and related documents. The selection of a pinpoints (illustratively) disposed on a precise location on a graphical representation of a product leads to the documents related to this precise area of the product and vice-versa.
The present invention provides a pinpoint mark that can be magnified to display the related document. The global view of the product would show a plurality of pinpoint while magnification of a pinpoint would provide more information about the actual document related to it. The magnification can be progressive so thus would be the increase in the amount of document information so provided.
The present invention provides a user to dispose a pinpoint on an image of a product to draw a link between a document and the product. The pinpoint can be directly disposed onto the desired area or use an arrow to reach the desired area.
The present invention provides a three dimensional rendering of a product adapted to display marks thereon to illustrate areas of the product having documents related thereto. The three dimensional rendering can be moved, rotated, magnified, sliced and change in transparency to allow a user to better see each portion of the product to figure out the exact location of each marks. The marks can use visual distinctive features associated with attributes or tags to improve the distinctiveness there between.
The present invention provides a system and a method for disposing marks on the visual representation of a product associated with patent documents. The selection of the marks being made in accordance with the pertinence of the patent document with the portion of the product where the mark is disposed. The marks can be disposed in accordance with the claimed subject matter or the disclosure contained in the patent document. The marks can also refers to a family of patents and the marks be directed to a system of the product.
The present invention provides a computer interface comprising a graphical representation of an object; and a plurality of pinpoints disposed at specific locations on the object; wherein the selection of a pinpoint provides information about a the document associated with the specific location.
The present invention provides a method to search information based on physical distance comprising selecting a first identifier on the representation of an object; and providing results ordered according to the distance of other identifier on the object.
The present invention provides a non-transitory computer-readable medium adapted to store thereon computer-readable instructions that, when executed with a computer, provide a method for managing information elements in relation with an object on a display of a computer, the method comprising providing an information element, providing a visual distinctive element associated with the information element, providing an object, associating a visual distinctive element at a location on the object and displaying the object on the display, with the associated visual distinctive element thereon, to provide a graphical reference at a location on the object, the visual distinctive element being adapted to draw a link with the information element.
The present invention provides a user-graphical interface on an electronic computing device including a display, the user-graphical element comprising a graphical area adapted to display an object thereon, the object being further adapted to display thereon a plurality of visual distinctive elements at respective locations on the object and further adapted to be respectively associated with information elements, the visual distinctive elements being adapted to provide further information related to their respective information element associated therewith.
These and other advantages and features of the present invention will become apparent from the following description and the attached drawings.
The present invention is now described with reference to the figures. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention by way of embodiment(s). It may be evident, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the present invention.
The features provided in this specification mainly, but might not exclusively, relate to principles of computer software and machine-readable code/instructions adapted to instruct a computer, many computers or other machines adapted to use the instructions to provide material effects on a display, or other means enabling human-computer interactions to manage documents, menus, user-selectable elements and other computer files. These code/instructions are preferably stored on a machine-readable medium to be read and acted upon to with a computer or a machine having the appropriate code/instructions reading capability.
Exemplary Network
The client devices 12 may include devices, such as mainframes, minicomputers, personal computers, laptops, personal digital assistants, phones, or the like, capable of connecting to the network 20. The client devices 12 may transmit data over the network 20 or receive data from the network 20 via a wired, wireless, or optical connection.
The servers 14, 16, 18 may include one or more types of computer system, such as a mainframe, minicomputer, or personal computer, capable of connecting to the network 20 to enable servers 14, 16, 18 to communicate with the client devices 12. In alternative implementations, the servers 14, 16, 18 may include mechanisms for directly connecting to one or more client devices 12. The servers 14, 16, 18 may transmit data over the network 20 or receive data from the network 20 via a wired, wireless, or optical connection.
In an implementation consistent with the present invention illustratively embodied herein, the server 14 may include a search engine 22 usable by the client devices 12. The servers 14, 16, 18 may store documents, such as web pages, accessible by the client devices 12.
With reference to
Exemplary Client Architecture
The following discussion provides a brief, general description of an exemplary computer apparatus in which at least some aspects of the present invention may be implemented. The present invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a computerized device. However, the methods of the present invention may be affected by other apparatus. Program modules may include routines, programs, objects, components, data structures, applets, WEB 2.0 type of evolved networked centered applications, etc. that perform a task(s) or implement particular abstract data types. Moreover, those skilled in the art will appreciate that at least some aspects of the present invention may be practiced with other configurations, including hand-held devices, multiprocessor system, microprocessor-based or programmable consumer electronics, network computers, minicomputers, set top boxes, mainframe computers, gaming console and the like. At least some aspects of the present invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices linked through a communications network as exemplified in
With reference to
A number of program modules may be stored on the hard disk 127, magnetic disk 129, (magneto) optical disk 131, ROM 124 or RAM 125, such as an operating system 135 (for example, Windows® NT® 4.0, sold by Microsoft® Corporation of Redmond, Wash.), one or more application programs 136, other program modules 137 (such as “Alice”, which is a research system developed by the User Interface Group at Carnegie Mellon University available at www.Alice.org, OpenGL from Silicon Graphics Inc. of Mountain View Calif., or Direct 3D from Microsoft Corp. of Bellevue Wash.), and/or program data 138 for example.
A user may enter commands and data into the computer 120 through input devices, such as a keyboard 140, a camera 141 and pointing device 142 for example. Other input devices (not shown) such as a microphone, joystick, game pad, satellite dish, scanner, a touch sensitive screen, accelerometers adapted to sense movements of the user or movements of a device, or the like may also be included. These and other input devices are often connected to the processing unit 121 through a serial port interface 146 coupled to the system bus. However, input devices may be connected by other interfaces, such as a parallel port, a game port, blue tooth connection or a universal serial bus (USB). For example, since the bandwidth of the camera 141 may be too great for the serial port, the video camera 141 may be coupled with the system bus 123 via a video capture card (not shown). The video monitor 147 or other type of display device may also be connected to the system bus 123 via an interface, such as a video adapter 148 for example. The video adapter 148 may include a graphics accelerator. One or more speaker 162 may be connected to the system bus 123 via a sound card 161 (e.g., a wave table synthesizer such as product number AWE64 Gold Card from Creative® Labs of Milpitas, Calif.). In addition to the monitor 147 and speaker(s) 162, the computer 120 may include other peripheral output devices (not shown), such as a printer, a hi-definition television and a scanner for example. As an alternative or an addition to the video monitor 147, a stereo video output device, such as a head mounted display or LCD shutter glasses for example, could be used.
The computer 120 may operate in a networked environment which defines logical connections to one or more remote computers, such as a remote computer 149. The remote computer 149 may be another computer, a server, a router, a network PC, a peer device or other common network node, and may include many or all of the elements described above relative to the computer 120. The logical connections depicted in
When used in a LAN, the computer 120 may be connected to the LAN 151 through a network interface adapter (or “NIC”) 153. When used in a WAN, such as the Internet, the computer 120 may include a modem 154 or other means for establishing communications over the wide area network 152 (e.g. Wi-Fi, WinMax). The modem 154, which may be internal or external, may be connected to the system bus 123 via the serial port interface 146 or another type of port interface. In a networked environment, at least some of the program modules depicted relative to the computer 120 may be stored in the remote memory storage device. The network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
The exemplary network and the exemplary computer system described above are adapted to carry on the following:
Method for Building a Search Algorithm
Turning now to
In this embodiment the web browser 200 is used because it is the general tool to navigate the internet. The web browser 200 could alternatively be replaced in a second embodiment by a different program or interface adapted to dialogue with the user to receive search instructions from the searcher. The alternate program or interface could be designed to search specific databases or date repositories containing the desired data. The alternate program or interface could include a search engine therein adapted to manage searches.
The query 202 used by Internet search tools (e.g. like Google™.com) is normally built with key words that are used in algorithms. Each algorithm analyzes the data in a specific way attributing more or less value to each data document and their associated metadata. The search query 202 could be built at the client level or at the search server level 204 without departing from the scope of the present invention. Similarly, the search engine may be implemented on the search server 204 with trivial effects on the invention. Once the search has been performed the search results are sent to a metadata management module 214 that could either be on the server side or the client side (in a network environment). The metadata management module analyses the search results to determine which metadata is associated with which search result and is also used to determine the role and the importance of each metadata in the search algorithm to weight and order the metadata (including data in the data itself if the data is a document for instance) in a way that the user can infer the “weight” or the value given to each metadata by the algorithm. The metadata can illustratively be, inter alia, keywords in the URL, tags, attributes, keywords in the Internet page/document, links interacting with the Internet page and categories. Other ranking factors for internet search engines can be appreciated at the following internet address: http://www.vaughns-1-pagers.com/internet/google-ranking-factors.htm and additional information about metadata or meta description tag can be seen at the following internet address: http://www.searchengines.com/metadescription.html, both documents are included herein by reference.
An important role of the metadata management module 214 is to present to the user (the searcher) of the web browser/search engine 200 which metadata have the most influence on the search so that the user can provide instructions based thereon to the search engine 200 so as how to modify the search query to improve the search. Ideally, the metadata management module 214 should consider the individual metadata of each search result to allow the user to appreciate what information from each search result were considered by the algorithm. This is one way to allow the user to better understand why each search result is presented as a search result. Not all search result is pertinent to the user and the user now have the ability to inform the search engine which search result is relevant and which metadata is the most relevant. The query and the algorithm can thus be refined to refocus the next search to what the user is searching.
The results presentation module 216 is consequently adapted to display the search results to the user, via the web browser or the search engine 200, with their associated relevant metadata. The results presentation module 216 could be a web browser plug-in or a dedicated program cooperating with the search engine 200. The results presentation module 216 can illustratively present the “heavier” metadata having the most influence in the search algorithm on top of a user-selectable list and eliminate the metadata having trivial effect in the search. The user can therefore appreciate the most significant metadata associated with the results, collectively or individually, and select the most relevant ones, and the most relevant search results, to refine the search query and lunch another search.
The search 238 uses, at least in part, the most relevant metadata to perform a search on the Internet, an extranet and/or an intranet. Results are obtained 240 from the search 238. The results are individually associated 242 with metadata that are the most relevant to the search algorithm. This search can alternatively provide an idea of how many results are obtained for each relevant metadata (or combination of relevant metadata) and are used to help the system to give a relevancy order among the relevant metadata. The system then creates user-selectable elements 244 associated with each relevant metadata and display user-selectable elements 246. The user-selectable elements will allow a user of the system to select metadata(s) that are considered the most relevant to her/him. Preferably the user-selectable elements are displayed in relation with the Internet page (the search result) so that a user can see at the same time the Internet page and the user-selectable elements.
Step 248 requests a choice from the user. The user needs to select one (or many) user-selectable elements to alter the search algorithm based, at least in part, on the relevant metadata. If the user does not select any user-selectable element the query remains the same as a query already performed at steps 238, 240 then a new search is not necessary. In contrast, if the user has selected a combination of user-selectable elements capable of refining the search, a new query will be built and secondary search will be launched. The search 250 is performed on whatever network or database the system has access to. Results can be displayed as an array of relevant results 252 or as a listing of search results. That ends the first exemplary flowchart 254.
Referring now to
The selection of user-selectable elements can be made with logical Boolean operators (AND, OR, ANDNOT, NOT, BIGGER THAN, SMALLER THAN . . . ) to ensure accuracy of the search. When the user has selected the desired set of user-selectable elements a new search is launched and the loop restarts to provide updated relevant results based on the new set of user-selectable elements.
Turning now to
User selectable elements are created to represent the relevant metadata 282. The search results are preferably graphically associated with the relevant search results 284. As seen previously a search is performed based on the selection of user-selectable elements from a parent web page part of a parent array of results and the user can decide if the results provided by the new search 286 will be disposed in a new array that is displayed parallel 290 or intersecting 288 with the parent array of results and displayed 292. The user can navigate the new array of results 294 and the process restarts again if further user-selectable elements are selected.
Moving to
Another array of results 346 is provided below where metadata F and G have been selected from document 318. Document 318 is displayed first on array 346 for the same reasons as indicated above, followed by document 302 comprising the two selected metadata and document 310 that is associated with only one of the selected metadata (G). Other relevant documents follow 352. This is an illustrative example of selected embodiments of the invention that uses a simple algorithm. Other more complicated algorithms could be used without departing from the scope of the present invention.
Method for Linking Documents with an Object
It is sometimes desirable to draw a link between an object and related documents. In other words, starting from a visual rendering of an object it is desirable to retrieve documents related to the object in a graphical fashion. This is useful, for instance, in the case of a product that has portions thereof covered by patents. By having a look on the image of the product, one is capable of easily and intuitively retrieving patent documents related to a specific portion of the object by using a graphical link disposed on the object. The opposite is also true. From a document one is capable to retrieve the image of the object and see on the object where the document is the most relevant.
The schematic illustrative object 500 can be an isometric view, a perspective view, a three-dimensional image or an avatar, without departing from the scope of the present invention. A two-dimensional image, a sectional view, an isometric or perspective view is also encompassed by the present invention.
A plurality of pinpoints 510 is disposed on the object 500. Pinpoints 510 are marks, having the shape of pins or not, that are disposed on the object. These pinpoints 510 are disposed on a precise location of the object to illustrate there is something related to this precise location that is available to the user. In the present embodiment, pinpoints 510 are disposed on the object 500 as a graphical link to a document 512. The link is also established the other way around between the document 512 and the object 500. The pinpoint 510 and the links between documents 512 are managed by an interface that allows the creation, change locations of the pinpoints 510 on the object and modify the link therebetween. Once a pinpoint 510 is disposed on the object 500 it can eventually be moved or erased if not useful anymore. When there is a little space available or when a section of the object is too crowded to ensure proper visibility of the pinpoint 510 a lead 514 can be used to show where the pinpoint 510 is directed on the object 500.
The pinpoints 510 can have different shapes, colors and sizes to help a viewer to distinguish pinpoints 510 sharing a commonality. These pinpoints “visual distinctive features” are associated with the pinpoint 510 when the pinpoint 510 is created or after when the pinpoint 510 is already on the object 500. The visual distinctive features are illustratively assigned to an attribute defining the document 512. Thus, a viewer can distinguish all pinpoints 510 associated with documents and having the same attribute in a glimpse of an eye.
In the present example pinpoints 510 have either a square 516 shape or a circular shape 518. The color of the pinpoints 510 can also be used to discriminate the pinpoints 510. In the present example we have a dark color 520 and a light color 522. Other signs 524 and variations are encompassed by the present invention.
Various actions on a pinpoint 510 would lead to different interactions with the document 512 associated therewith. For example, the pointing device 528 of a computer system enabling the interface carrying the present embodiment could hover over one pinpoint 510, 526 to show a summary 530 of the document 512. A simple click (selection) of the pinpoint 540 leads to a thumbnail view 532 of the document 512. The thumbnail view 532 can be associated with a set of attributes/tags 534 associated with the document 512. Each attribute from the set of attributes 534 is selectable and lead to some other related documents/objects. For instance, if attribute 536 is the name of the creator of the document 512 a selection of attribute 536 will lead to other documents from the same creator. The selection of attribute 536 could alternatively hi-light other pinpoints from the same creator. Other alternative actions are encompassed by the present invention. Similarly, if attribute 538 were one of the mechanical systems of the object to which the document 512 pertains, in the present situation the seat of a personal watercraft, a selection of attribute 538 would lead to documents related to seats. The same dynamic can be applied with almost infinite variations depending on the object and the documents. A double click on the pinpoint 540 launches the program to see the document 512 and possibly edit it. The aforementioned description illustrates one embodiment among other possible alternate embodiments.
Still referring to
Other views of the same object 550 are available to ensure the best visualization of the object and the best localization of the pinpoints. The user can switch from one view to other views as desired.
As illustrated on
When the interface is used specifically for patents, each element of the bibliographic data from a patent can be represented as an attribute 610 and therefore it is possible to retrieve, for example, all patent documents from a specific assignee 612 starting from a pinpoint 600 applied on the image of a product. The selection of the pinpoint leads to a view 618 of the patent document with selectable attributes 610 associated therewith. A selection of the attribute “assignee” 612 leads to the patent documents from the same assignee. All documents 620-636 can be disposed along a chronological order if desired. The illustrative example is directed to patents but could be performed with other types of information like technical documents, maintenance documents directed to specific portions of an aircraft (for instance).
The description and the drawings that are presented above are meant to be illustrative of the present invention. They are not meant to be limiting of the scope of the present invention. Modifications to the embodiments described may be made without departing from the present invention, the scope of which is defined by the following claims:
The present invention relates to, claims priority from and is a division application of U.S. patent application Ser. No. 12/466,936, filed May 15, 2009, entitled METHOD FOR BUILDING A SEARCH ALGORITHM AND METHOD FOR LINKING DOCUMENTS WITH AN OBJECT, which claims priority from U.S. Provisional Patent Application No. 61/053,242, filed May 15, 2008, entitled METHOD FOR NAVIGATING INTERNET AND METHOD FOR LINKING DOCUMENTS, these documents are incorporated herein by reference. The present invention also relates to United States Patent Application Publication No.: US 2007/0214169 A1, published Sep. 13, 2007, entitled MULTI-DIMENSIONAL LOCATING SYSTEM AND METHOD and United States Patent Application Publication No.: US 2007/0271508 A1, published Nov. 22, 2007, entitled MULTI-DIMENSIONAL LOCATING SYSTEM AND METHOD. Both of these documents are incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4616336 | Robertson | Oct 1986 | A |
| 4653021 | Takagi | Mar 1987 | A |
| 5115504 | Belove | May 1992 | A |
| 5148154 | MacKay | Sep 1992 | A |
| 5241624 | Torres | Aug 1993 | A |
| 5535063 | Lamming | Jul 1996 | A |
| 5546528 | Johnston | Aug 1996 | A |
| 5581752 | Inoue | Dec 1996 | A |
| 5621874 | Lucas | Apr 1997 | A |
| 5634064 | Warnock | May 1997 | A |
| 5649182 | Reitz | Jul 1997 | A |
| 5659742 | Beattie | Aug 1997 | A |
| 5671381 | Strasnick | Sep 1997 | A |
| 5680605 | Torres | Oct 1997 | A |
| 5701500 | Ikeo | Dec 1997 | A |
| 5713031 | Saito | Jan 1998 | A |
| 5740815 | Alpins | Apr 1998 | A |
| 5781188 | Amiot | Jul 1998 | A |
| 5781785 | Rowe | Jul 1998 | A |
| 5822751 | Gray | Oct 1998 | A |
| 5832504 | Tripathi | Nov 1998 | A |
| 5838317 | Bolnick | Nov 1998 | A |
| 5847707 | Hayashida | Dec 1998 | A |
| 5878410 | Zbikowski | Mar 1999 | A |
| 5900879 | Berry | May 1999 | A |
| 5903271 | Bardon | May 1999 | A |
| 5905992 | Lucas | May 1999 | A |
| 5933843 | Takai | Aug 1999 | A |
| 6003034 | Tuli | Dec 1999 | A |
| 6006227 | Freeman | Dec 1999 | A |
| 6009442 | Chen | Dec 1999 | A |
| 6012072 | Lucas | Jan 2000 | A |
| 6029164 | Birrell | Feb 2000 | A |
| 6064384 | Ho | May 2000 | A |
| 6067554 | Hohensee | May 2000 | A |
| 6081817 | Taguchi | Jun 2000 | A |
| 6088032 | Mackinlay | Jul 2000 | A |
| 6108657 | Shoup | Aug 2000 | A |
| 6111578 | Tesler | Aug 2000 | A |
| 6119120 | Miller | Sep 2000 | A |
| 6151604 | Wlaschin | Nov 2000 | A |
| 6151702 | Overturf | Nov 2000 | A |
| 6175845 | Smith | Jan 2001 | B1 |
| 6185551 | Birrell | Feb 2001 | B1 |
| 6189012 | Mital | Feb 2001 | B1 |
| 6202068 | Kraay | Mar 2001 | B1 |
| 6240421 | Stolarz | May 2001 | B1 |
| 6243093 | Czerwinski | Jun 2001 | B1 |
| 6243724 | Mander | Jun 2001 | B1 |
| 6253218 | Aoki | Jun 2001 | B1 |
| 6289362 | Van Der Meer | Sep 2001 | B1 |
| 6295639 | Van Der Meer | Sep 2001 | B1 |
| 6308187 | DeStefano | Oct 2001 | B1 |
| 6337698 | Keely, Jr. et al. | Jan 2002 | B1 |
| 6388665 | Linnett | May 2002 | B1 |
| 6392651 | Stradley | May 2002 | B1 |
| 6457017 | Watkins | Sep 2002 | B2 |
| 6463431 | Schmitt | Oct 2002 | B1 |
| 6538672 | Dobbelaar | Mar 2003 | B1 |
| 6553310 | Lopke | Apr 2003 | B1 |
| 6662357 | Bowman-Amuah | Dec 2003 | B1 |
| 6678694 | Zimmermann | Jan 2004 | B1 |
| 6754660 | MacPhail | Jun 2004 | B1 |
| 6889220 | Wolff | May 2005 | B2 |
| 6915489 | Gargi | Jul 2005 | B2 |
| 6948124 | Combs | Sep 2005 | B2 |
| 6987220 | Holcombe | Jan 2006 | B2 |
| 7007034 | Hartman | Feb 2006 | B1 |
| 7020848 | Rosenzweig | Mar 2006 | B2 |
| 7055104 | Billmaier | May 2006 | B1 |
| 7149983 | Robertson | Dec 2006 | B1 |
| 7199809 | Lacy | Apr 2007 | B1 |
| 7234114 | Kurtz | Jun 2007 | B2 |
| 7334191 | Sivan | Feb 2008 | B1 |
| 7346600 | Nakao | Mar 2008 | B2 |
| 7353461 | Davidsson | Apr 2008 | B2 |
| 7418674 | Robbins | Aug 2008 | B2 |
| 7447999 | Robertson et al. | Nov 2008 | B1 |
| 7606819 | Audet | Oct 2009 | B2 |
| 7680817 | Audet | Mar 2010 | B2 |
| 7681128 | Yamamoto | Mar 2010 | B2 |
| 7765195 | Miller | Jul 2010 | B2 |
| 7788247 | Wang | Aug 2010 | B2 |
| 20010025288 | Yanase | Sep 2001 | A1 |
| 20010034766 | Morimoto | Oct 2001 | A1 |
| 20020035563 | Suda | Mar 2002 | A1 |
| 20020078035 | Frank et al. | Jun 2002 | A1 |
| 20020087530 | Smith | Jul 2002 | A1 |
| 20020096831 | Nakayama | Jul 2002 | A1 |
| 20020101458 | SanGiovanni | Aug 2002 | A1 |
| 20030093260 | Dagtas | May 2003 | A1 |
| 20030167902 | Hiner | Sep 2003 | A1 |
| 20030190950 | Matsumoto | Oct 2003 | A1 |
| 20040103090 | Dogl et al. | May 2004 | A1 |
| 20040111401 | Chang | Jun 2004 | A1 |
| 20040128277 | Mander | Jul 2004 | A1 |
| 20040150657 | Wittenburg | Aug 2004 | A1 |
| 20040233238 | Lahdesmaki | Nov 2004 | A1 |
| 20040233239 | Lahdesmaki | Nov 2004 | A1 |
| 20040263519 | Andrews | Dec 2004 | A1 |
| 20060095852 | Trepess et al. | May 2006 | A1 |
| 20060242178 | Butterfield | Oct 2006 | A1 |
| 20060248053 | Sanfilippo et al. | Nov 2006 | A1 |
| 20060248129 | Carnes | Nov 2006 | A1 |
| 20060259511 | Boerries | Nov 2006 | A1 |
| 20070005576 | Cutrell | Jan 2007 | A1 |
| 20070005590 | Thrasher | Jan 2007 | A1 |
| 20070007884 | Iwanaga | Jan 2007 | A1 |
| 20070011150 | Frank | Jan 2007 | A1 |
| 20070061855 | Serita | Mar 2007 | A1 |
| 20070067290 | Makela | Mar 2007 | A1 |
| 20070214169 | Audet | Sep 2007 | A1 |
| 20070216694 | Audet | Sep 2007 | A1 |
| 20070271508 | Audet | Nov 2007 | A1 |
| 20080000126 | Teza | Jan 2008 | A1 |
| 20080022199 | Sako | Jan 2008 | A1 |
| 20080058106 | Audet | Mar 2008 | A1 |
| 20080071822 | Audet | Mar 2008 | A1 |
| 20080072169 | Audet | Mar 2008 | A1 |
| 20080092038 | Audet | Apr 2008 | A1 |
| 20080134013 | Audet | Jun 2008 | A1 |
| 20080134022 | Audet | Jun 2008 | A1 |
| 20080141115 | Audet | Jun 2008 | A1 |
| 20080270946 | Risch et al. | Oct 2008 | A1 |
| 20080295016 | Audet | Nov 2008 | A1 |
| 20080299989 | King | Dec 2008 | A1 |
| 20090019371 | Audet | Jan 2009 | A1 |
| 20090055413 | Audet | Feb 2009 | A1 |
| 20090055726 | Audet | Feb 2009 | A1 |
| 20090055729 | Audet | Feb 2009 | A1 |
| 20090055763 | Audet | Feb 2009 | A1 |
| 20090055776 | Audet | Feb 2009 | A1 |
| 20090070662 | Audet | Mar 2009 | A1 |
| 20090083260 | Artom | Mar 2009 | A1 |
| 20090228788 | Audet | Sep 2009 | A1 |
| 20090287693 | Audet | Nov 2009 | A1 |
| 20090287694 | McGowan et al. | Nov 2009 | A1 |
| 20090288006 | Audet | Nov 2009 | A1 |
| 20100082427 | Burgener | Apr 2010 | A1 |
| 20100082653 | Nair | Apr 2010 | A1 |
| 20100094890 | Bokor | Apr 2010 | A1 |
| 20100145976 | Higgins | Jun 2010 | A1 |
| 20100169823 | Audet | Jul 2010 | A1 |
| 20100185509 | Higgins | Jul 2010 | A1 |
| 20100325132 | Liu | Dec 2010 | A1 |
| 20100325134 | Galfond | Dec 2010 | A1 |
| 20100332512 | Shpits | Dec 2010 | A1 |
| 20100333031 | Castelli | Dec 2010 | A1 |
| 20110078166 | Oliver | Mar 2011 | A1 |
| Number | Date | Country |
|---|---|---|
| 2005045756 | May 2005 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20110307814 A1 | Dec 2011 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61053242 | May 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 12466936 | May 2009 | US |
| Child | 13217055 | US |
