This invention generally relates to search requests, and more specifically relates to a method and apparatus for using a non-query URI component as a search request.
The Internet is a vast computer network consisting of many smaller networks that span the world. A network provides a distributed communicating system of computers that are interconnected by various electronic communication links and computer software protocols. Because of the Internet's distributed and open network architecture, it is possible to transfer data from one computer to any other computer worldwide. In 1991, the World-Wide-Web (WWW or Web) revolutionized the way information is managed and distributed.
The Web is based on the concept of hypertext and a transfer method known as Hypertext Transfer Protocol (HTTP) which is designed to run primarily over a Transmission Control Protocol/Internet Protocol (TCP/IP) connection that employs a standard Internet setup. A server-computer may issue the data and a client computer displays or processes it. TCP may then convert messages into streams of packets at the source, then reassemble them back into messages at the destination. Internet Protocol (IP) handles addressing, seeing to it that packets are routed across multiple nodes and even across multiple networks with multiple standards. HTTP protocol permits client systems connected to the Internet to access independent and geographically scattered server systems also connected to the Internet.
Client side browsers, such as Netscape Navigator and/or Microsoft Internet Explorer (MSIE) provide graphical user interface (GUI) based client applications that implement the client side portion of the HTTP protocol. One format for information transfer is to create documents using Hypertext Markup Language (HTML). HTML pages are made up of standard text as well as formatting codes that indicate how the page should be displayed. The client side browser reads these codes in order to display the page. A web page may be static and requires no variables to display information or link to other predetermined web pages. A web page is dynamic when arguments are passed which are either hidden in the web page or entered from a client browser to supply the necessary inputs displayed on the web page. Common Gateway Interface (CGI) is a standard for running external programs from a web server. CGI specifies how to pass arguments to the executing program as part of the HTTP server request. Commonly, a CGI script may take the name and value arguments from an input form of a first web page which may be used as a query to access a database server and generate an HTML web page with customized data results as output that is passed back to the client browser for display.
The Web is a means of accessing information on the Internet that allows a user to “surf the web” and navigate the Internet resources intuitively, without technical knowledge. The Web dispenses with command-line utilities, which typically require a user to transmit sets of commands to communicate with an Internet server. Instead, the Web is made up of millions of interconnected web pages, or documents, which may be displayed on a computer monitor. Hosts running special servers provide the Web pages. Software that runs these Web servers is relatively simple and is available on a wide range of computer platforms including PC's.
A Uniform Resource Identifier (URI) is a compact string of characters for identifying an abstract or physical resource. URIs, is the generic set of all names and addresses that refer to objects on the Internet. URLs that refer to objects accessed with existing protocols are known as URLs. A URL is the address of a file accessible on the Internet. The URL contains the name of the protocol required to access the resource, a domain name, Fully Qualified Domain Name (FQDN), or IP address that identifies a specific computer on the Internet, and a hierarchical description of a file location on the computer. In addition, the last (optional) part of the URL may be a “?” followed by a query string having name/value pairs for parameters (e.g. “?size=small&quantity=3”) or a “#” followed by a fragment identifier indicating a particular position within the specified document.
The URI “http://www.example.com:80/index.html#appendix” is the concatenation of several components where “http:” is the scheme or protocol, “//www.example.com” is the FQDN having “www” as the host of the domain name “example.com”, “:80” is the port connection for the HTTP server request, “index.html” is the filename located on the server, “#appendix” is the identifier to display a fragment of the HTML file called “index”. The URL “http://www.example.com” also retrieves an HTML file called “index” on a HTTP server called “example.com”. By default, when either a port or filename is omitted upon accessing a HTTP server via a URL, the client browser interprets the request by connecting via port 80, and retrieving the HTML file called “index”.
A domain name consists of two parts: a host and a domain. Technically, the letters to the right of the “dot” (e.g., tut.net) are referred to as Top Level Domains (TLDs), while hosts, computers with assigned IP addresses that are listed in specific TLD registries are known as second-level domains (SLDs). For the domain name “tut.net”, “.net” is the TLD, and “tut” is the SLD. Domain name space is the ordered hierarchical set of all possible domain names either in use or to be used for locating an IP address on the Internet. TLDs are known as top-level domains because they comprise the highest-order name space available on the Internet. Second-level domains, as well as third-level domains (3LDs) such as “king.tut.net”, are subsidiary to TLDs in the hierarchy of the Internet's DNS.
The main use of a web browser location field is for locating URLs to access resources. Entering a URL in the location field of a web browser serves as a means to access that URL. Because the function of the location field is so critical for accessing resources, the design of such location fields have rivaled much competition and innovation between existing web browser products. Improvements to better track and organize sites of URLs that users have visited such as Bookmark folders, URL history, and the personal toolbar are all examples of functionality designed to help users navigate.
A more recent feature called Smart Browsing is integrated into Netscape Navigator that uses Internet Keywords so users can streamline the use of URLs and get fast access to web sites using the browser's location field. Any single or multiword strings typed into the browser's location field that does not include a “.” are sent via HTTP to a server at “netscape.com”. The keyword server pulls the string and compares it to several separate lists of keyword-URL pairs. If the keyword system finds a match, it redirects the user's browser to the URL of the keyword-URL pair. Failing a match against the lists, the user's browser is redirected to a Netscape Search page with the typed string as the search query.
U.S. Provisional Application Ser. No. 60/143,859 filed Jul. 15, 1999, by Schneider entitled “Method and apparatus for generation, registration, resolution, and emulation of name space”, now abandoned, uses a domain name having a top level domain alias (TLDA) to simultaneously access and search a given resource demonstrating the combination of both resolution and search services. For instance, when input is received and processed such as “http://example.44106”, steps are performed to determine that “0.44106” is not a resolvable TLD and may be processed instead as a search term. Steps may then be performed to translate input into a valid URI such as “http://example.com/weather.cgi?zip=44106”. When the URI is accessed, a CGI script called “weather” is executed passing the value “44106” for the name “zip”, which in this case represents a zip code. By so doing a fictitious name is used to simultaneously access both a resource and search request.
This clearly demonstrates the need for methods of encouraging the creative use of URIs to access resources. Accordingly, in light of the above, there is a strong need in the art for a system and method to improve how resources and content may be accessed.
Briefly, the present invention allows URI components to be used as a search term in a query or search request. The invention allows for the non-query portion of a first URI to be used in the query portion of a second URI to generate dynamic content. The present invention allows for a shorter URI to be created on the fly in real-time that accesses content of a longer URI. The invention allows the user to combine Boolean logic with valid URI notation to generate a search request from the URI or vice-versa.
In general, in accordance with the present invention a method for locating a network resource from a first identifier includes the steps of determining whether the first identifier is accessible, accessing the first identifier in response to determining that the first identifier is accessible, generating a second identifier in response to determining that the first identifier is not accessible, wherein said second identifier is generated by retrieving information from one of a user modifiable configuration settings, template, GO LIST, name translation table, and registry, and accessing said second identifier in response to generating said second identifier.
In accordance with another aspect of the present invention a method for locating a network resource from a first identifier having a valid accessible first URI includes the steps of parsing at least one non-query URI component from the first URI, generating a valid accessible second URI having a query component that corresponds to the first URI, and simultaneously accessing both the first URI and said second URI.
In accordance with yet another aspect of the present invention a method for locating a network resource from a first identifier having a valid first URI includes the steps of determining whether the first URI is accessible, accessing the first URI in response to determining that the first URI is accessible, parsing at least one non-query URI component from the first URI in response to determining that the first URI is not accessible, generating a valid second URI having a query component that corresponds to the first URI, and accessing said second URI.
In accordance with yet additional aspects of the present invention, an apparatus which implements substantially the same functionality in substantially the same manner as the methods described above is provided.
In accordance with other additional aspects of the present invention, a computer-readable medium that includes computer-executable instructions may be used to perform substantially the same methods as those described above is provided.
The foregoing and other features of the invention are hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail one or more illustrative aspects of the invention, such being indicative, however, of but one or a few of the various ways in which the principles of the invention may be employed.
The present invention will now be described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout.
Turning first to the nomenclature of the specification, the detailed description that follows represents processes and symbolic representations of operations by conventional computer components, including a local processing unit, memory storage devices for the local processing unit, display devices, and input devices. Furthermore, these processes and operations may utilize conventional computer components in a heterogeneous distributed computing environment, including remote file servers, computer servers, and memory storage devices. These distributed computing components may be accessible to the local processing unit by a communication network.
The processes and operations performed by the computer include the manipulation of data bits by a local processing unit and/or remote server and the maintenance of these bits within data structures resident in one or more of the local or remote memory storage devices. These data structures impose a physical organization upon the collection of data bits stored within a memory storage device and represent electromagnetic spectrum elements.
A process may generally be defined as being a sequence of computer-executed steps leading to a desired result. These steps generally require physical manipulations of physical quantities. Usually, though not necessarily, these quantities may take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, compared, or otherwise manipulated. It is conventional for those skilled in the art to refer to these signals as bits or bytes (when they have binary logic levels), pixel values, works, values, elements, symbols, characters, terms, numbers, points, records, objects, images, files, directories, subdirectories, or the like. It should be kept in mind, however, that these and similar terms should be associated with appropriate physical quantities for computer operations, and that these terms are merely conventional labels applied to physical quantities that exist within and during operation of the computer.
It should also be understood that manipulations within the computer are often referred to in terms such as adding, comparing, moving, positioning, placing, illuminating, removing, altering, etc., which are often associated with manual operations performed by a human operator. The operations described herein are machine operations performed in conjunction with various input provided by a human operator or user that interacts with the computer. The machines used for performing the operation of the present invention include local or remote general-purpose digital computers or other similar computing devices.
In addition, it should be understood that the programs, processes, methods, etc. described herein are not related or limited to any particular computer or apparatus nor are they related or limited to any particular communication network architecture. Rather, various types of general-purpose machines may be used with program modules constructed in accordance with the teachings described herein. Similarly, it may prove advantageous to construct a specialized apparatus to perform the method steps described herein by way of dedicated computer systems in a specific network architecture with hard-wired logic or programs stored in nonvolatile memory, such as read only memory.
The client computers 110 may be any network access apparatus including hand held devices, palmtop computers, personal digital assistants (PDAs), notebook, laptop, portable computers, desktop PCs, workstations, and/or larger/smaller computer systems. It is noted that the network access apparatus 110 may have a variety of forms, including but not limited to, a general purpose computer, a network computer, an internet television, a set top box, a web-enabled telephone, an internet appliance, a portable wireless device, a game player, a video recorder, and/or an audio component, for example.
Each client 110 typically includes one or more processors 166, memories 168, and input/output devices 170. An input device may be any suitable device for the user to give input to client computer system 110, for example: a keyboard, a 10-key pad, a telephone key pad, a light pen or any pen pointing device, a touchscreen, a button, a dial, a joystick, a steering wheel, a foot pedal, a mouse, a trackball, an optical or magnetic recognition unit such as a bar code or magnetic swipe reader, a voice or speech recognition unit, a remote control attached via cable or wireless link to a game set, television, and/or cable box. A data glove, an eye-tracking device, or any MIDI device may also be used. A display device may be any suitable output device, such as a display screen, text-to-speech converter, printer, plotter, fax, television set, or audio player. Although the input device is typically separate from the display device, they may be combined; for example: a display with an integrated touchscreen, a display with an integrated keyboard, or a speech-recognition unit combined with a text-to-speech converter.
The servers 120 may be similarly configured. However, in many instances server sites 120 include many computers, perhaps connected by a separate private network. In fact, the network 130 may include hundreds of thousands of individual networks of computers. Although client computers 110 are shown separate from the server computers 120, it is understood that a single computer might perform the client and server roles. Those skilled in the art will appreciate that the computer environment 100 shown in
During operation of the distributed system 100, users of the clients 110 may desire to access information records 122 stored by the servers 120 while utilizing, for example, the Web. Furthermore, such server systems 120 may also include one or more search engines having one or more databases 124. The records of information 122 may be in the form of Web pages 150. The pages 150 may be data records including as content plain textual information, or more complex digitally encoded multimedia content, such as software programs, graphics, audio signals, videos, and so forth. It should be understood that although this description focuses on locating information on the World-Wide-Web, the system may also be used for locating information via other wide or local area networks (WANs and LANs), or information stored in a single computer using other communications protocols.
The clients 110 may execute Web browser programs 112, such as Netscape Navigator or MSIE to locate the pages or records 150. The browser programs 112 enable users to enter addresses of specific Web pages 150 to be retrieved. Typically, the address of a Web page is specified as a URI or more specifically as a URL. In addition, when a page has been retrieved, the browser programs 112 may provide access to other pages or records by “clicking” on hyperlinks (or links) to previously retrieved Web pages. Such links may provide an automated way to enter the URL of another page, and to retrieve that page.
In effect, the non-query portion of a first URI may be used in the query portion of a second URI to generate dynamic content. Validity of URI syntax is explained in T. Berners-Lee, “Informational RFC (Request for Comment) 1630: Universal Resource Identifiers in WWW—A Unifying Syntax for the Expression of Names and Addresses of Objects on the Network as used in the World-Wide Web”, Internet Engineering Task Force (IETF), June 1994, “http://www.faqs.org/rfcs/rfc1630.html”, which is herein incorporated by reference.
Typically, when a HTTP request is submitted to access a URI that does not exist, an error 404 code is returned from the requested web server, and in turn, a script may be executed to redirect and display a gen-eric web page informing the user of the error 404 code. A modification may be made to the script to generate an accessible URI by creating the appropriate directories or files on the web server in response to an error 404 code (or any other applicable error code from the 300 series, 400 series, or 500 series) such that when the HTTP request is resubmitted the URI exists and is accessible.
For example, a device receives the input “http://update.to/news”. When it is determined that the input is a valid URL (URL is a subset of a URI), a HTTP GET request is submitted to retrieve its content. A “404 error code” is received in response to the request indicating that no such URL exists. As practiced by those skilled in the art, the “404 error code” is commonly redirected to display a gen-eric informative page alerting the user that no such URL exists. Advantage may be taken by modifying the redirect script.
The modified script may be executed upon the “404 error code” and determines that a “/news” directory does not exist and is created. Furthermore, an “index.htm” is created in the “news” directory serving as a default file for the URL listed above. The content of the file includes a <META> tag which may be used to redirect the URL to another URL such as “http://update.to/cgi-bin/update.cgi?search=news” which serves as a dynamic output.
For instance, the input “update.to/news” becomes equivalent to “http://update.to/news/index.htm” and includes within the “index.htm” file the following <META> tag:
In effect, shorter URLs may be generated in real time or on-the-fly when necessary and used as a substitute or proxy for longer URLs. Though any filename may be used, it is a preferred aspect to use “index.htm” as a frame or redirect so the proxy URL is even shorter in string length. A shorter URL makes it easier for a user to remember the URL for future use. The invention is not limited to using only a FLD as a search request. Any directory or combination of directory levels may be either generated on the fly or used as a search request. In addition to using the directory portion of a URI as a search request, a domain (e.g., SLD) or any combination of domain levels may in turn be used to generate a query as well. For example, a subdomain may be generated to create the FQDN “news.update.to” having the minimum form of “scheme://3LD.SLD.TLD”, which may be used to access content from “http://update.to/cgi-bin/update.cgi?search=news”.
Analysis from major online search engines show that more than 90% of all search requests include three keywords or less. For instance, the search request “coffee and cream and sugar” can yield “http://example.com/coffee/cream/sugar/index.htm”. In turn, the input “example.com/coffee/cream/sugar” can generate search results thereby combining the step of searching by entering in a web address or URI to search. Boolean logic can be applied to extend variations for simple search requests. For example, the search request “coffee or cream or sugar” yields “http://example.com/coffee.cream.sugar/index.htm” whereas the search request “coffee or cream and sugar” yields “http://example.com/coffee.cream/sugar/index.htm”. In effect, URI notation can be used a system to generate a Boolean search request from the URI or vice-versa.
Another web page 810′ (as discussed in
Though the above aspects demonstrate how URIs may be accessed based upon a web-based version of a location field, similar teachings may be applied to those skilled in the art by providing a user interface element such as a text box object as input. The text box object may be located anywhere and on any web page including a text box that may be embedded or displayed as part of an on-line advertisement. The text box object may be used in a stand-alone application or stored on magnetic and/or optical media that may be non-volatile, writable, removable, or portable. The text box object may be incorporated as an applet or servlet and embedded in other applications. The text box may be integrated in the task bar or any part of the GUI's OS, or the OS bypassed and a user interface element overlaid as a graphic on a display device based on modifications to a video card and/or it's associated firmware or software drivers. A command line text box may be further overlaid as an interactive object in other embodiments such as Internet television, cable television, digital television, or interactive television through an Internet appliance or set top box.
Those skilled in the art may make and use software program that functions as a browser plug-in. Such a program may be downloaded and installed for integration into the command line of a device or location field 154 of a browser program 112. Modifying the source code of the browser program 112 itself may be more desirable, in effect, enabling tens of millions of users to take advantage of more creative ways to use input as a means to access a valid URI.
Although the invention has been shown and described with respect to a certain preferred aspect or aspects, it is obvious that equivalent alterations and modifications will occur to others skilled in the art upon the reading and understanding of this specification and the annexed drawings. In particular regard to the various functions performed by the above described items referred to by numerals (components, assemblies, devices, compositions, etc.), the terms (including a reference to a “means”) used to describe such items are intended to correspond, unless otherwise indicated, to any item which performs the specified function of the described item (e.g., that is functionally equivalent), even though not structurally equivalent to the disclosed structure which performs the function in the herein illustrated exemplary aspect or aspects of the invention. In addition, while a particular feature of the invention may have been described above with respect to only one of several illustrated aspects, such feature may be combined with one or more other features of the other aspects, as may be desired and advantageous for any given or particular application.
The description herein with reference to the figures will be understood to describe the present invention in sufficient detail to enable one skilled in the art to utilize the present invention in a variety of applications and devices. It will be readily apparent that various changes and modifications could be made therein without departing from the spirit and scope of the invention as defined in the following claims.
This application claims the benefit of the following patent applications, which are hereby incorporatedincorporates the following applications by reference: 1.this application is a continuation-in-part of U.S. patent application Ser. No. 09/532,500 filed Mar. 21, 2000, by Schneider, entitled “Fictitious domain name method, product, and apparatus”, which claims the benefit ofnow U.S. Pat. No. 7,136,932; this application is also a continuation-in-part of U.S. patent application Ser. No. 09/525,350 filed Mar. 15, 2000, by Schneider, entitled “Method for integrating domain name registration with domain name resolution”and, now U.S. Pat. No. 6,338,082; this application also claims the benefit of U.S. Provisional Application Ser. No. 60/143,859 filed Jul. 15, 1999, by Schneider entitled “Method and apparatus for generation, registration, resolution, and emulation of name space”, now abandoned,; this application also claims the benefit of U.S. Provisional Application Ser. No. 60/135,751 filed May 25, 1999, by Schneider entitled “Method and system for name space resolution”, now abandoned and; this application also claims the benefit of U.S. Provisional Application Ser. No. 60/125,531 filed Mar. 22, 1999, by Schneider entitled “Method and system for the emulation of name space”, now abandoned.; 2.this application also claims the benefit of U.S. Provisional Application Ser. No. 60/153,594 filed Sep. 13, 1999, by Schneider entitled “Method and apparatus for using a portion of a URI to select and display advertising.”; 3.this application also claims the benefit of U.S. Provisional Application Ser. No. 60/152,015 filed Sep. 1, 1999, by Schneider, et al., entitled “Method and apparatus for using a portion of a URI as a search request.”
Number | Name | Date | Kind |
---|---|---|---|
4155042 | Permut et al. | May 1979 | A |
4190800 | Kelly, Jr. et al. | Feb 1980 | A |
4196310 | Forman et al. | Apr 1980 | A |
4390876 | Bjorklund et al. | Jun 1983 | A |
4486853 | Parsons | Dec 1984 | A |
4754326 | Kram et al. | Jun 1988 | A |
4811382 | Sleevi | Mar 1989 | A |
4823265 | Nelson | Apr 1989 | A |
4903206 | Itoh et al. | Feb 1990 | A |
4956771 | Nuestaedter | Sep 1990 | A |
4956875 | Bernard et al. | Sep 1990 | A |
5109486 | Seymour | Apr 1992 | A |
5155837 | Liu et al. | Oct 1992 | A |
5155847 | Kirouac et al. | Oct 1992 | A |
5175681 | Iwai et al. | Dec 1992 | A |
5231570 | Lee | Jul 1993 | A |
5249230 | Mihm, Jr. | Sep 1993 | A |
5249275 | Srivastava | Sep 1993 | A |
5319699 | Kerihuel et al. | Jun 1994 | A |
5321740 | Gregorek et al. | Jun 1994 | A |
5386369 | Christiano | Jan 1995 | A |
5402490 | Mihm, Jr. | Mar 1995 | A |
5404231 | Bloomfield | Apr 1995 | A |
5404505 | Levinson | Apr 1995 | A |
5418951 | Damashek | May 1995 | A |
5437031 | Kitami | Jul 1995 | A |
5444823 | Nguyen | Aug 1995 | A |
5446891 | Kaplan et al. | Aug 1995 | A |
5454105 | Hatakeyama et al. | Sep 1995 | A |
5500561 | Wilhelm | Mar 1996 | A |
5534734 | Pugh et al. | Jul 1996 | A |
5535257 | Goldberg et al. | Jul 1996 | A |
5544036 | Brown, Jr. et al. | Aug 1996 | A |
5572438 | Ehlers et al. | Nov 1996 | A |
5576700 | Davis et al. | Nov 1996 | A |
5592620 | Chen et al. | Jan 1997 | A |
5598464 | Hess et al. | Jan 1997 | A |
5600778 | Swanson et al. | Feb 1997 | A |
5603034 | Swanson | Feb 1997 | A |
5623679 | Rivette et al. | Apr 1997 | A |
5623681 | Rivette et al. | Apr 1997 | A |
5625818 | Zarmer et al. | Apr 1997 | A |
5634016 | Steadham, Jr. et al. | May 1997 | A |
5634048 | Ryu et al. | May 1997 | A |
5640561 | Satoh et al. | Jun 1997 | A |
5644625 | Solot | Jul 1997 | A |
5649186 | Ferguson | Jul 1997 | A |
5664170 | Taylor | Sep 1997 | A |
5673252 | Johnson et al. | Sep 1997 | A |
5684710 | Ehlers et al. | Nov 1997 | A |
5692132 | Hogan | Nov 1997 | A |
5696695 | Ehlers et al. | Dec 1997 | A |
5699428 | McDonnal et al. | Dec 1997 | A |
5701399 | Lee et al. | Dec 1997 | A |
5708709 | Rose | Jan 1998 | A |
5721897 | Rubinstein | Feb 1998 | A |
5742818 | Shoroff et al. | Apr 1998 | A |
5745360 | Leone et al. | Apr 1998 | A |
5761083 | Brown, Jr. et al. | Jun 1998 | A |
5761689 | Rayson et al. | Jun 1998 | A |
5764906 | Edelstein et al. | Jun 1998 | A |
5778367 | Wesinger, Jr. et al. | Jul 1998 | A |
5790790 | Smith et al. | Aug 1998 | A |
5802524 | Flowers et al. | Sep 1998 | A |
5812776 | Gifford | Sep 1998 | A |
5813007 | Nielsen | Sep 1998 | A |
5815830 | Anthony | Sep 1998 | A |
5835087 | Herz et al. | Nov 1998 | A |
5841850 | Fan | Nov 1998 | A |
5842203 | D'Elena et al. | Nov 1998 | A |
5848396 | Gerace | Dec 1998 | A |
5857201 | Wright, Jr. et al. | Jan 1999 | A |
5870546 | Kirsch | Feb 1999 | A |
5881131 | Farris et al. | Mar 1999 | A |
5890172 | Borman et al. | Mar 1999 | A |
5892919 | Nielsen | Apr 1999 | A |
5892920 | Arvidsson et al. | Apr 1999 | A |
5895454 | Harrington | Apr 1999 | A |
5898836 | Freivald et al. | Apr 1999 | A |
5907680 | Nielsen | May 1999 | A |
5908467 | Barrett et al. | Jun 1999 | A |
5913215 | Rubinstein et al. | Jun 1999 | A |
5926116 | Kitano et al. | Jul 1999 | A |
5933604 | Inakoshi | Aug 1999 | A |
5937037 | Kamel et al. | Aug 1999 | A |
5937162 | Funk et al. | Aug 1999 | A |
5940847 | Fein et al. | Aug 1999 | A |
5944787 | Zoken | Aug 1999 | A |
5949419 | Domine et al. | Sep 1999 | A |
5953400 | Rosenthal et al. | Sep 1999 | A |
5953721 | Doi et al. | Sep 1999 | A |
5963205 | Sotomayor | Oct 1999 | A |
5963915 | Kirsch | Oct 1999 | A |
5970680 | Powers | Oct 1999 | A |
5974453 | Andersen et al. | Oct 1999 | A |
5978806 | Lund | Nov 1999 | A |
5978817 | Giannandrea et al. | Nov 1999 | A |
5978828 | Greer et al. | Nov 1999 | A |
5978842 | Noble et al. | Nov 1999 | A |
5982863 | Smiley et al. | Nov 1999 | A |
5987464 | Schneider | Nov 1999 | A |
5987508 | Agraharam et al. | Nov 1999 | A |
5991368 | Quatse et al. | Nov 1999 | A |
5991751 | Rivette et al. | Nov 1999 | A |
5995594 | Shaffer et al. | Nov 1999 | A |
5999907 | Donner | Dec 1999 | A |
5999912 | Wodarz et al. | Dec 1999 | A |
6003061 | Jones et al. | Dec 1999 | A |
6003077 | Bawden et al. | Dec 1999 | A |
6003082 | Gampper et al. | Dec 1999 | A |
6006264 | Colby et al. | Dec 1999 | A |
6006265 | Rangan et al. | Dec 1999 | A |
6009150 | Kamel | Dec 1999 | A |
6009459 | Belfiore | Dec 1999 | A |
6012066 | Discount et al. | Jan 2000 | A |
6014660 | Lim et al. | Jan 2000 | A |
6018619 | Allard et al. | Jan 2000 | A |
6018768 | Ullman et al. | Jan 2000 | A |
6021433 | Payne et al. | Feb 2000 | A |
6023724 | Bhatia et al. | Feb 2000 | A |
6029195 | Herz | Feb 2000 | A |
6032150 | Nguyen | Feb 2000 | A |
6038601 | Lambert et al. | Mar 2000 | A |
6041324 | Earl et al. | Mar 2000 | A |
6057834 | Pickover | May 2000 | A |
6058250 | Harwood et al. | May 2000 | A |
6058355 | Ahmed et al. | May 2000 | A |
6061700 | Brobst et al. | May 2000 | A |
6061734 | London | May 2000 | A |
6061738 | Osaku et al. | May 2000 | A |
6085242 | Chandra | Jul 2000 | A |
6091956 | Hollenberg | Jul 2000 | A |
6092100 | Berstis et al. | Jul 2000 | A |
6094665 | Lyons et al. | Jul 2000 | A |
6097108 | Tweed | Aug 2000 | A |
6098099 | Ellesson et al. | Aug 2000 | A |
6104582 | Cannon et al. | Aug 2000 | A |
6104990 | Chaney et al. | Aug 2000 | A |
6105098 | Ninose et al. | Aug 2000 | A |
6119153 | Dujari et al. | Sep 2000 | A |
6119234 | Aziz et al. | Sep 2000 | A |
6122520 | Want et al. | Sep 2000 | A |
6122627 | Carey et al. | Sep 2000 | A |
6125361 | Chakrabarti et al. | Sep 2000 | A |
6128623 | Mattis et al. | Oct 2000 | A |
6134588 | Guenthner et al. | Oct 2000 | A |
6137873 | Gilles | Oct 2000 | A |
6141408 | Garfinkle | Oct 2000 | A |
6141653 | Conklin et al. | Oct 2000 | A |
6148289 | Virdy | Nov 2000 | A |
6148342 | Ho | Nov 2000 | A |
6151624 | Teare et al. | Nov 2000 | A |
6154600 | Newman et al. | Nov 2000 | A |
6154725 | Donner | Nov 2000 | A |
6154771 | Rangan et al. | Nov 2000 | A |
6154777 | Ebrahim | Nov 2000 | A |
6157292 | Piercy et al. | Dec 2000 | A |
6167389 | Davis et al. | Dec 2000 | A |
6167449 | Arnold et al. | Dec 2000 | A |
6169476 | Flanagan | Jan 2001 | B1 |
6173406 | Wang et al. | Jan 2001 | B1 |
6181787 | Malik | Jan 2001 | B1 |
6181985 | O'Donnell et al. | Jan 2001 | B1 |
6182148 | Tout | Jan 2001 | B1 |
6182227 | Blair et al. | Jan 2001 | B1 |
6185619 | Joffe et al. | Feb 2001 | B1 |
6189030 | Kirsch et al. | Feb 2001 | B1 |
6195691 | Brown | Feb 2001 | B1 |
6199076 | Logan et al. | Mar 2001 | B1 |
6202087 | Gadish | Mar 2001 | B1 |
6205139 | Voit | Mar 2001 | B1 |
6209048 | Wolff | Mar 2001 | B1 |
6212565 | Gupta | Apr 2001 | B1 |
6219696 | Wynblatt et al. | Apr 2001 | B1 |
6219709 | Byford | Apr 2001 | B1 |
6229532 | Fujii | May 2001 | B1 |
6230168 | Unger et al. | May 2001 | B1 |
6240360 | Phelan | May 2001 | B1 |
6240555 | Shoff et al. | May 2001 | B1 |
6249817 | Nakabayashi et al. | Jun 2001 | B1 |
6256671 | Strentzsch et al. | Jul 2001 | B1 |
6256739 | Skopp et al. | Jul 2001 | B1 |
6259771 | Kredo et al. | Jul 2001 | B1 |
6259972 | Sumic et al. | Jul 2001 | B1 |
6269361 | Davis et al. | Jul 2001 | B1 |
6282511 | Mayer | Aug 2001 | B1 |
6292172 | Makhlouf | Sep 2001 | B1 |
6292709 | Uhl et al. | Sep 2001 | B1 |
6297819 | Furst | Oct 2001 | B1 |
6298327 | Hunter et al. | Oct 2001 | B1 |
6298341 | Mann et al. | Oct 2001 | B1 |
6298352 | Kannan et al. | Oct 2001 | B1 |
6311214 | Rhoads | Oct 2001 | B1 |
6314469 | Tan et al. | Nov 2001 | B1 |
6321222 | Soderstrom et al. | Nov 2001 | B1 |
6321242 | Fogg et al. | Nov 2001 | B1 |
6324538 | Wesinger, Jr. et al. | Nov 2001 | B1 |
6324585 | Zhang et al. | Nov 2001 | B1 |
6324650 | Ogilvie | Nov 2001 | B1 |
6332141 | Gonzalez et al. | Dec 2001 | B2 |
6332158 | Risley et al. | Dec 2001 | B1 |
6338082 | Schneider | Jan 2002 | B1 |
6339767 | Rivette et al. | Jan 2002 | B1 |
6339786 | Ueda et al. | Jan 2002 | B1 |
6356422 | Bilac et al. | Mar 2002 | B1 |
6356898 | Cohen et al. | Mar 2002 | B2 |
6360256 | Lim | Mar 2002 | B1 |
6363433 | Nakajima | Mar 2002 | B1 |
6366298 | Haitsuka et al. | Apr 2002 | B1 |
6366906 | Hoffman | Apr 2002 | B1 |
6381627 | Kwan et al. | Apr 2002 | B1 |
6381651 | Nishio et al. | Apr 2002 | B1 |
6385620 | Kurzius et al. | May 2002 | B1 |
6389462 | Cohen et al. | May 2002 | B1 |
6393117 | Trell | May 2002 | B1 |
6401118 | Thomas | Jun 2002 | B1 |
6405243 | Nielsen | Jun 2002 | B1 |
6412014 | Ryan | Jun 2002 | B1 |
6421675 | Ryan et al. | Jul 2002 | B1 |
6427164 | Reilly | Jul 2002 | B1 |
6430623 | Alkhatib | Aug 2002 | B1 |
6434547 | Mishelevich et al. | Aug 2002 | B1 |
6438583 | McDowell et al. | Aug 2002 | B1 |
6442549 | Schneider | Aug 2002 | B1 |
6442602 | Choudhry | Aug 2002 | B1 |
6449657 | Stanbach, Jr. et al. | Sep 2002 | B2 |
6452609 | Katinsky et al. | Sep 2002 | B1 |
6496981 | Wistendahl et al. | Dec 2002 | B1 |
6502131 | Vaid et al. | Dec 2002 | B1 |
6502132 | Kumano et al. | Dec 2002 | B1 |
6505201 | Haitsuka et al. | Jan 2003 | B1 |
6509833 | Tate | Jan 2003 | B2 |
6510461 | Nielsen | Jan 2003 | B1 |
6513060 | Nixon et al. | Jan 2003 | B1 |
6519589 | Mann et al. | Feb 2003 | B2 |
6526402 | Ling | Feb 2003 | B2 |
6532366 | Chung et al. | Mar 2003 | B1 |
6549892 | Sansone | Apr 2003 | B1 |
6556992 | Barney et al. | Apr 2003 | B1 |
6560634 | Broadhurst | May 2003 | B1 |
6574737 | Kingsford et al. | Jun 2003 | B1 |
6578078 | Smith et al. | Jun 2003 | B1 |
6591291 | Gabber et al. | Jul 2003 | B1 |
6594697 | Praitis et al. | Jul 2003 | B1 |
6603844 | Chavez, Jr. et al. | Aug 2003 | B1 |
6604132 | Hitt | Aug 2003 | B1 |
6605120 | Fields et al. | Aug 2003 | B1 |
6606659 | Hegli et al. | Aug 2003 | B1 |
6608891 | Pelletier et al. | Aug 2003 | B1 |
6611803 | Furuyama et al. | Aug 2003 | B1 |
6615237 | Kyne et al. | Sep 2003 | B1 |
6615247 | Murphy | Sep 2003 | B1 |
6615348 | Gibbs | Sep 2003 | B1 |
6618697 | Kantrowitz et al. | Sep 2003 | B1 |
6618726 | Colbath et al. | Sep 2003 | B1 |
6628314 | Hoyle | Sep 2003 | B1 |
6636854 | Dutta et al. | Oct 2003 | B2 |
6636961 | Braun et al. | Oct 2003 | B1 |
6637032 | Feinleib | Oct 2003 | B1 |
6650877 | Tarbouriech et al. | Nov 2003 | B1 |
6654741 | Cohen et al. | Nov 2003 | B1 |
6654746 | Wong et al. | Nov 2003 | B1 |
6654779 | Tsuei | Nov 2003 | B1 |
6665620 | Burns et al. | Dec 2003 | B1 |
6668278 | Yen et al. | Dec 2003 | B1 |
6671585 | Lof et al. | Dec 2003 | B2 |
6671714 | Weyer et al. | Dec 2003 | B1 |
6671738 | Rajchel et al. | Dec 2003 | B1 |
6674993 | Tarbouriech | Jan 2004 | B1 |
6678717 | Schneider | Jan 2004 | B1 |
6691105 | Virdy | Feb 2004 | B1 |
6711585 | Copperman et al. | Mar 2004 | B1 |
6718321 | Birrell et al. | Apr 2004 | B2 |
6735585 | Black et al. | May 2004 | B1 |
6745367 | Bates et al. | Jun 2004 | B1 |
6748375 | Wong et al. | Jun 2004 | B1 |
6751562 | Blackett et al. | Jun 2004 | B1 |
6751606 | Fries et al. | Jun 2004 | B1 |
6760746 | Schneider | Jul 2004 | B1 |
6760770 | Kageyama | Jul 2004 | B1 |
6766369 | Haitsuka et al. | Jul 2004 | B1 |
6779178 | Lloyd et al. | Aug 2004 | B1 |
6799201 | Lee et al. | Sep 2004 | B1 |
6836805 | Cook | Dec 2004 | B1 |
6850940 | Wesinger, Jr. et al. | Feb 2005 | B2 |
6880007 | Gardos et al. | Apr 2005 | B1 |
6892226 | Tso et al. | May 2005 | B1 |
6895402 | Emens et al. | May 2005 | B1 |
6895430 | Schneider | May 2005 | B1 |
6901436 | Schneider | May 2005 | B1 |
6931451 | Logan et al. | Aug 2005 | B1 |
6944658 | Schneider | Sep 2005 | B1 |
6959339 | Wu et al. | Oct 2005 | B1 |
6961700 | Mitchell et al. | Nov 2005 | B2 |
6963928 | Bagley et al. | Nov 2005 | B1 |
6973505 | Schneider | Dec 2005 | B1 |
6981023 | Hamilton et al. | Dec 2005 | B1 |
6990678 | Zigmond | Jan 2006 | B2 |
7000028 | Broadhurst et al. | Feb 2006 | B1 |
7003442 | Tsuda | Feb 2006 | B1 |
7010568 | Schneider et al. | Mar 2006 | B1 |
7013298 | De La Huerga | Mar 2006 | B1 |
7039697 | Bayles | May 2006 | B2 |
7039708 | Knobl et al. | May 2006 | B1 |
7069323 | Gardos et al. | Jun 2006 | B2 |
7080158 | Squire | Jul 2006 | B1 |
7089194 | Berstis et al. | Aug 2006 | B1 |
7120236 | Schneider | Oct 2006 | B1 |
7136725 | Paciorek et al. | Nov 2006 | B1 |
7136932 | Schneider | Nov 2006 | B1 |
7149780 | Quine et al. | Dec 2006 | B2 |
7188138 | Schneider | Mar 2007 | B1 |
7194552 | Schneider | Mar 2007 | B1 |
7225249 | Barry et al. | May 2007 | B1 |
7359987 | Stahura | Apr 2008 | B2 |
7418471 | King et al. | Aug 2008 | B2 |
7472160 | King et al. | Dec 2008 | B2 |
7490124 | King et al. | Feb 2009 | B2 |
7543026 | Quine et al. | Jun 2009 | B2 |
7546381 | Tout | Jun 2009 | B2 |
7565402 | Schneider | Jul 2009 | B2 |
7606858 | King et al. | Oct 2009 | B2 |
7627628 | King et al. | Dec 2009 | B2 |
7752260 | King et al. | Jul 2010 | B2 |
8037168 | Schneider | Oct 2011 | B2 |
20010010032 | Ehlers et al. | Jul 2001 | A1 |
20010021947 | Kim | Sep 2001 | A1 |
20010047429 | Seng et al. | Nov 2001 | A1 |
20020010795 | Brown | Jan 2002 | A1 |
20020016174 | Gibson et al. | Feb 2002 | A1 |
20020023034 | Brown et al. | Feb 2002 | A1 |
20020059161 | Li | May 2002 | A1 |
20020065903 | Fellman | May 2002 | A1 |
20020069080 | Roy et al. | Jun 2002 | A1 |
20020069378 | McLellan et al. | Jun 2002 | A1 |
20020073233 | Gross et al. | Jun 2002 | A1 |
20020091703 | Bayles | Jul 2002 | A1 |
20020091827 | King et al. | Jul 2002 | A1 |
20020091836 | Moetteli | Jul 2002 | A1 |
20020103745 | Lof et al. | Aug 2002 | A1 |
20020129013 | Thomas | Sep 2002 | A1 |
20020024424 | Nelson et al. | Oct 2002 | A1 |
20020156800 | Ong | Oct 2002 | A1 |
20020188699 | Ullman et al. | Dec 2002 | A1 |
20020194113 | Lof et al. | Dec 2002 | A1 |
20030009592 | Stahura | Jan 2003 | A1 |
20030014450 | Hoffman | Jan 2003 | A1 |
20030074672 | Daniels | Apr 2003 | A1 |
20030088708 | Lewallen | May 2003 | A1 |
20030098375 | Shiga et al. | May 2003 | A1 |
20030225670 | DeCarlo, III | Dec 2003 | A1 |
20040030759 | Hidary et al. | Feb 2004 | A1 |
20040044791 | Pouzzner | Mar 2004 | A1 |
20040088083 | Davis et al. | May 2004 | A1 |
20040107025 | Ransom et al. | Jun 2004 | A1 |
20050055306 | Miller et al. | Mar 2005 | A1 |
20050102354 | Hollenbeck et al. | May 2005 | A1 |
20050235031 | Schneider | Oct 2005 | A1 |
20060190623 | Stahura | Aug 2006 | A1 |
20060265516 | Schilling | Nov 2006 | A1 |
20080005342 | Schneider | Jan 2008 | A1 |
20080010365 | Schneider | Jan 2008 | A1 |
20080016142 | Schneider | Jan 2008 | A1 |
20080016233 | Schneider | Jan 2008 | A1 |
20080059607 | Schneider | Mar 2008 | A1 |
20080235383 | Schneider | Sep 2008 | A1 |
Number | Date | Country |
---|---|---|
54136617 | Oct 1979 | JP |
11085492 | Mar 1999 | JP |
11184667 | Jul 1999 | JP |
11242682 | Sep 1999 | JP |
11296428 | Oct 1999 | JP |
9909726 | Feb 1999 | WO |
9922488 | May 1999 | WO |
9939275 | Aug 1999 | WO |
0007133 | Feb 2000 | WO |
Number | Date | Country | |
---|---|---|---|
60152015 | Sep 1999 | US | |
60153594 | Sep 1999 | US | |
60143859 | Jul 1999 | US | |
60135751 | May 1999 | US | |
60125531 | Mar 1999 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09532500 | Mar 2000 | US |
Child | 09643584 | US | |
Parent | 09525350 | Mar 2000 | US |
Child | 09532500 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09643584 | Aug 2000 | US |
Child | 12044804 | US |