The present disclosure relates to web page personalizing. In particular, the present disclosure relates to personalizing the content, an outline, and a theme of a web page.
A website can be comprised of a plurality of web pages. A web page can be used to convey data (e.g., content) to a user via a browser. The web page can be generated as code. The code can be provided using one or more language syntaxes. The code can be generated by an information technology specialist. Changes to the code can be time-consuming and can utilize resources that could otherwise be diverted to improve the website.
Personalized web pages can be generated at run-time for consumers based on business rules and consumer intents. The run-time personalization can include personalizing an outline of a web page, personalizing the content of the web page, and/or personalizing the theme of a web page. A web page can be personalized based on configurations and/or business rules that can vary from dealer to dealer and/or original equipment manufacturer (OEM) to OEM. The configurations and/or business rules can be selected to correspond with a profile associated with the user.
As used herein, a web page can refer to a single web page or a plurality of web pages. The web page can also refer to a website comprising the web page and/or the plurality of web pages. As such, references to personalizing a web page can include personalizing a plurality of web pages and/or personalizing a website.
An outline of a web page describes a structure of a plurality of cards that comprise a web page. Personalizing the outline of the web page can include personalizing the structure of the web page. A card defines a presentational view for content of the web page. A card is a data structure comprising at least a title field, media field, copy field, link field, and card field.
A theme of a web page describes the look and feel of the web page. For example, a theme can define a collection of card styles with colors and fonts. A card style for a card can include a layout of the card (e.g., presentational components) including cascading style sheet (CSS) properties, colors, and/or fonts.
Personalizing a web page at run-time removes the need to hard-code solutions to meet specific customer needs on a specific set of devices. Personalizing a web page provides out-of-the-box multi-device support with a personalized consumer experience that can vary the content, the outline, and/or the theme of a web page.
Previous embodiments lack a clear separation between the content, the structure, and the aesthetics of a web page. A number of examples provide a separation between the content, the outline, and the theme of a web page. The content of a web page can be separated from the outline and/or the theme by utilizing a graph system. A graph system can be used to define relationships between the content (e.g., entities) of the web page.
The graph system decouples the presentation tier from having direct coupling with content sources. The graph system provides a level of abstraction that allows a set of rules that can be injected at run-time (e.g., real-time) based on the context of a consumer (e.g., profile) and/or business rules to personalize the web page. The graph system can dynamically establish the relationships (e.g., links) between the entities and/or content that are represented using nodes. The two building blocks of the graph system are nodes (e.g., entities and/or content) and links (e.g., the relationship between nodes).
The graph system provides flexibility and establishes real-time relationships between nodes. The nodes are entities. The entities can include cards, vehicles, and/or dealers and associated content, among other types of entities. The graph system allows the showing of different cards (e.g., presentational form of content) to different consumers on a same dealer website. The graph system also allows the showing of different orders of cards (e.g., changing the outline) and/or the selection of different aesthetics (e.g., themes).
A graph generated by a graph system can utilize nodes and links as described above. A graph schema associated with the graph can define core domain objects and grouping of concepts (e.g., the grouping between vehicles and vehicle specifications). A graph model of the graph is an instance of the graph that defines properties for domain objects. For example, the graph model can define what attributes a vehicle and/or vehicle specification can have. The graph schema defines existing domain objects and/or the ability to create new domain objects. The graph model provides attributes and properties for domain objects. A graph instance includes actual values for the domain objects
The graph system can utilize adapters to retrieve content from various data stores (e.g., data sources). A data store can include a database, electronic memory, a storage device, cloud storage, and/or any other type of storage from which data can be retrieved. An adapter is an abstraction on top of various data sources. That is, an adapter can receive a request for data in a first syntax and can convert the request in the first syntax to a second syntax or more syntaxes to communicate with the various data sources. Each of the data sources can have a different syntax.
Reference is now made to the figures, in which like reference numerals refer to like elements. For clarity, the first digit of a reference numeral indicates the figure number in which the corresponding element is first used. In the following description, numerous specific details are provided for a thorough understanding of the embodiments disclosed herein. However, those skilled in the art will recognize that the embodiments described herein can be practiced without one or more of the specific details, or with other methods, components, or materials. Further, in some cases, well-known structures, materials, or operations are not shown or described in detail in order to avoid obscuring aspects of the embodiments. Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In some examples, each of the graph server 100, the web server 102, and/or the data stores 104 can comprise two or more computing devices. For example, each of the data stores 104 can be a separate computing device.
The web server 102 can be configured to receive a request 112 for a web page. The request 112 can originate at a user browser. The user browser can be configured to render data received from the web server 102 to present a web page to the user/consumer. The web server 102 can also be configured to provide 130 page code to the user browser to provide the web page to the user browser.
The request 112 can request a specific page from a website associated with the web server 102. For example, the request 112 can request a home page, a “contact us” page, and/or an “about us” page of a website. The request 112 can also request a web page associated with a vehicle make or a vehicle model. The request 112 can be a dealer web page request and/or a dealer location page. The request 112, in some examples, can be a review web page request, among other types of web page requests.
The web server 102 can request 114 the web page from the graph server 100. The graph server 100 can comprise a card handler 106, a templating system 108, and a graph system 110. The graph server 100 can receive the request 114 at the card handler 106.
The card handler 106 and/or the web server 102 can process the request 114 and/or the request 112 to identify, create, and/or access a profile associated with the request 114 and/or the request 112. For example, the request 114 and/or the request 112 can comprise a hypertext markup language (HTML) request. The HTML request can include header information which can identify a device, a browser, and/or a user from which the HTML request originated. The HTML request can also include cookies and/or other device, browser, and/or user identifying information. The device, browser, and/or user identifying information can be used by the card handler 106 and/or the web server 102 to generate the profile. In some examples, the web server 102 can provide the request 114 and/or the profile to the card handler 106. In other examples, the card handler 106 can receive the request 114 and generate the profile.
The profile can uniquely identify the user, a browser, and/or a device associated with the user. The profile can include the purchasing state of a user/consumer. For example, the profile can define that a consumer is initiating a consumer experience and/or that the consumer has not narrowed a search for a vehicle to a specific make and/or model. The purchasing state can be determined from the quantity of times the consumer has visited the website associated with the web server 102, the quantity of times that the consumer has browsed a specific vehicle make and/or model, and/or the specific web pages that the consumer has requested in the past, among other factors that can be utilized in determining a purchasing state. The profile can also identify a gender, an age, and/or a location of the consumer. The profile can further include a propensity to buy a vehicle and/or an interest level in a vehicle which can be determined based on the browsing history of the website associated with the web server 102. The profile can include additional data that can be used to uniquely identify the consumer and/or the consumer's preferences.
The card handler 106 can resolve 116 a page, associated with the web page request 114, by requesting a plurality of cards, an outline, data, and/or themes associated with the page from the graph system 110. The graph system 110 can generate a graph.
The graph can include a plurality of nodes and links. The links can define the relationships between the nodes (e.g., between the entities represented by the nodes). A node can be a logical container that defines an entity. An entity can describe a section of a web page. For example, a search field can be an entity, a vehicle profile can be an entity, or user information can be an entity, among other types of entities. As such, a node can represent a section of the web page such as a search field, a vehicle profile, user information, dealer information, header information, and/or footer information, among other types of sections of the web page. The links can represent relationships between the nodes. For example, if a first node represents a user name and a second node represents a user address, then a link stored in the first node can point to the second node to show a relationship between the user name and the user address. If the first node is a vehicle maker and second and third nodes represent vehicle models of the vehicle maker, then the first node can store a link to each of the second node and the third node to represent a relationship between the vehicle models and the vehicle maker.
The nodes and/or the links can be created and/or selected based on a plurality of business rules and/or the profile. For example, the requested web page can include a featured vehicles section. A first node can be generated for the featured vehicles section. The business rules can identify that no more than two vehicles can be shown in the featured vehicles section based on the profile indicating that the consumer is interested in two different vehicles. As such, a second node and a third node can be generated to represent the vehicles that the consumer is interested in, and the first node can be linked to the second node and the third node.
The graph system 110 can generate 118 a plurality of cards from the nodes. For example, if the graph includes a first node and a second node, then the graph system 110 can generate a first card that corresponds to the first node and a second card that corresponds to the second node. The links between the nodes can be implemented in the cards to retain a plurality of relationships.
The graph system 110 can access 120 content associated with the cards, nodes, and/or links based on business rules and/or the profile. The graph system 110 can also access outlines and/or themes based on business rules and/or the profile. The graph system 110 can access 120 the content, the outlines, and/or the themes from the data stores 104 using one or more adapters. The adapters allow the graph system 110 to communicate with the data stores 104 by mapping a first syntax to a second syntax.
The cards, the outlines, and/or the themes, as described herein, can reference data associated with the cards, data associated with the outlines, and/or data associated with the themes. As such, for example, generating the themes can include generating CSS (e.g., theme data) and generating the outline can include generating HTML (e.g., outline data).
The graph system 110 can provide the content 122, the outlines, and/or the themes to the card handler 106. The card handler 106 can generate a templating request 124 for the templating system 108. The templating request 124 can request a page code 126 using the cards, the outlines, the content, and/or the themes. The templating system 108 can receive and/or process the templating request 12 and generate the page code 126. The page code 126 can be generated using HTML and/or a different markup language. The page code 126 can also include embedded scripting languages such as JavaScript (JS) which can affect the behavior and content of the web page. The templating system 108 can return the page code 126 to the card handler.
Generating the page code 126 can include populating an outline with the cards and/or the content associated with the cards while preserving the relationships between the cards.
In some examples, the themes can be provided in CSS or the card handler 106 can generate the CSS from the themes. The card handler 106 can also generate JS based on the themes and/or the outline to incorporate into the page code 126. The card handler 106 can provide 128 the page code 126 to the web server 102. Providing 128 the page code 126 to the web server 102 can include providing the HTML, the CSS, and/or the JS to the web server 102. In some examples, the HTML, the CSS, and/or the JS can be provided to the web server 102 as JS object notation (JSON). As previously described, the web server 102 can provide 130 the page code to the user browser.
The graph system 210 can generate a graph 264 comprising a plurality of nodes and links connecting the nodes. The themes system 232 can select and/or generate a theme for a web page. The theme can comprise a color and/or font 242 and card styles 244 for a header, a footer, and/or different level cards of a web page. The theme can include directives 246. The directives 246 can include a carousel and/or tabs of a web page. The directives 246 can be implemented using JS. The theme can also include semantic hypertext markup language 5 (HTML5) 248. The theme can be accessed from data stores 238 using one or more adapters. In some examples, the themes system 232 can host an adapter and/or can utilize an adapter hosted by a different system. A theme can be selected by referencing a profile and/or a themes rule from a rules engine 236. A themes rule can be a set of rules that maps a profile to a theme. The themes system 232 can provide CSS and JS to provide a theme.
The rules engine 236 can comprise software and/or hardware that can store and retrieve data. The rules engine 236 can be, for example, a database, memory, and/or a storage device. The rules engine 236 can be implemented in the graph server 200 and/or a different device. In some examples, the rules engine 236 can be hosted on a cloud system.
The outline system 240 can include, at least, a header card 254, a level 1 to level X cards 256, and/or a footer card 258. The outline can describe an organization of the header card 254, the level 1 to level X cards 256, and/or the footer card 258. The organization associated with the outline can be selected from the data stores 238 using outline rules and/or a profile. The outline rules can map a profile to a particular outline (e.g., organization). The outline rules can be accessed from the rules engine 236.
The apps system 234 can include adapters 250. The adapters 250 can be used to access content from the data stores 238. The content accessed can be selected based on the graph 264, content rules, and/or a profile. The content rules can map nodes, cards, and/or a profile to content. The apps system 234 can generate the cards and populate them with the content using card templates 252. The card templates 252 can be provided in HTML while the card content can be provided in JS.
The themes can be purchased from the theme store 260. The apps system 234 can be purchased from an application store 262.
Each of the nodes 370 can store one or more links 372 to the one or more nodes 370. For example, a topic node can store a first link to a first person node, a second link to a second person node, a third link to a third person node, and a fourth link to an event node. In some examples, a node may not store a link to any other node.
The graph 364 can be generated using an application programming interface (API) 366. A graph system creating the graph 364 can utilize adapters 350 to extract content from data stores 368.
The outline 456 includes a plurality of cards organized in levels. For example, the outline 456 includes a level 1 card 455-1, level 2 cards 455-3 and 455-6, and level 3 cards 455-3, 455-4, and 455-5, referred to generally as cards 455.
Each of the cards 455 can comprise, at least, a title field, a media field, a copy field, and/or a links field. The cards 455 can describe an outline of cards generated from nodes. The cards 455 shown in
The outline system 440 can also comprise the page structure 457. The page structure 457 can define a structure of the cards 455. In some examples, the outline 456 can be converted to the page structure 457 using HTML. The outline system 440 can also include a header card 454 and a footer card 458.
For example, the themes system can apply the theme 532-1 to the page structure 557 or the theme 532-2 to the page structure 557. The themes 532-1 and 532-2 can differ in the presentation of the page structure 557 but not in the outline of the page structure 557. For example, the content associated with a level 1 card can be presented in a first manner corresponding to the theme 532-1 and a second manner corresponding to the theme 532-2. The content can be divided, rearranged, and/or formatted differently from theme to theme.
The one or more processors 622 may include one or more general-purpose devices, such as an Intel®, AMD®, or other standard microprocessor. The one or more processors 622 may include a special-purpose processing device, such as an ASIC, an SoC, an SiP, an FPGA, a PAL, a PLA, an FPLA, a PLD, or another customized or programmable device. The one or more processors 622 can perform distributed (e.g., parallel) processing to execute or otherwise implement functionalities of the presently disclosed embodiments. The one or more processors 622 may run a standard operating system and perform standard operating system functions. It is recognized that any standard operating system may be used, such as, for example, Microsoft® Windows®, Apple® MacOS®, Disk Operating System (DOS), UNIX, IRJX, Solaris, SunOS, FreeBSD, Linux®, ffiM® OS/2®, and so forth.
The memory 620 may include static RAM, dynamic RAM, flash memory, one or more flip-flops, ROM, CD-ROM, DVD, disk, tape, or magnetic, optical, or other computer storage medium. The memory 620 may include a plurality of program engines 628 and program data 636. The memory 620 may be local to the graph server 600, as shown, or may be distributed and/or remote relative to the graph server 600.
The program engines 628 may include all or portions of other elements of the graph server 100. The program engines 628 may run multiple operations concurrently or in parallel by or on the one or more processors 622. In some embodiments, portions of the disclosed engines, components, and/or facilities are embodied as executable instructions embodied in hardware or in firmware, or stored on a non-transitory, machine-readable storage medium, such as the memory 620. The instructions may comprise computer program code that, when executed by a processor and/or computing device, causes a computing system (such as the processors 622 and/or the graph server 600) to implement certain processing steps, procedures, and/or operations, as disclosed herein. The engines, modules, components, and/or facilities disclosed herein may be implemented and/or embodied as a driver, a library, an interface, an API, FPGA configuration data, firmware (e.g., stored on an EEPROM), and/or the like. In some embodiments, portions of the engines, components, and/or facilities disclosed herein are embodied as machine components, such as general and/or application-specific devices, including, but not limited to: circuits, integrated circuits, processing components, interface components, hardware controller(s), storage controller(s), programmable hardware, FPGAs, ASICs, and/or the like. Accordingly, the engines disclosed herein may be referred to as controllers, layers, services, modules, facilities, drivers, circuits, and/or the like.
The memory 620 may also include the program data 636. Data generated by the graph server 100, such as by the program engines 628 or other engines, may be stored on the memory 620, for example, as the stored program data 636. The stored program data 636 may be organized as one or more databases. In certain embodiments, the program data 636 may be stored in a database system. The database system may reside within the memory 620. In other embodiments, the program data 636 may be remote, such as in a distributed computing and/or storage environment. For example, the program data 636 may be stored in a database system on a remote computing device.
The input/output interface 626 may facilitate interfacing with one or more input devices and/or one or more output devices. The input device(s) may include a keyboard, mouse, touch screen, light pen, tablet, microphone, sensor, or other hardware with accompanying firmware and/or software. The output device(s) may include a monitor or other display, printer, speech or text synthesizer, switch, signal line, or other hardware with accompanying firmware and/or software.
The network interface 624 may facilitate communication with other computing devices and/or networks and/or other computing and/or communications networks. The network interface 624 may be equipped with conventional network connectivity, such as, for example, Ethernet (IEEE 802.3), Token Ring (IEEE 802.5), Fiber Distributed Datalink Interface (FDDI), or Asynchronous Transfer Mode (ATM). Further, the network interface 624 may be configured to support a variety of network protocols such as, for example, Internet Protocol (IP), Transfer Control Protocol (TCP), Network File System over UDP/TCP, Server Message Block (SMB), Microsoft® Common Internet File System (CIFS), Hypertext Transfer Protocols (HTTP), Direct Access File System (DAFS), File Transfer Protocol (FTP), Real-Time Publish Subscribe (RTPS), Open Systems Interconnection (OSI) protocols, Simple Mail Transfer Protocol (SMTP), Secure Shell (SSH), Secure Socket Layer (SSL), and so forth.
The system bus 621 may facilitate communication and/or interaction between the other components of the graph server 600, including the one or more processors 622, the memory 620, the input/output interface 626, and the network interface 624.
As noted, the graph server 600 also includes the various program engines 628 (or modules, elements, or components) to implement functionalities of the graph server 600, including a card handler engine 630, a templating engine 631, a graph engine 632, and/or a data store engine 634. These elements may be embodied, for example, at least partially in the program engines 628. In other embodiments, these elements may be embodied or otherwise implemented in hardware of the graph server 600. The graph server 600 also includes content data 638, cards data 639, outline data 640, theme data 641, and page code data 642 that may be stored in the program data 636 which may be generated, accessed, and/or manipulated by the program engines 628.
The card handler engine 630 is configured to resolve a web page request by accessing the content data 638, the cards data 639, and the outline data 640. The graph engine 632 is configured to provide the content data 638, the cards data 639, and/or the outline data 640 to the card handler engine 630. The graph engine 632 can retrieve the content data 638, the cards data 639, and/or the outline data 640 from the data store engine 634. The card handler engine 630 is also configured to request a template from the templating engine 631. The templating engine 631 is configured to generate the page code data 642 from the content data 638, the cards data 639, and the outline data 640. The templating engine 631 can provide the page code data 642 to the card handler engine 630.
Generating 754 the plurality of cards further comprises generating the plurality of cards to provide a presentational view of the nodes and associated content. Each of the plurality of cards can include a title field, a media field, a copy field, and a links field. The links field can correspond to the links.
Generating 752 the graph based on the profile further comprises accessing a plurality of rules, stored in the electronic memory, to generate the graph, wherein the plurality of rules to generate the graph are selected based on the profile. Selecting 756 the outline and the theme further comprises selecting the outline based on a plurality of rules, stored in the electronic memory, that correlate profiles to outlines and selecting the theme based on a plurality of rules, stored in the electronic memory, that correlate profiles to themes.
Generating 758 the page code further comprises generating data that is processed by a browser to generate a web page. The web server can receive the web page request for a web page. The web page request can comprise data that is used to generate the profile.
Associating 852 the profile can further comprise associating a user profile with the web page request. Associating 852 the profile can further comprise associating a device profile with the web page request. Generating 854 the graph can comprise generating a plurality of nodes that are connected by the links, wherein the plurality of nodes represent a plurality of entities and associated content of the web page generated based on the web page request. Generating 860 the web page can comprise organizing the plurality of entities and the associated content in the outline. Organizing the plurality of entities and the associated content in the outline can further comprise organizing the plurality of entities and the associated content in the outline while maintaining relationships between the plurality of entities as prescribed by the links. Generating 860 the web page can further comprise combining the outline and the theme in the web page.
The plurality of storage computing devices can comprise a plurality of different data stores with different syntaxes. Accessing 956 the content can further comprise providing a request, using a single syntax, for the content to an adapter system that communicates with the plurality of different data stores using a plurality of different syntaxes.
The above described features, operations, or characteristics may be arranged and designed in a wide variety of different configurations and/or combined in any suitable manner in one or more embodiments. Thus, the detailed description of the embodiments of the systems and methods is not intended to limit the scope of the disclosure, as claimed, but is merely representative of possible embodiments of the disclosure. In addition, it will also be readily understood that the order of the steps or actions of the methods described in connection with the embodiments disclosed may be changed as would be apparent to those skilled in the art. Thus, any order in the drawings or Detailed Description is for illustrative purposes only and is not meant to imply a required order, unless specified to require an order.
Embodiments may include various steps, which may be embodied in machine-executable instructions to be executed by a general-purpose or special-purpose computer (or other electronic device). Alternatively, the steps may be performed by hardware components that include specific logic for performing the steps, or by a combination of hardware, software, and/or firmware.
Embodiments may also be provided as a computer program product including a computer-readable storage medium having stored instructions thereon that may be used to program a computer (or other electronic device) to perform processes described herein. The computer-readable storage medium may include, but is not limited to: hard drives, floppy diskettes, optical disks, CD-ROMs, DVD-ROMs, ROMs, RAMs, EPROMs, EEPROMs, magnetic or optical cards, solid-state memory devices, or other types of media/machine-readable media suitable for storing electronic instructions.
As used herein, a software module or component may include any type of computer instruction or computer-executable code located within a memory device and/or computer-readable storage medium. A software module may, for instance, comprise one or more physical or logical blocks of computer instructions, which may be organized as a routine, program, object, component, data structure, etc., that performs one or more tasks or implements particular abstract data types.
In certain embodiments, a particular software module may comprise disparate instructions stored in different locations of a memory device, which together implement the described functionality of the module. Indeed, a module may comprise a single instruction or many instructions, and may be distributed over several different code segments, among different programs, and across several memory devices. Some embodiments may be practiced in a distributed computing environment where tasks are performed by a remote processing device linked through a communications network. In a distributed computing environment, software modules may be located in local and/or remote memory storage devices. In addition, data being tied or rendered together in a database record may be resident in the same memory device, or across several memory devices, and may be linked together in fields of a record in a database across a network.
It will be obvious to those having skill in the art that many changes may be made to the details of the above-described embodiments without departing from the underlying principles of the invention. The scope of the present invention should, therefore, be determined only by the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4992940 | Dworkin | Feb 1991 | A |
5421015 | Khoyi et al. | May 1995 | A |
5521815 | Rose, Jr. | May 1996 | A |
5649186 | Ferguson | Jul 1997 | A |
5694595 | Jacobs et al. | Dec 1997 | A |
5787177 | Leppek | Jul 1998 | A |
5790785 | Klug et al. | Aug 1998 | A |
5835712 | DuFresne | Nov 1998 | A |
5845299 | Arora et al. | Dec 1998 | A |
5862346 | Kley et al. | Jan 1999 | A |
5911145 | Arora et al. | Jun 1999 | A |
5956720 | Fernandez et al. | Sep 1999 | A |
5974149 | Leppek | Oct 1999 | A |
5974418 | Blinn et al. | Oct 1999 | A |
5974428 | Gerard et al. | Oct 1999 | A |
5978776 | Seretti et al. | Nov 1999 | A |
5987506 | Carter et al. | Nov 1999 | A |
6003635 | Bantz et al. | Dec 1999 | A |
6006201 | Berent et al. | Dec 1999 | A |
6009410 | LeMole et al. | Dec 1999 | A |
6018748 | Smith | Jan 2000 | A |
6021416 | Dauerer et al. | Feb 2000 | A |
6021426 | Douglis et al. | Feb 2000 | A |
6026433 | D'Arlach et al. | Feb 2000 | A |
6041310 | Green et al. | Mar 2000 | A |
6041344 | Bodamer et al. | Mar 2000 | A |
6055541 | Solecki et al. | Apr 2000 | A |
6061698 | Chadha et al. | May 2000 | A |
6067559 | Allard et al. | May 2000 | A |
6070164 | Vagnozzi | May 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6151609 | Truong | Nov 2000 | A |
6178432 | Cook et al. | Jan 2001 | B1 |
6185614 | Cuomo et al. | Feb 2001 | B1 |
6189104 | Leppek | Feb 2001 | B1 |
6219667 | Lu et al. | Apr 2001 | B1 |
6236994 | Swartz et al. | May 2001 | B1 |
6289382 | Bowman-Amuah | Sep 2001 | B1 |
6295061 | Park et al. | Sep 2001 | B1 |
6343302 | Graham | Jan 2002 | B1 |
6353824 | Boguraev et al. | Mar 2002 | B1 |
6374241 | Lamburt et al. | Apr 2002 | B1 |
6397226 | Sage | May 2002 | B1 |
6397336 | Leppek | May 2002 | B2 |
6401103 | Ho et al. | Jun 2002 | B1 |
6421733 | Tso et al. | Jul 2002 | B1 |
6473849 | Keller et al. | Oct 2002 | B1 |
6496855 | Hunt et al. | Dec 2002 | B1 |
6505205 | Kothuri et al. | Jan 2003 | B1 |
6519617 | Wanderski et al. | Feb 2003 | B1 |
6535879 | Behera | Mar 2003 | B1 |
6539370 | Chang et al. | Mar 2003 | B1 |
6546216 | Mizoguchi et al. | Apr 2003 | B2 |
6553373 | Boguraev et al. | Apr 2003 | B2 |
6556904 | Larson et al. | Apr 2003 | B1 |
6564216 | Waters | May 2003 | B2 |
6571253 | Thompson et al. | May 2003 | B1 |
6581061 | Graham | Jun 2003 | B2 |
6583794 | Wattenberg | Jun 2003 | B1 |
6594664 | Estrada et al. | Jul 2003 | B1 |
6606525 | Muthuswamy et al. | Aug 2003 | B1 |
6629148 | Ahmed et al. | Sep 2003 | B1 |
6643663 | Dabney et al. | Nov 2003 | B1 |
6654726 | Hanzek | Nov 2003 | B1 |
6678706 | Fishel | Jan 2004 | B1 |
6697825 | Underwood et al. | Feb 2004 | B1 |
6721747 | Lipkin | Apr 2004 | B2 |
6728685 | Ahluwalia | Apr 2004 | B1 |
6738750 | Stone et al. | May 2004 | B2 |
6785864 | Te et al. | Aug 2004 | B1 |
6795819 | Wheeler et al. | Sep 2004 | B2 |
6823258 | Ukai et al. | Nov 2004 | B2 |
6823359 | Heidingsfeld | Nov 2004 | B1 |
6826594 | Pettersen | Nov 2004 | B1 |
6847988 | Toyouchi et al. | Jan 2005 | B2 |
6871216 | Miller et al. | Mar 2005 | B2 |
6901430 | Smith | Mar 2005 | B1 |
6917941 | Wight et al. | Jul 2005 | B2 |
6922674 | Nelson | Jul 2005 | B1 |
6944677 | Zhao | Sep 2005 | B1 |
6963854 | Boyd et al. | Nov 2005 | B1 |
6965968 | Touboul | Nov 2005 | B1 |
6978273 | Bonneau et al. | Dec 2005 | B1 |
6981028 | Rawat et al. | Dec 2005 | B1 |
6990629 | Heaney et al. | Jan 2006 | B1 |
7000184 | Matveyenko et al. | Feb 2006 | B2 |
7028072 | Kliger et al. | Apr 2006 | B1 |
7031554 | Iwane | Apr 2006 | B2 |
7039704 | Davis et al. | May 2006 | B2 |
7047318 | Svedloff | May 2006 | B1 |
7062506 | Taylor et al. | Jun 2006 | B2 |
7072943 | Landesmann | Jul 2006 | B2 |
7107268 | Zawadzki et al. | Sep 2006 | B1 |
7124116 | Huyler | Oct 2006 | B2 |
7152207 | Underwood et al. | Dec 2006 | B1 |
7155491 | Schultz et al. | Dec 2006 | B1 |
7171418 | Blessin | Jan 2007 | B2 |
7197764 | Cichowlas | Mar 2007 | B2 |
7219234 | Ashland et al. | May 2007 | B1 |
7240125 | Fleming | Jul 2007 | B2 |
7246263 | Skingle | Jul 2007 | B2 |
7281029 | Rawat | Oct 2007 | B2 |
7322007 | Schowtka et al. | Jan 2008 | B2 |
7386786 | Davis et al. | Jun 2008 | B2 |
7401289 | Lachhwani et al. | Jul 2008 | B2 |
7433891 | Haber et al. | Oct 2008 | B2 |
7496543 | Bamford et al. | Feb 2009 | B1 |
7536641 | Rosenstein et al. | May 2009 | B2 |
7548985 | Guigui | Jun 2009 | B2 |
7587504 | Adams et al. | Sep 2009 | B2 |
7593925 | Cadiz et al. | Sep 2009 | B2 |
7624342 | Matveyenko et al. | Nov 2009 | B2 |
7657594 | Banga et al. | Feb 2010 | B2 |
7747680 | Ravikumar et al. | Jun 2010 | B2 |
7778841 | Bayer et al. | Aug 2010 | B1 |
7801945 | Geddes et al. | Sep 2010 | B1 |
7861309 | Spearman et al. | Dec 2010 | B2 |
7865409 | Monaghan | Jan 2011 | B1 |
7870253 | Muilenburg et al. | Jan 2011 | B2 |
7979506 | Cole | Jul 2011 | B2 |
8051159 | Muilenburg et al. | Nov 2011 | B2 |
8055544 | Ullman et al. | Nov 2011 | B2 |
8209259 | Graham, Jr. et al. | Jun 2012 | B2 |
8271473 | Berg | Sep 2012 | B2 |
8271547 | Taylor et al. | Sep 2012 | B2 |
8275717 | Ullman et al. | Sep 2012 | B2 |
8355950 | Colson et al. | Jan 2013 | B2 |
8438310 | Muilenburg et al. | May 2013 | B2 |
8521654 | Ford et al. | Aug 2013 | B2 |
8538894 | Ullman et al. | Sep 2013 | B2 |
8645193 | Swinson et al. | Feb 2014 | B2 |
8725341 | Ogasawara | May 2014 | B2 |
8849689 | Jagannathan et al. | Sep 2014 | B1 |
8886389 | Edwards et al. | Nov 2014 | B2 |
9754304 | Taira et al. | Sep 2017 | B2 |
9836714 | Lander et al. | Dec 2017 | B2 |
10032139 | Adderly et al. | Jul 2018 | B2 |
10083411 | Kinsey et al. | Sep 2018 | B2 |
20010005831 | Lewin et al. | Jun 2001 | A1 |
20010037332 | Miller | Nov 2001 | A1 |
20010039594 | Park et al. | Nov 2001 | A1 |
20010054049 | Maeda et al. | Dec 2001 | A1 |
20020023111 | Arora et al. | Feb 2002 | A1 |
20020024537 | Jones | Feb 2002 | A1 |
20020026359 | Long et al. | Feb 2002 | A1 |
20020032626 | DeWolf et al. | Mar 2002 | A1 |
20020032701 | Gao et al. | Mar 2002 | A1 |
20020042738 | Srinivasan et al. | Apr 2002 | A1 |
20020046245 | Hillar et al. | Apr 2002 | A1 |
20020049831 | Platner et al. | Apr 2002 | A1 |
20020059260 | Jas | May 2002 | A1 |
20020065739 | Florance et al. | May 2002 | A1 |
20020069110 | Sonnenberg | Jun 2002 | A1 |
20020073080 | Lipkin | Jun 2002 | A1 |
20020082978 | Ghouri et al. | Jun 2002 | A1 |
20020091755 | Narin | Jul 2002 | A1 |
20020107739 | Schlee | Aug 2002 | A1 |
20020111727 | Vanstory et al. | Aug 2002 | A1 |
20020111844 | Vanstory et al. | Aug 2002 | A1 |
20020116418 | Lachhwani et al. | Aug 2002 | A1 |
20020123359 | Wei et al. | Sep 2002 | A1 |
20020124053 | Adams et al. | Sep 2002 | A1 |
20020129054 | Ferguson et al. | Sep 2002 | A1 |
20020138331 | Hosea et al. | Sep 2002 | A1 |
20020143646 | Boyden et al. | Oct 2002 | A1 |
20020154146 | Rodriquez et al. | Oct 2002 | A1 |
20020169851 | Weathersby et al. | Nov 2002 | A1 |
20020196273 | Krause | Dec 2002 | A1 |
20020198761 | Ryan et al. | Dec 2002 | A1 |
20020198878 | Baxter et al. | Dec 2002 | A1 |
20030014443 | Bernstein et al. | Jan 2003 | A1 |
20030023632 | Ries et al. | Jan 2003 | A1 |
20030033378 | Needham et al. | Feb 2003 | A1 |
20030036832 | Kokes et al. | Feb 2003 | A1 |
20030036964 | Boyden et al. | Feb 2003 | A1 |
20030037263 | Kamat et al. | Feb 2003 | A1 |
20030046179 | Anabtawi et al. | Mar 2003 | A1 |
20030051022 | Sogabe et al. | Mar 2003 | A1 |
20030061263 | Riddle | Mar 2003 | A1 |
20030065532 | Takaoka | Apr 2003 | A1 |
20030069785 | Lohse | Apr 2003 | A1 |
20030069790 | Kane | Apr 2003 | A1 |
20030074392 | Campbell et al. | Apr 2003 | A1 |
20030115292 | Griffin et al. | Jun 2003 | A1 |
20030120502 | Robb et al. | Jun 2003 | A1 |
20030145310 | Thames et al. | Jul 2003 | A1 |
20030177050 | Crampton et al. | Sep 2003 | A1 |
20030177175 | Worley et al. | Sep 2003 | A1 |
20030225853 | Wang et al. | Dec 2003 | A1 |
20030229623 | Chang et al. | Dec 2003 | A1 |
20030233246 | Snapp et al. | Dec 2003 | A1 |
20040012631 | Skorski | Jan 2004 | A1 |
20040039646 | Hacker | Feb 2004 | A1 |
20040041818 | White et al. | Mar 2004 | A1 |
20040073546 | Forster et al. | Apr 2004 | A1 |
20040073564 | Haber et al. | Apr 2004 | A1 |
20040088228 | Mercer et al. | May 2004 | A1 |
20040117046 | Colle et al. | Jun 2004 | A1 |
20040128320 | Grove et al. | Jul 2004 | A1 |
20040139203 | Graham, Jr. et al. | Jul 2004 | A1 |
20040148342 | Cotte | Jul 2004 | A1 |
20040156020 | Edwards | Aug 2004 | A1 |
20040163047 | Nagahara et al. | Aug 2004 | A1 |
20040181464 | Vanker et al. | Sep 2004 | A1 |
20040199413 | Hauser et al. | Oct 2004 | A1 |
20040220863 | Porter et al. | Nov 2004 | A1 |
20040225664 | Casement | Nov 2004 | A1 |
20040230897 | Latzel | Nov 2004 | A1 |
20040255233 | Croney et al. | Dec 2004 | A1 |
20040267263 | May | Dec 2004 | A1 |
20040268225 | Walsh et al. | Dec 2004 | A1 |
20040268232 | Tunning | Dec 2004 | A1 |
20050015491 | Koeppel | Jan 2005 | A1 |
20050065804 | Worsham et al. | Mar 2005 | A1 |
20050096963 | Myr et al. | May 2005 | A1 |
20050108112 | Ellenson et al. | May 2005 | A1 |
20050114270 | Hind et al. | May 2005 | A1 |
20050114764 | Gudenkauf et al. | May 2005 | A1 |
20050108637 | Sahota et al. | Jun 2005 | A1 |
20050171836 | Leacy | Aug 2005 | A1 |
20050187834 | Painter et al. | Aug 2005 | A1 |
20050228736 | Norman et al. | Oct 2005 | A1 |
20050267774 | Merritt et al. | Dec 2005 | A1 |
20050268282 | Laird | Dec 2005 | A1 |
20050289020 | Bruns et al. | Dec 2005 | A1 |
20050289599 | Matsuura et al. | Dec 2005 | A1 |
20060031811 | Ernst et al. | Feb 2006 | A1 |
20060059253 | Goodman et al. | Mar 2006 | A1 |
20060064637 | Rechterman et al. | Mar 2006 | A1 |
20060123330 | Horiuchi et al. | Jun 2006 | A1 |
20060129423 | Sheinson et al. | Jun 2006 | A1 |
20060129982 | Doyle | Jun 2006 | A1 |
20060136105 | Larson | Jun 2006 | A1 |
20060161841 | Horiuchi et al. | Jul 2006 | A1 |
20060200751 | Underwood et al. | Sep 2006 | A1 |
20060248442 | Rosenstein et al. | Nov 2006 | A1 |
20060265355 | Taylor | Nov 2006 | A1 |
20060271844 | Suklikar | Nov 2006 | A1 |
20060277588 | Harrington et al. | Dec 2006 | A1 |
20070005446 | Fusz et al. | Jan 2007 | A1 |
20070016486 | Stone et al. | Jan 2007 | A1 |
20070033520 | Kimzey et al. | Feb 2007 | A1 |
20070053513 | Hoffberg | Mar 2007 | A1 |
20070150368 | Arora et al. | Jun 2007 | A1 |
20070209011 | Padmanabhuni et al. | Sep 2007 | A1 |
20070250327 | Hedy | Oct 2007 | A1 |
20070271154 | Broudy et al. | Nov 2007 | A1 |
20070271330 | Mattox et al. | Nov 2007 | A1 |
20070271389 | Joshi et al. | Nov 2007 | A1 |
20070282711 | Ullman et al. | Dec 2007 | A1 |
20070282712 | Ullman et al. | Dec 2007 | A1 |
20070282713 | Ullman et al. | Dec 2007 | A1 |
20070288413 | Mizuno et al. | Dec 2007 | A1 |
20070294192 | Tellefsen | Dec 2007 | A1 |
20080015929 | Koeppel et al. | Jan 2008 | A1 |
20080027827 | Eglen et al. | Jan 2008 | A1 |
20080172632 | Stambaugh | Jul 2008 | A1 |
20080189143 | Wurster | Aug 2008 | A1 |
20080195435 | Bentley et al. | Aug 2008 | A1 |
20080195932 | Oikawa et al. | Aug 2008 | A1 |
20080201163 | Barker et al. | Aug 2008 | A1 |
20090012887 | Taub et al. | Jan 2009 | A1 |
20090024918 | Silverbrook et al. | Jan 2009 | A1 |
20090043780 | Hentrich, Jr. et al. | Feb 2009 | A1 |
20090070435 | Abhyanker | Mar 2009 | A1 |
20090089134 | Uyeki | Apr 2009 | A1 |
20090106036 | Tamura et al. | Apr 2009 | A1 |
20090112687 | Blair et al. | Apr 2009 | A1 |
20090182232 | Zhang et al. | Jul 2009 | A1 |
20090204454 | Lagudi | Aug 2009 | A1 |
20090222532 | Finlaw | Sep 2009 | A1 |
20090265607 | Raz et al. | Oct 2009 | A1 |
20090313035 | Esser et al. | Dec 2009 | A1 |
20100082778 | Muilenburg et al. | Apr 2010 | A1 |
20100082780 | Muilenburg et al. | Apr 2010 | A1 |
20100088158 | Pollack | Apr 2010 | A1 |
20100100506 | Marot | Apr 2010 | A1 |
20100293030 | Wu | Nov 2010 | A1 |
20100312608 | Shan et al. | Dec 2010 | A1 |
20100318408 | Sankaran et al. | Dec 2010 | A1 |
20100324777 | Tominaga et al. | Dec 2010 | A1 |
20110010432 | Uyeki | Jan 2011 | A1 |
20110022525 | Swinson et al. | Jan 2011 | A1 |
20110082804 | Swinson et al. | Apr 2011 | A1 |
20110145064 | Anderson et al. | Jun 2011 | A1 |
20110161167 | Jallapuram | Jun 2011 | A1 |
20110191264 | Inghelbrecht et al. | Aug 2011 | A1 |
20110196762 | DuPont | Aug 2011 | A1 |
20110224864 | Gellatly et al. | Sep 2011 | A1 |
20110307411 | Bolivar et al. | Dec 2011 | A1 |
20120089474 | Xiao et al. | Apr 2012 | A1 |
20120209714 | Douglas et al. | Aug 2012 | A1 |
20120221125 | Bell | Aug 2012 | A1 |
20120278886 | Q | Nov 2012 | A1 |
20130046432 | Edwards et al. | Feb 2013 | A1 |
20130080196 | Schroeder et al. | Mar 2013 | A1 |
20130332023 | Bertosa et al. | Dec 2013 | A1 |
20140026037 | Garb | Jan 2014 | A1 |
20140088866 | Knapp et al. | Mar 2014 | A1 |
20140094992 | Lambert et al. | Apr 2014 | A1 |
20140229391 | East et al. | Aug 2014 | A1 |
20140278805 | Thompson | Sep 2014 | A1 |
20140324275 | Stanek et al. | Oct 2014 | A1 |
20140337163 | Whisnant | Nov 2014 | A1 |
20140379530 | Kim et al. | Dec 2014 | A1 |
20150057875 | McGinnis et al. | Feb 2015 | A1 |
20150066781 | Johnson et al. | Mar 2015 | A1 |
20150100199 | Kurnik et al. | Apr 2015 | A1 |
20150278886 | Fusz | Oct 2015 | A1 |
20150286979 | Ming et al. | Oct 2015 | A1 |
20160071054 | Kakarala et al. | Mar 2016 | A1 |
20160140622 | Wang | May 2016 | A1 |
20160148439 | Akselrod et al. | May 2016 | A1 |
20170124525 | Johnson et al. | May 2017 | A1 |
20170308844 | Kelley | Oct 2017 | A1 |
20170308864 | Kelley | Oct 2017 | A1 |
20170308865 | Kelley | Oct 2017 | A1 |
20180285901 | Zackrone | Oct 2018 | A1 |
20180285925 | Zackrone | Oct 2018 | A1 |
Entry |
---|
Non-Final Office Action dated Oct. 6, 2017 in U.S. Appl. No. 13/025,019. |
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Jan. 11, 2019 , 16 pgs. |
“NetFormx Offers Advanced Network Discovery Software”. PR Newswire. Mar. 15, 1999. Retrieved from http://www.highbeam.com/doc/1G1-54102907.html>. |
Advisory Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Jul. 12, 2018. |
Anonymous, “Software ready for prime time.” Automotive News. Detroit, Nov. 5, 2001. vol. 76, Issue 5996, p. 28. |
Chen, Deren, “Business to Business Standard and Supply Chain System Framework in Virtual Enterprises,” Computer Supported Cooperative Work in Design, The Sixth International Conference on, 2001; Publication Year: 2001, pgs. 472-476. |
CNY Business Journal, “Frank La Voila named Southern Tier Small-Business Person of 1999”. Jun. 11, 1999. 2 pgs. |
Dallas Morning News, “I know someone who knows Kevin Bacon”. Oct. 27, 1998. 4 pgs. |
Davis, Peter T. et al., “Sams Teach Yourself Microsoft Windows NT Server 4 in 21 Days,” Sams® Publishing, © 1999. ISBN: 0-672-31555-6, 15 pgs., printed Dec. 21, 2008. |
Derfler, Frank J. et al., “How Networks Work: Millennium Edition,” Que, A Division of Macmillan Computer Publishing, © 2000. ISBN: 0-7897-2445-6, 9 pgs. |
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Mar. 3, 2010, 24 pgs. |
Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and dated from the USPTO dated May 5, 2005, 8 pgs. |
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and dated from the USPTO dated Jun. 26, 2012, 11 pgs. |
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Jul. 13, 2018, 11 pgs. |
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 20, 2011, and dated from the USPTO dated Dec. 20, 2016, 16 pgs. |
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Apr. 16, 2018. |
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Dec. 6, 2016, 26 pgs. |
Final Office Action dated Sep. 21, 2018 in U.S. Appl. No. 15/134,820. |
http://web.archive.org/web/20010718130244/http://chromedata.com/maing2/about/index.asp, 1 pg. |
http://web.archive.org/web/20050305055408/http://www.dealerclick.com/, 1 pg. |
http://web.archive.org/web/20050528073821/http://www.kbb.com/, 1 pg. |
http://web.archive.org/web/20050531000823/http://www.carfax.com/, 1 pg. |
IBM Tivoli Access Manager Base Administration Guide, Version 5.1.2003, International Business Machines Corporation. Entire book enclosed and cited. 402 pgs. |
Interconnection. (2003). In Roget's II The New Thesaurus. Boston, MA: Houghton Mifflin. Retrieved Jul. 16, 2009, from http://www.credoreference.com/entry/hmrogets/interconnection, 1 pg. |
Java 2 Platform, Enterprise Edition (J2EE) Overview, printed Mar. 6, 2010, 3 pgs. |
Java version history—Wkipedia, the free encyclopedia, printed Mar. 6, 2010, 9 pgs. |
Michener, J.R., et al., “Managing System and Active-Content Integrity,” Computer; vol. 33, Issue: 7; Publication Year: 2000, pp. 108-110. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Dec. 26, 2008, 13 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Feb. 6, 2006, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Jul. 22, 2009, 22 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Jun. 29, 2006, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Mar. 12, 2007, 10 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated May 29, 2008, 10 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Nov. 1, 2010, 19 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and dated from the USPTO dated May 19, 2005, 7 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and dated from the USPTO dated Jul. 27, 2004, 9 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and dated from the USPTO dated Dec. 19, 2005, 8 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and dated from the USPTO dated May 17, 2004, 6 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Sep. 17, 2007, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and dated from the USPTO dated Jul. 19, 2010, 7 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and dated from the USPTO dated Mar. 9, 2010, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and dated from the USPTO dated Nov. 27, 2009, 24 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and dated from the USPTO dated Nov. 14, 2011, 19 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and dated from the USPTO dated Aug. 10, 2011, 18 pgs. |
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Jun. 30, 2016, 23 pgs. |
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Sep. 20, 2017. |
Non-Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and dated from the USPTO dated Sep. 21, 2018. |
Non-Final Office Action for U.S. Appl. No. 15/134,820, filed Apr. 21, 2016, and dated from the USPTO dated Feb. 23, 2018. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated May 7, 2012, 15 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and dated from the USPTO dated Feb. 1, 2006, 5 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and dated from the USPTO dated Sep. 21, 2005, 4 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and dated from the USPTO dated Apr. 4, 2006, 12 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/414,939, filed May 1, 2006, and dated from the USPTO dated Nov. 2, 2010, pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and dated from the USPTO dated Aug. 9, 2011, 10 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and dated from the USPTO dated Aug. 6, 2013, 22 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and dated from the USPTO dated Jul. 23, 2012, 19 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and dated from the USPTO dated Oct. 28, 2010, 5 pgs. |
Notice of Non-compliant Amendment dated Dec. 12, 2006 in U.S. Appl. No. 10/350,810. |
Permissions in the Java™ 2 SDK, printed Mar. 6, 2010, 45 pgs. |
Strebe, Matthew et al. MCSE: NT Server 4 Study Guide, Third Edition. 2000, SYBEX Inc. Front mater, pp. 284-293, and 308-347 are included. Entire book cited, 36 pgs. |
Trademark Electronic Search System record for Serial No. 76375405, Word Mark “NITRA”. |
Lee, Adam J. et al., “Searching for Open Windows and Unlocked Doors: Port Scanning in Large-Scale Commodity Clusters,” Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on vol. 1; Publication Year: 2005,, pp. 146-151 vol. 1. |
Non-Final Office Action for U.S. Appl. No. 15/134,779, filed Apr. 21, 2016, and dated from the USPTO dated Jan. 30, 2019, 26 pgs. |
Non-Final Office Action received in U.S. Appl. No. 15/134,793, filed Apr. 21, 2016, dated by United States Patent and Trademark Office dated Jan. 30, 2019, 26 pgs. |
“An Appointment with Destiny—The Time for Web-Enabled Scheduling has Arrived”, Link Fall, 2007, 2 pages. |
“How a Solution found a Problem of Scheduling Service Appointments”, Automotive News, 2016, 4 pages. |
“Service Advisor”, Automotive Dealership Institute, 2007, 26 pages. |
“xTime.com Web Pages”, Jan. 8, 2015, 1 page. |
“xTimes Newsletter”, vol. 7, 2013, 4 pages. |
U.S. Appl. No. 15/134,820, Notice of Allowance, dated Jan. 28, 2019, 7 pages. |
Croswell, “Service Shop Optimiztion”, Modern Tire Retailer, May 21, 2013, 7 pages. |
Emmanuel, “Basics to Creating an Appointment System for Automotive Service Customers”, Automotiveservicemanagement.com, 2006, 9 pages. |
Aloisio, Giovanni et al., “Web-based access to the Grid using the Grid Resource Broker portal,” Google 2002, pp. 1145-1160. |
Chadwick, D. W., “Understanding X.500—The Directory.” Available at <http://sec.cs.kent.ac.uk/x500book/>. 1996. Entire work cited. |
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and dated from the USPTO dated Jul. 6, 2011, 26 pgs. |
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Apr. 5, 2005, 12 pgs. |
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated May 18, 2006, 15 pgs. |
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Nov. 14, 2007, 13 pgs. |
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Feb. 24, 2010, 22 pgs. |
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Jul. 7, 2008, 11 pgs. |
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Mar. 8, 2011, 21 pgs. |
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated May 11, 2009, 14 pgs. |
Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and dated from the USPTO dated Feb. 4, 2009, 14 pgs. |
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Apr. 7, 2009, 19 pgs. |
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated May 21, 2010, 28 pgs. |
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Nov. 29, 2011, 26 pgs. |
Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and dated from the USPTO dated Jun. 8, 2010, 12 pgs. |
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and dated from the USPTO dated Jul. 27, 2010, 13 pgs. |
Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and dated from the USPTO dated Aug. 3, 2010, 16 pgs. |
Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Oct. 24, 2011, 13 pgs. |
Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and dated from the USPTO dated Jun. 22, 2011, 5 pgs. |
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Aug. 28, 2015, 25 pgs. |
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Dec. 20, 2016, 16 pgs. |
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Sep. 12, 2013, 13 pgs. |
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” ACM 2005, pp. 86-95. |
Housel, Barron C. et al., “WebExpress: A client/intercept based system for optimizing Web browsing in a wireless environment,” Google 1998, pp. 419-431. |
Internet Archive Wayback Machine, archive of LDAP Browser.com—FAQ. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110152/http://www.Idapbrowser.com/faq/faq.php3?slD=fe4ae66f023d86909f35e974f3a1ce>. |
Internet Archive Wayback Machine, archive of LDAP Browser.com—Product Info. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110541/http://www.Idapbrowser.com/prodinfo/prodinfo.php3?sID=fe4ae66f2fo23d86909f35e974f3a1ce>. |
Internet Archive: Audio Archive, http://www.archive.org/audio/audio-searchresults.php?search=@start=0&limit=100&sort=ad, printed May 12, 2004, 12 pgs. |
Internet Archive: Democracy Now, http://www.archive.org/audio/collection.php?collection=democracy_now, printed May 12, 2004, 2 pgs. |
Milic-Frayling, Natasa, et al., “SmartView: Enhanced Document Viewer for Mobile Devices,” Google Nov. 15, 2002, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Apr. 17, 2007, 12 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Dec. 9, 2005, 14 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Sep. 22, 2004, 10 pgs. |
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and dated from the USPTO dated Dec. 19, 2005, 7 pgs. |
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and dated from the USPTO dated May 17, 2004, 5 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Aug. 30, 2010, 23 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Nov. 13, 2008, 11 pgs. |
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and dated from the USPTO dated Sep. 14, 2009, 14 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and dated from the USPTO dated May 13, 2008, 14 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and dated from the USPTO dated May 6, 2009, 6 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Jun. 1, 2011, 23 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Nov. 12, 2009, 19 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Sep. 3, 2008, 14 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and dated from the USPTO dated Mar. 1, 2011, 15 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and dated from the USPTO dated Nov. 27,2009, 14 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and dated from the USPTO dated Dec. 11, 2009, 20 pgs. |
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and dated from the USPTO dated Dec. 16, 2009, 20 pgs. |
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Jan. 16, 2013, 5 pgs. |
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Mar. 17, 2011, 8 pgs. |
Non-Final Office Action for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and dated from the USPTO dated Oct. 14, 2010, 6 pgs. |
Non-Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and dated from the USPTO dated Nov. 8, 2010, 8 pgs. |
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Apr. 22, 2016, 16 pgs. |
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Apr. 5, 2013, 15 pgs. |
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and dated from the USPTO dated Sep. 18, 2014, 15 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and dated from the USPTO dated Apr. 14, 2008, 6 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and dated from the USPTO dated Apr. 4, 2006, 8 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and dated from the USPTO dated Sep. 16, 2009, 7 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/442,821, filed May 30, 2006, and dated from the USPTO dated Jul. 30, 2012, 6 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Feb. 27, 2013, 6 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and dated from the USPTO dated Nov. 22, 2010, 8 pgs. |
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and dated from the USPTO dated Sep. 6, 2011, 10 pgs. |
Restriction Requirement for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Dec. 7, 2010. |
Supplemental Notice of Allowability for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and dated from the USPTO dated Mar. 19, 2013, 3 pgs. |
Number | Date | Country | |
---|---|---|---|
20180341628 A1 | Nov 2018 | US |