US 7,386,477 B2Grant
Location-based filtering for a shopping agent in the physical world
Issue Date:2008-06-10
•50 Claims
•29 Drawing Sheets
Abstract
An agent based system utilizes a Personal Digital Assistant (PDA)-based, Global Positioning System (GPS)-enabled information gathering agent that relies on knowledge of a shopper's physical location to support a shopping task while shopping at a mall. Shoppers indicate their shopping goals to the system. Then, as shoppers stroll through a mall, the system informs them of the availability of items of interest to them available in the immediately surrounding stores, as well as any cheaper local alternatives.
Metadata
Assignee
- Accenture LLP
Inventor
- Andrew Ernest Fano
Application Information
Application Number:US 09/975,460
Filing Date:2001-10-10
Priority Date:1999-02-26
Art Unit:3628
Classifications
IPC:
G06Q30/00G06Q10/00G06F17/00G06G7/00
Patent Drawings (29 sheets)
Description
[0001] This application is a continuation of application Ser. No. 09/259,902, filed Feb. 26, 1999, now U.S. Pat. No. 6,317,718, issued Nov. 13, 2001, which is hereby incorporated by reference herein.
FIELD OF THE INVENTION
[0002] The present invention relates generally to information gathering agents and more specifically to a shopping agent that incorporates the physical location of the user into the information gathering process.
BACKGROUND OF THE INVENTION
[0003] Agent based technology has become increasingly important for use with applications designed to interact with a user for performing various computer based tasks in foreground and background modes. Agent software comprises computer programs that are set on behalf of users to perform routine, tedious and time-consuming tasks. To be useful to an individual user, an agent must be personalized to the individual user's goals, habits and preferences. Thus, there exists a substantial requirement for the agent to efficiently and effectively acquire user-specific knowledge from the user and utilize it to perform tasks on behalf of the user.
[0004] The concept of agency, or the user of agents, is well established. An agent is a person authorized by another person, typically referred to as a principal, to act on behalf of the principal. In this manner the principal empowers the agent to perform any of the tasks that the principal is unwilling or unable to perform. For example, an insurance agent may handle all of the insurance requirements for a principal, or a talent agent may act on behalf of a performer to arrange concert dates.
[0005] With the advent of the computer, a new domain for employing agents has arrived. Significant advances in the realm of expert systems enable computer programs to act on behalf of computer users to perform routine, tedious and other time-consuming tasks. These computer programs are referred to as “software agents.”
[0006] Moreover, there has been a recent proliferation of computer and communication networks. These networks permit a user to access vast amounts of information and services without, essentially, any geographical boundaries. Thus, a software agent has a rich environment to perform a large number of tasks on behalf of a user. For example, it is now possible for an agent to make an airline reservation, purchase the ticket, and have the ticket delivered directly to a user. Similarly, an agent could scan the Internet and obtain information ranging from the latest sports or news to a particular graduate thesis in applied physics. Current solutions fail to apply agent technology to existing calendar technology to provide targeted acquisition of background information for a user's upcoming events.
[0007] A central issue for developing agents of all types is identifying easily computed features that are either very suggestive of the user's preferences and goals or can somehow be used to constrain the task of the agent. Keyword-based approaches are commonly used. For example, users may be asked to specify keywords to explicitly identify their goals, or keywords and key phrases may be extracted from user data. Collaborative filtering, another technique, involves extending user specified preferences by incorporating those of other users whose preferences overlap. The demographic generalization method involves classifying a user using minimal user input into demographic categories with well-understood preferences. These techniques are all intended to infer as much as possible about a user's goals and preferences based on observable features, while minimizing the need for user input. These web agents have not used physical location as a predictive feature because the locations from which users access the web have largely remained constant—typically their home or office. Moreover, location has not been a particularly easy feature to compute and unambiguously communicate to an agent.
[0008] Location has, of course, played a significant role in other areas research. Navigation, most obviously, has relied on the ability to detect and monitor location. Recent work on supporting user mobility in which personalized computing environments follow users to remote locations also rely on knowledge of a user's location. In these cases, however, location is the problem. That is, a vehicle must be guided from one point to another, or a computing environment must be replicated at a remote location. The ParcTab based “location browser”, which displays file directories and runs programs associated with particular rooms in an office, is somewhat similar in its use of location-awareness as a means of capturing the user's context.
[0009] However, the explosive growth in the use of laptops and Personal Digital Assistants (PDAs) signals an important change. As we begin to find ourselves bringing our PDAs and laptops everywhere we go, the particular locations we use them will increasingly reflect an important part of our current context. Furthermore, a user's precise location can now be passively and unambiguously obtained by software through the use of Global Positioning System (GPS) receivers. Such receivers are becoming increasingly affordable and compact. Some are now available as PCMCIA cards. In a system in accordance with a preferred embodiment, the user's location is used in a very different way. Rather than defining the problem, the user's location is a crucial piece of data that can be used to inform and constrain the information gathering task. There is now a business and consumer need to enhance the effectiveness of shoppers through the utilization of location information.
SUMMARY OF THE INVENTION
[0010] According to a broad aspect of a preferred embodiment of the invention, an agent based system an information gathering agent that exploits the physical location of the user. An agent running on a Personal Digital Assistant (PDA) equipped with a Global Positions System (GPS) receiver, supports location targeted shopping in an outdoor mall. The agent assists shoppers by providing information about merchandise in which the shopper has expressed an interest. As a shopper strolls through a mall, the system alerts the shopper to merchandise of previously specified categories in the surrounding stores, as well as any cheaper alternatives in the local area. A system in accordance with a preferred embodiment utilizes the user's precise physical location to filter the information it presents.
DESCRIPTION OF THE DRAWINGS
[0011] The foregoing and other objects, aspects and advantages are better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawings, in which:
[0012] FIG. 1 is a block diagram of a representative hardware environment in accordance with a preferred embodiment;
[0013] FIG. 2 is a flowchart of the system in accordance with a preferred embodiment;
[0014] FIG. 3 is a flowchart of a parsing unit of the system in accordance with a preferred embodiment;
[0015] FIG. 4 is a flowchart for pattern matching in accordance with a preferred embodiment;
[0016] FIG. 5 is a flowchart for a search unit in accordance with a preferred embodiment;
[0017] FIG. 6 is a flowchart for overall system processing in accordance with a preferred embodiment;
[0018] FIG. 7 is a flowchart of topic processing in accordance with a preferred embodiment;
[0019] FIG. 8 is a flowchart of meeting record processing in accordance with a preferred embodiment;
[0020] FIG. 9 is a block diagram of process flow of a pocket bargain finder in accordance with a preferred embodiment;
[0021] FIGS. 10A and 10B are a block diagram and flowchart depicting the logic associated with creating a customized content web page in accordance with a preferred embodiment;
[0022] FIG. 11 is a flowchart depicting the detailed logic associated with retrieving user-centric content in accordance with a preferred embodiment;
[0023] FIG. 12 is a data model of a user profile in accordance with a preferred embodiment;
[0024] FIG. 13 is a persona data model in accordance with a preferred embodiment;
[0025] FIG. 14 is an intention data model in accordance with a preferred embodiment;
[0026] FIG. 15 is a flowchart of the processing for generating an agent's current statistics in accordance with a preferred embodiment;
[0027] FIG. 16 is a flowchart of the logic that determines the personalized product rating for a user in accordance with a preferred embodiment;
[0028] FIG. 17 is a flowchart of the logic for accessing the centrally stored profile in accordance with a preferred embodiment;
[0029] FIG. 18 is a flowchart of the interaction logic between a user and the integrator for a particular supplier in accordance with a preferred embodiment;
[0030] FIG. 19 is a flowchart of the agent processing for generating a verbal summary in accordance with a preferred embodiment;
[0031] FIG. 20 illustrates a display login in accordance with a preferred embodiment;
[0032] FIG. 21 illustrates a managing daily logistics display in accordance with a preferred embodiment;
[0033] FIG. 22 illustrates a user main display in accordance with a preferred embodiment;
[0034] FIG. 23 illustrates an agent interaction display in accordance with a preferred embodiment;
[0035] FIG. 24 is a block diagram of an active knowledge management system in accordance with a preferred embodiment;
[0036] FIG. 25 is a block diagram of a back end server in accordance with a preferred embodiment; and
[0037] FIG. 26 is a block diagram of a magic wall in accordance with a preferred embodiment; and
[0038] FIG. 27 illustrates a display of the browser mode in accordance with a preferred embodiment.
DETAILED DESCRIPTION
[0039] A preferred embodiment of a system in accordance with the present invention is preferably practiced in the context of a personal computer such as an IBM compatible personal computer, Apple Macintosh computer or UNIX based workstation. A representative hardware environment is depicted in FIG. 1 , which illustrates a typical hardware configuration of a workstation in accordance with a preferred embodiment having a central processing unit 110, such as a microprocessor, and a number of other units interconnected via a system bus 112. The workstation shown in FIG. 1 includes a Random Access Memory (RAM) 114, Read Only Memory (ROM) 116, an I/O adapter 118 for connecting peripheral devices such as disk storage units 120 to the bus 112, a user interface adapter 122 for connecting a keyboard 124, a mouse 126, a speaker 128, a microphone 132, and/or other user interface devices such as a touch screen (not shown) to the bus 112, communication adapter 134 for connecting the workstation to a communication network (e.g., a data processing network) and a display adapter 136 for connecting the bus 112 to a display device 138. The workstation typically has resident thereon an operating system such as the Microsoft Windows NT or Windows/95 Operating System (OS), the IBM OS/2 operating system, the MAC OS, or UNIX operating system. Those skilled in the art will appreciate that the present invention may also be implemented on platforms and operating systems other than those mentioned. A preferred embodiment is written using JAVA, C, and the C++ language and utilizes object oriented programming methodology. Object oriented programming (OOP) has become increasingly used to develop complex applications. As OOP moves toward the mainstream of software design and development, various software solutions require adaptation to make use of the benefits of OOP. A need exists for these principles of OOP to be applied to a messaging interface of an electronic messaging system such that a set of OOP classes and objects for the messaging interface can be provided.
[0040] OOP is a process of developing computer software using objects, including the steps of analyzing the problem, designing the system, and constructing the program. An object is a software package that contains both data and a collection of related structures and procedures. Since it contains both data and a collection of structures and procedures, it can be visualized as a self-sufficient component that does not require other additional structures, procedures or data to perform its specific task. OOP, therefore, views a computer program as a collection of largely autonomous components, called objects, each of which is responsible for a specific task. This concept of packaging data, structures, and procedures together in one component or module is called encapsulation.
[0041] In general, OOP components are reusable software modules which present an interface that conforms to an object model and which are accessed at run-time through a component integration architecture. A component integration architecture is a set of architecture mechanisms which allow software modules in different process spaces to utilize each others capabilities or functions. This is generally done by assuming a common component object model on which to build the architecture.
[0042] It is worthwhile to differentiate between an object and a class of objects at this point. An object is a single instance of the class of objects, which is often just called a class. A class of objects can be viewed as a blueprint, from which many objects can be formed.
[0043] OOP allows the programmer to create an object that is a part of another object. For example, the object representing a piston engine is said to have a composition-relationship with the object representing a piston. In reality, a piston engine comprises a piston, valves and many other components; the fact that a piston is an element of a piston engine can be logically and semantically represented in OOP by two objects.
[0044] OOP also allows creation of an object that “depends from” another object. If there are two objects, one representing a piston engine and the other representing a piston engine wherein the piston is made of ceramic, then the relationship between the two objects is not that of composition. A ceramic piston engine does not make up a piston engine. Rather it is merely one kind of piston engine that has one more limitation than the piston engine; its piston is made of ceramic. In this case, the object representing the ceramic piston engine is called a derived object, and it inherits all of the aspects of the object representing the piston engine and adds further limitation or detail to it. The object representing the ceramic piston engine “depends from” the object representing the piston engine. The relationship between these objects is called inheritance.
[0045] When the object or class representing the ceramic piston engine inherits all of the aspects of the objects representing the piston engine, it inherits the thermal characteristics of a standard piston defined in the piston engine class. However, the ceramic piston engine object overrides these ceramic specific thermal characteristics, which are typically different from those associated with a metal piston. It skips over the original and uses new functions related to ceramic pistons. Different kinds of piston engines have different characteristics, but may have the same underlying functions associated with it (e.g., how many pistons in the engine, ignition sequences, lubrication, etc.). To access each of these functions in any piston engine object, a programmer would call the same functions with the same names, but each type of piston engine may have different/overriding implementations of functions behind the same name. This ability to hide different implementations of a function behind the same name is called polymorphism and it greatly simplifies communication among objects.
[0046] With the concepts of composition-relationship, encapsulation, inheritance and polymorphism, an object can represent just about anything in the real world. In fact, our logical perception of the reality is the only limit on determining the kinds of things that can become objects in object-oriented software. Some typical categories are as follows:
-
- [0047] Objects can represent physical objects, such as automobiles in a traffic-flow simulation, electrical components in a circuit-design program, countries in an economics model, or aircraft in an air-traffic-control system.
- [0048] Objects can represent elements of the computer-user environment such as windows, menus or graphics objects.
- [0049] An object can represent an inventory, such as a personnel file or a table of the latitudes and longitudes of cities.
- [0050] An object can represent user-defined data types such as time, angles, and complex numbers, or points on the plane.
[0051] With this enormous capability of an object to represent just about any logically separable matters, OOP allows the software developer to design and implement a computer program that is a model of some aspects of reality, whether that reality is a physical entity, a process, a system, or a composition of matter. Since the object can represent anything, the software developer can create an object which can be used as a component in a larger software project in the future.
[0052] If 90% of a new OOP software program consists of proven, existing components made from preexisting reusable objects, then only the remaining 10% of the new software project has to be written and tested from scratch. Since 90% already came from an inventory of extensively tested reusable objects, the potential domain from which an error could originate is 10% of the program. As a result, OOP enables software developers to build objects out of other, previously built, objects.
[0053] This process closely resembles complex machinery being built out of assemblies and sub-assemblies. OOP technology, therefore, makes software engineering more like hardware engineering in that software is built from existing components, which are available to the developer as objects. All this adds up to an improved quality of the software as well as an increased speed of its development.
[0054] Programming languages are beginning to fully support the OOP principles, such as encapsulation, inheritance, polymorphism, and composition-relationship. With the advent of the C++ language, many commercial software developers have embraced OOP. C++ is an OOP language that offers a fast, machine-executable code. Furthermore, C++ is suitable for both commercial-application and systems-programming projects. For now, C++ appears to be the most popular choice among many OOP programmers, but there is a host of other OOP languages, such as Smalltalk, common lisp object system (CLOS), and Eiffel. Additionally, OOP capabilities are being added to more traditional popular computer programming languages such as Pascal.
[0055] The benefits of object classes can be summarized, as follows:
-
- [0056] Objects and their corresponding classes break down complex programming problems into many smaller, simpler problems.
- [0057] Encapsulation enforces data abstraction through the organization of data into small, independent objects that can communicate with each other. Encapsulation protects the data in an object from accidental damage, but allows other objects to interact with that data by calling the object's member functions and structures.
- [0058] Subclassing and inheritance make it possible to extend and modify objects through deriving new kinds of objects from the standard classes available in the system. Thus, new capabilities are created without having to start from scratch.
- [0059] Polymorphism and multiple inheritance make it possible for different programmers to mix and match characteristics of many different classes and create specialized objects that can still work with related objects in predictable ways.
- [0060] Class hierarchies and containment hierarchies provide a flexible mechanism for modeling real-world objects and the relationships among them.
- [0061] Libraries of reusable classes are useful in many situations, but they also have some limitations. For example:
- [0062] Complexity. In a complex system, the class hierarchies for related classes can become extremely confusing, with many dozens or even hundreds of classes.
- [0063] Flow of control. A program written with the aid of class libraries is still responsible for the flow of control (i.e., it must control the interactions among all the objects created from a particular library). The programmer has to decide which functions to call at what times for which kinds of objects.
- [0064] Duplication of effort. Although class libraries allow programmers to use and reuse many small pieces of code, each programmer puts those pieces together in a different way. Two different programmers can use the same set of class libraries to write two programs that do exactly the same thing but whose internal structure (i.e., design) may be quite different, depending on hundreds of small decisions each programmer makes along the way. Inevitably, similar pieces of code end up doing similar things in slightly different ways and do not work as well together as they should.
[0065] Class libraries are very flexible. As programs grow more complex, more programmers are forced to reinvent basic solutions to basic problems over and over again. A relatively new extension of the class library concept is to have a framework of class libraries. This framework is more complex and consists of significant collections of collaborating classes that capture both the small scale patterns and major mechanisms that implement the common requirements and design in a specific application domain. They were first developed to free application programmers from the chores involved in displaying menus, windows, dialog boxes, and other standard user interface elements for personal computers.
[0066] Frameworks also represent a change in the way programmers think about the interaction between the code they write and code written by others. In the early days of procedural programming, the programmer called libraries provided by the operating system to perform certain tasks, but basically the program executed down the page from start to finish, and the programmer was solely responsible for the flow of control. This was appropriate for printing out paychecks, calculating a mathematical table, or solving other problems with a program that executed in just one way.
[0067] The development of graphical user interfaces began to turn this procedural programming arrangement inside out. These interfaces allow the user, rather than program logic, to drive the program and decide when certain actions should be performed. Today, most personal computer software accomplishes this by means of an event loop which monitors the mouse, keyboard, and other sources of external events and calls the appropriate parts of the programmer's code according to actions that the user performs. The programmer no longer determines the order in which events occur. Instead, a program is divided into separate pieces that are called at unpredictable times and in an unpredictable order. By relinquishing control in this way to users, the developer creates a program that is much easier to use. Nevertheless, individual pieces of the program written by the developer still call libraries provided by the operating system to accomplish certain tasks, and the programmer must still determine the flow of control within each piece after being called by the event loop. Application code still “sits on top of” the system.
[0068] Even event loop programs require programmers to write a lot of code that should not need to be written separately for every application. The concept of an application framework carries the event loop concept further. Instead of dealing with all the nuts and bolts of constructing basic menus, windows, and dialog boxes and then making these things all work together, programmers using application frameworks start with working application code and basic user interface elements in place. Subsequently, they build from there by replacing some of the generic capabilities of the framework with the specific capabilities of the intended application.
[0069] Application frameworks reduce the total amount of code that a programmer has to write from scratch. However, because the framework is really a generic application that displays windows, supports copy and paste, and so on, the programmer can also relinquish control to a greater degree than event loop programs permit. The framework code takes care of almost all event handling and flow of control, and the programmer's code is called only when the framework needs it (e.g., to create or manipulate a proprietary data structure).
[0070] A programmer writing a framework program not only relinquishes control to the user (as is also true for event loop programs), but also relinquishes the detailed flow of control within the program to the framework. This approach allows the creation of more complex systems that work together in interesting ways, as opposed to isolated programs, having custom code, being created over and over again for similar problems.
[0071] Thus, as is explained above, a framework basically is a collection of cooperating classes that make up a reusable design solution for a given problem domain. It typically includes objects that provide default behavior (e.g., for menus and windows), and programmers use it by inheriting some of that default behavior and overriding other behavior so that the framework calls application code at the appropriate times.
[0072] There are three main differences between frameworks and class libraries:
-
- [0073] Behavior versus protocol. Class libraries are essentially collections of behaviors that you can call when you want those individual behaviors in your program. A framework, on the other hand, provides not only behavior but also the protocol or set of rules that govern the ways in which behaviors can be combined, including rules for what a programmer is supposed to provide versus what the framework provides.
- [0074] Call versus override. With a class library, the code the programmer instantiates objects and calls their member functions. It's possible to instantiate and call objects in the same way with a framework (i.e., to treat the framework as a class library), but to take full advantage of a framework's reusable design, a programmer typically writes code that overrides and is called by the framework. The framework manages the flow of control among its objects. Writing a program involves dividing responsibilities among the various pieces of software that are called by the framework rather than specifying how the different pieces should work together.
- [0075] Implementation versus design. With class libraries, programmers reuse only implementations, whereas with frameworks, they reuse design. A framework embodies the way a family of related programs or pieces of software work. It represents a generic design solution that can be adapted to a variety of specific problems in a given domain. For example, a single framework can embody the way a user interface works, even though two different user interfaces created with the same framework might solve quite different interface problems.
[0076] Thus, through the development of frameworks for solutions to various problems and programming tasks, significant reductions in the design and development effort for software can be achieved. A preferred embodiment of the invention utilizes HyperText Markup Language (HTML) to implement documents on the Internet together with a general-purpose secure communication protocol for a transport medium between the client and the Newco. HTTP or other protocols could be readily substituted for HTML without undue experimentation. Information on these products is available in T. Berners-Lee, D. Connoly, “RFC 1866: Hypertext Markup Language—2.0” (November 1995); and R. Fielding, H, Frystyk, T. Berners-Lee, J. Gettys and J. C. Mogul, “Hypertext Transfer Protocol—HTTP/1.1: HTTP Working Group Internet Draft” (May 2, 1996). HTML is a simple data format used to create hypertext documents that are portable from one platform to another. HTML documents are SGML documents with generic semantics that are appropriate for representing information from a wide range of domains. HTML has been in use by the World-Wide Web global information initiative since 1990. HTML is an application of ISO Standard 8879:1986 Information Processing Text and Office Systems; Standard Generalized Markup Language (SGML).
[0077] To date, Web development tools have been limited in their ability to create dynamic Web applications which span from client to server and interoperate with existing computing resources. Until recently, HTML has been the dominant technology used in development of Web-based solutions. However, HTML has proven to be inadequate in the following areas:
-
- [0078] Poor performance;
- [0079] Restricted user interface capabilities;
- [0080] Can only produce static Web pages;
- [0081] Lack of interoperability with existing applications and data; and
- [0082] Inability to scale.
[0083] Sun Microsystem's Java language solves many of the client-side problems by:
-
- [0084] Improving performance on the client side;
- [0085] Enabling the creation of dynamic, real-time Web applications; and
- [0086] Providing the ability to create a wide variety of user interface components.
[0087] With Java, developers can create robust User Interface (UI) components. Custom “widgets” (e.g. real-time stock tickers, animated icons, etc.) can be created, and client-side performance is improved. Unlike HTML, Java supports the notion of client-side validation, offloading appropriate processing onto the client for improved performance. Dynamic, real-time Web pages can be created. Using the above-mentioned custom UI components, dynamic Web pages can also be created.
[0088] Sun's Java language has emerged as an industry-recognized language for “programming the Internet.” Sun defines Java as: “a simple, object-oriented, distributed, interpreted, robust, secure, architecture-neutral, portable, high-performance, multithreaded, dynamic, buzzword-compliant, general-purpose programming language. Java supports programming for the Internet in the form of platform-independent Java applets.” Java applets are small, specialized applications that comply with Sun's Java Application Programming Interface (API) allowing developers to add “interactive content” to Web documents (e.g. simple animations, page adornments, basic games, etc.). Applets execute within a Java-compatible browser (e.g. Netscape Navigator) by copying code from the server to client. From a language standpoint, Java's core feature set is based on C++. Sun's Java literature states that Java is basically “C++, with extensions from Objective C for more dynamic method resolution”.
[0089] Another technology that provides similar function to JAVA is provided by Microsoft and ActiveX Technologies, to give developers and Web designers wherewithal to build dynamic content for the Internet and personal computers. ActiveX includes tools for developing animation, 3-D virtual reality, video and other multimedia content. The tools use Internet standards, work on multiple platforms, and are being supported by over 100 companies. The group's building blocks are called ActiveX Controls, small, fast components that enable developers to embed parts of software in hypertext markup language (HTML) pages. ActiveX Controls work with a variety of programming languages including Microsoft Visual C++, Borland Delphi, Microsoft Visual Basic programming system and, in the future, Microsoft's development tool for Java, code named “Jakarta.” ActiveX Technologies also includes ActiveX Server Framework, allowing developers to create server applications. One of ordinary skill in the art readily recognizes that ActiveX could be substituted for JAVA without undue experimentation to practice the invention.
[0090] In accordance with a preferred embodiment, BackgroundFinder (BF) is implemented as an agent responsible for preparing an individual for an upcoming meeting by helping him/her retrieve relevant information about the meeting from various sources. BF receives input text in character form indicative of the target meeting. The input text is generated in accordance with a preferred embodiment by a calendar program that includes the time of the meeting. As the time of the meeting approaches, the calendar program is queried to obtain the text of the target event and that information is utilized as input to the agent. Then, the agent parses the input meeting text to extract its various components such as title, body, participants, location, time etc. The system also performs pattern matching to identify particular meeting fields in a meeting text. This information is utilized to query various sources of information on the web and obtain relevant stories about the current meeting to send back to the calendaring system. For example, if an individual has a meeting with Netscape and Microsoft to talk about their disputes, and would obtain this initial information from the calendaring system. It will then parse out the text to realize that the companies in the meeting are “Netscape” and “Microsoft” and the topic is “disputes.” Then, the system queries the web for relevant information concerning the topic. Thus, in accordance with an objective of the invention, the system updates the calendaring system and eventually the user with the best information it can gather to prepare the user for the target meeting. In accordance with a preferred embodiment, the information is stored in a file that is obtained via selection from a link imbedded in the calendar system.
Program Organization
[0091] A computer program in accordance with a preferred embodiment is organized in five distinct modules: BF.Main, BF.Parse, Background Finder.Error, BF.PatternMatching and BF.Search. There is also a frmMain which provides a user interface used only for debugging purposes. The executable programs in accordance with a preferred embodiment never execute with the user interface and should only return to the calendaring system through Microsoft's Winsock control. A preferred embodiment of the system executes in two different modes which can be specified under the command line sent to it by the calendaring system. When the system runs in simple mode, it executes a keyword query to submit to external search engines. When executed in complex mode, the system performs pattern matching before it forms a query to be sent to a search engine.
Data Structures
[0092] The system in accordance with a preferred embodiment utilizes three user defined structures:
- [0093] 1. TMeetingRecord;
- [0094] 2. TPatternElement; and
- [0095] 3. TPatternRecord.
[0096] The user-defined structure, tMeetingRecord, is used to store all the pertinent information concerning a single meeting. This info includes userID, an original description of the meeting, the extracted list of keywords from the title and body of meeting etc. It is important to note that only one meeting record is created per instance of the system in accordance with a preferred embodiment. This is because each time the system is spawned to service an upcoming meeting, it is assigned a task to retrieve information for only one meeting. Therefore, the meeting record created corresponds to the current meeting examined. ParseMeetingText populates this meeting record and it is then passed around to provide information about the meeting to other functions.
[0097] If GoPatternMatch can bind any values to a particular meeting field, the corresponding entries in the meeting record is also updated. The structure of tMeetingRecord with each field described in parentheses is provided below in accordance with a preferred embodiment.
[0098]
| A.1.1.1.1.1 | Public Type tMeetingRecord |
| sUserID As String | (user id given by Munin) |
| sTitleOrig As String | (original non stop listed title we need to keep around to |
| send back to Munin) | |
| sTitleKW As String | (stoplisted title with only keywords) |
| sBodyKW As String | (stoplisted body with only keywords) |
| sCompany( ) As String | (companys identified in title or body through pattern |
| matching) | |
| sTopic( ) As String | (topics identified in title or body through pattern |
| matching) | |
| sPeople( ) As String | (people identified in title or body through pattern |
| matching) | |
| sWhen( ) As String | (time identified in title or body through pattern matching) |
| sWhere( ) As String | (location identified in title or body through pattern |
| matching) | |
| sLocation As String | (location as passed in by Munin) |
| sTime As String | (time as passed in by Munin) |
| sParticipants( ) As String | (all participants engaged as passed in by Munin) |
| sMeetingText As String | (the original meeting text w/o userid) |
| End Type | |
[0099] There are two other structures which are created to hold each individual pattern utilized in pattern matching. The record tAPatternRecord is an array containing all the components/elements of a pattern. The type tAPatternElement is an array of strings which represent an element in a pattern. Because there may be many “substitutes” for each element, we need an array of strings to keep track of what all the substitutes are. The structures of tAPatternElement and tAPatternRecord are presented below in accordance with a preferred embodiment.
[0100]
| Public Type tAPatternElement | |
| elementArray( ) As String | |
| End Type | |
| Public Type tAPatternRecord | |
| patternArray( ) As tAPatternElement | |
| End Type | |
Common User Defined Constants
[0101] Many constants are defined in each declaration section of the program which may need to be updated periodically as part of the process of maintaining the system in accordance with a preferred embodiment. The constants are accessible to allow dynamic configuration of the system to occur as updates for maintaining the code.
[0102] Included in the following tables are lists of constants from each module which I thought are most likely to be modified from time to time. However, there are also other constants used in the code not included in the following list. It does not mean that these non-included constants will never be changed. It means that they will change much less frequently.
[0103]
| For the Main Module (BF.Main): | ||
| PRESET | ||
| CONSTANT | VALUE | USE |
| MSGTOMUNIN— | 6 | Define the message number used |
| TYPE | to identify messages between BF | |
| and Munin | ||
| IP_ADDRESS— | “10.2.100.48” | Define the IP address of the |
| MUNIN | machine in which Munin and BF | |
| are running on so they can transfer | ||
| data through UDP. | ||
| PORT_MUNIN | 7777 | Define the remote port in which |
| we are operating on. | ||
| TIMEOUT_AV | 60 | Define constants for setting time |
| out in inet controls | ||
| TIMEOUT_NP | 60 | Define constants for setting time |
| out in inet controls | ||
| CMD— | “\” | Define delimiter to tell which part |
| SEPARATOR | of Munin's command represents | |
| the beginning of our input meeting | ||
| text | ||
| OUTPARAM— | “::” | Define delimiter for separating out |
| SEPARATOR | different portions of the output. | |
| The separator is for delimiting the | ||
| msg type, the user id, the meeting | ||
| title and the beginning of the | ||
| actual stories retrieved. | ||
[0104]
| For the Search Module (BF.Search): | ||
| CURRENT | ||
| CONSTANT | VALUE | USE |
| PAST_NDAYS | 5 | Define number of days you want to |
| look back for AltaVista articles. | ||
| Doesn't really matter now because | ||
| we aren't really doing a news | ||
| search in alta vista. We want all | ||
| info. | ||
| CONNECTOR_AV— | “+AND+” | Define how to connect keywords. |
| URL | We want all our keywords in the | |
| string so for now use AND. If you | ||
| want to do an OR or something, | ||
| just change connector. | ||
| CONNECTOR_NP— | “+AND+” | Define how to connect keywords. |
| URL | We want all our keywords in the | |
| string so for now use AND. If you | ||
| want to do an OR or something, | ||
| just change connector. | ||
| NUM_NP_STORIES | 3 | Define the number of stories to |
| return back to Munin from | ||
| NewsPage. | ||
| NUM_AV_STORIES | 3 | Define the number of stories to |
| return back to Munin from | ||
| AltaVista. | ||
[0105]
| For the Parse Module (BF.Parse): | ||
| CURRENT | ||
| CONSTANT | VALUE | USE |
| PORTION— | “::” | Define the separator between |
| SEPARATOR | different portions of the meeting | |
| text sent in by Munin. For example | ||
| in “09::Meet with Chad::about | ||
| life::Chad|Denise::::::” “::” is the | ||
| separator between different parts | ||
| of the meeting text. | ||
| PARTICIPANT— | “|” | Define the separator between each |
| SEPARATOR | participant in the participant list | |
| portion of the original meeting | ||
| text. Refer to example above. | ||
[0106] For Pattern Matching Module (BFPatternMatch): There are no constants in this module which require frequent updates.
General Process Flow
[0107] The best way to depict the process flow and the coordination of functions between each other is with the five flowcharts illustrated in FIGS. 2 to 6 . FIG. 2 depicts the overall process flow in accordance with a preferred embodiment. Processing commences at the top of the chart at function block 200 which launches when the program starts. Once the application is started, the command line is parsed to remove the appropriate meeting text to initiate the target of the background find operation in accordance with a preferred embodiment as shown in function block 210. A global stop list is generated after the target is determined as shown in function block 220. Then, all the patterns that are utilized for matching operations are generated as illustrated in function block 230. Then, by tracing through the chart, function block 200 invokes GoBF 240 which is responsible for logical processing associated with wrapping the correct search query information for the particular target search engine. For example, function block 240 flows to function block 250 and it then calls GoPatternMatch as shown in function block 260. To see the process flow of GoPatternMatch, we swap to the diagram titled “Process Flow for BF's Pattern Matching Unit.”
[0108] One key thing to notice is that functions depicted at the same level of the chart are called by in sequential order from left to right (or top to bottom) by their common parent function. For example, Main 200 calls ProcessCommandLine 210, then CreateStopListist 220, then CreatePatterns 230, then GoBackgroundFinder 240. FIGS. 3 to 6 detail the logic for the entire program, the parsing unit, the pattern matching unit and the search unit respectively. FIG. 6 details the logic determinative of data flow of key information through BackgroundFinder, and shows the functions that are responsible for creating or processing such information.
Detailed Search Architecture Under the Simple Query Mode
Search Alta Vista
(Function block 270 of FIG. 2 )
[0109] The Alta Vista search engine utilizes the identifies and returns general information about topics related to the current meeting as shown in function block 270 of FIG. 2 . The system in accordance with a preferred embodiment takes all the keywords from the title portion of the original meeting text and constructs an advanced query to send to Alta Vista. The keywords are logically combined together in the query. The results are also ranked based on the same set of keywords. One of ordinary skill in the art will readily comprehend that a date restriction or publisher criteria could be facilitated on the articles we want to retrieve. A set of top ranking stories are returned to the calendaring system in accordance with a preferred embodiment.
News Page
(Function block 275 of FIG. 2 )
[0110] The NewsPage search system is responsible for giving us the latest news topics related to a target meeting. The system takes all of the keywords from the title portion of the original meeting text and constructs a query to send to the NewsPage search engine. The keywords are logically combined together in the query. Only articles published recently are retrieved. The Newspage search system provides a date restriction criteria that is settable by a user according to the user's preference. The top ranking stories are returned to the calendaring system.
[0111] FIG. 3 is a user profile data model in accordance with a preferred embodiment. Processing commences at function block 300 which is responsible for invoking the program from the main module. Then, at function block 310, a wrapper function is invoked to prepare for the keyword extraction processing in function block 320. After the keywords are extracted, then processing flows to function block 330 to determine if the delimiters are properly positioned. Then, at function block 340, the number of words in a particular string is calculated and the delimiters for the particular field are and a particular field from the meeting text is retrieved at function block 350. Then, at function block 380, the delimiters of the string are again checked to assure they are placed appropriately. Finally, at function block 360, the extraction of each word from the title and body of the message is performed a word at a time utilizing the logic in function block 362 which finds the next closest word delimiter in the input phrase, function block 364 which strips unnecessary materials from a word and function block 366 which determines if a word is on the stop list and returns an error if the word is on the stop list.
Pattern Matching in Accordance with a Preferred EMBODIMENT
[0112] The limitations associated with a simple searching method include the following:
-
- [0113] 1. Because it relies on a stoplist of unwanted words in order to extract from the meeting text a set of keywords, it is limited by how comprehensive the stoplist is. Instead of trying to figure out what parts of the meeting text we should throw away, we should focus on what parts of the meeting text we want.
- [0114] 2. A simple search method in accordance with a preferred embodiment only uses the keywords from a meeting title to form queries to send to Alta Vista and NewsPage. This ignores an alternative source of information for the query, the body of the meeting notice. We cannot include the keywords from the meeting body to form our queries because this often results in queries which are too long and so complex that we often obtain no meaningful results.
- [0115] 3. There is no way for us to tell what each keyword represents. For example, we may extract “Andy” and “Grove” as two keywords. However, a simplistic search has no way knowing that “Andy Grove” is in fact a person's name. Imagine the possibilities if we could somehow intelligently guess that “Andy Grove” is a person's name. We can find out if he is an Andersen person and if so what kind of projects he's been on before etc. etc.
- [0116] 4. In summary, by relying solely on a stoplist to parse out unnecessary words, we suffer from “information overload”.
Pattern Matching Overcomes these Limitations in Accordance with a Preferred Embodiment
[0117] Here's how the pattern matching system can address each of the corresponding issues above in accordance with a preferred embodiment.
- [0118] 1. By doing pattern matching, we match up only parts of the meeting text that we want and extract those parts.
- [0119] 2. By performing pattern matching on the meeting body and extracting only the parts from the meeting body that we want, our meeting body will not go to complete waste.
- [0120] 3. Pattern matching is based on a set of templates that we specify, allowing us to identify people names, company names, etc. from a meeting text.
- [0121] 4. In summary, with pattern matching, we no longer suffer from information overload. Of course, the big problem is how well our pattern matching works. If we rely exclusively on artificial intelligence processing, we do not have a 100% hit rate. We are able to identify about 20% of all company names presented to us.
Patterns
[0122] A pattern in the context of a preferred embodiment is a template specifying the structure of a phrase we are looking for in a meeting text. The patterns supported by a preferred embodiment are selected because they are templates of phrases which have a high probability of appearing in someone's meeting text. For example, when entering a meeting in a calendar, many would write something such as “Meet with Bob Dutton from Stanford University next Tuesday.” A common pattern would then be something like the word “with” followed by a person's name (in this example it is Bob Dutton) followed by the word “from” and ending with an organization's name (in this case, it is Stanford University).
Pattern Matching Terminology
[0123] The common terminology associated with pattern matching is provided below.
-
- [0124] Pattern: a pattern is a template specifying the structure of a phrase we want to bind the meeting text to. It contains sub units.
- [0125] Element: a pattern can contain many sub-units. These subunits are called elements. For example, in the pattern “with $PEOPLE$ from $COMPANY$”, “with” “$PEOPLE$” “from” “$COMPANY$” are all elements.
- [0126] Placeholder: a placeholder is a special kind of element in which we want to bind a value to.Using the above example, “$PEOPLE$” is a placeholder.
- [0127] Indicator: an indicator is another kind of element which we want to find in a meeting text but no value needs to bind to it. There may be often more than one indicator we are looking for in a certain pattern. That is why an indicator is not an “atomic” type.
- [0128] Substitute: substitutes are a set of indicators which are all synonyms of each other. Finding any one of them in the input is good.
[0129] There are five fields which are identified for each meeting:
-
- [0130] Company ($COMPANY$)
- [0131] People ($PEOPLE$)
- [0132] Location ($LOCATION$)
- [0133] Time ($TIME$)
- [0134] Topic ($TOPIC_UPPER$) or ($TOPIC_ALL$)
[0135] In parentheses are the placeholders I used in my code as representation of the corresponding meeting fields.
[0136] Each placeholder has the following meaning:
-
- [0137] $COMPANY$: binds a string of capitalized words (e.g. Meet with Joe Carter of <Andersen Consulting>)
- [0138] $PEOPLE$: binds series of string of two capitalized words potentially connected by “,” “and” or “&” (e.g. Meet with <Joe Carter> of Andersen Consulting, Meet with <Joe Carter and Luke Hughes> of Andersen Consulting)
- [0139] $LOCATION$: binds a string of capitalized words (e.g. Meet Susan at <Palo Alto Square>)
- [0140] $TIME$: binds a string containing the format #:## (e.g. Dinner at <6:30 pm>)
- [0141] $TOPIC_UPPER$: binds a string of capitalized words for our topic (e.g <Stanford Engineering Recruiting> Meeting to talk about new hires).
- [0142] $TOPIC_ALL$: binds a string of words without really caring if it's capitalized or not. (e.g. Meet to talk about <ubiquitous computing>)
[0143] Here is a table representing all the patterns supported by BF. Each pattern belongs to a pattern group. All patterns within a pattern group share a similar format and they only differ from each other in terms of what indicators are used as substitutes. Note that the patterns which are grayed out are also commented in the code. BF has the capability to support these patterns but we decided that matching these patterns is not essential at this point.
[0144]
| PAT | PAT | ||
|---|---|---|---|
| GRP | # | PATTERN | EXAMPLE |
| 1 | a | $PEOPLE$ of | Paul Maritz of Microsoft |
| $COMPANY$ | |||
| b | $PEOPLE$ from | Bill Gates, Paul Allen and | |
| $COMPANY$ | Paul Maritz from Microsoft | ||
| 2 | a | $TOPIC_UPPER$ meeting | Push Technology Meeting |
| b | $TOPIC_UPPER$ mtg | Push Technology Mtg | |
| c | $TOPIC_UPPER$ demo | Push Technology demo | |
| d | $TOPIC_UPPER$ | Push Technology interview | |
| interview | |||
| e | $TOPIC_UPPER$ | Push Technology | |
| presentation | presentation | ||
| f | $TOPIC_UPPER$ visit | Push Technology visit | |
| g | $TOPIC_UPPER$ briefing | Push Technology briefing | |
| h | $TOPIC_UPPER$ | Push Technology | |
| discussion | discussion | ||
| i | $TOPIC_UPPER$ | Push Technology | |
| workshop | workshop | ||
| j | $TOPIC_UPPER$ prep | Push Technology prep | |
| k | $TOPIC_UPPER$ review | Push Technology review | |
| l | $TOPIC_UPPER$ lunch | Push Technology lunch | |
| m | $TOPIC_UPPER$ project | Push Technology project | |
| n | $TOPIC_UPPER$ projects | Push Technology projects | |
| 3 | a | $COMPANY$ corporation | Intel Corporation |
| b | $COMPANY$ corp. | IBM Corp. | |
| c | $COMPANY$ systems | Cisco Systems | |
| d | $COMPANY$ limited | IBM limited | |
| e | $COMPANY$ ltd | IBM ltd | |
| 4 | a | about $TOPIC_ALL$ | About intelligent agents |
| technology | |||
| b | discuss $TOPIC_ALL$ | Discuss intelligent agents | |
| technology | |||
| c | show $TOPIC_ALL$ | Show the client our | |
| intelligent agents | |||
| technology | |||
| d | re: $TOPIC_ALL$ | re: intelligent agents | |
| technology | |||
| e | review $TOPIC_ALL$ | Review intelligent agents | |
| technology | |||
| f | agenda | The agenda is as follows: | |
| clean up | |||
| clean up | |||
| clean up | |||
| g | agenda: $TOPIC_ALL$ | Agenda: | |
| demo client intelligent | |||
| agents technology. | |||
| demo ecommerce. | |||
| 5 | a | w/$PEOPLE$ of | Meet w/Joe Carter of |
| $COMPANY$ | Andersen Consulting | ||
| b | w/$PEOPLE$ from | Meet w/Joe Carter from | |
| $COMPANY$ | Andersen Consulting | ||
| 6 | a | w/$COMPANY$ per | Talk w/Intel per Jason |
| $PEOPLE$ | Foster | ||
|
|
|
|
|
|
|
|
| 8 | a | At $LOCATION$ | At LuLu's resturant |
| b | In $LOCATION$ | in Santa Clara | |
| 9 | a | Per $PEOPLE$ | per Susan Butler |
| 10 | a | call w/$PEOPLE$ | Conf call w/John Smith |
| B | call with $PEOPLE$ | Conf call with John Smith | |
| 11 | A | prep for $TOPIC_ALL$ | Prep for London meeting |
| B | preparation for | Preparation for London | |
| $TOPIC_ALL$ | meeting | ||
[0145] FIG. 4 is a detailed flowchart of pattern matching in accordance with a preferred embodiment. Processing commences at function block 400 where the main program invokes the pattern matching application and passes control to function block 410 to commence the pattern match processing. Then, at function block 420, the wrapper function loops through to process each pattern which includes determining if a part of the text string can be bound to a pattern as shown in function block 430. Then, at function block 440, various placeholders are bound to values if they exist, and in function block 441, a list of names separated by punctuation are bound, and at function block 442 a full name is processed by finding two capitalized words as a full name and grabbing the next letter after a space after a word to determine if it is capitalized. Then, at function block 443, time is parsed out of the string in an appropriate manner and the next word after a blank space in function block 444. Then, at function block 445, the continuous phrases of capitalized words such as company, topic or location are bound and in function block 446, the next word after the blank is obtained for further processing in accordance with a preferred embodiment. Following the match meeting field processing, function block 450 is utilized to loacte an indicator which is the head of a pattern, the next word after the blank is obtained as shown in function block 452 and the word is checked to determine if the word is an indicator as shown in function block 454. Then, at function block 460, the string is parsed to locate an indicator which is not at the end of the pattern and the next word after unnecessary white space such as that following a line feed or a carriage return is processed as shown in function block 462 and the word is analyzed to determine if it is an indicator as shown in function block 464. Then, in function block 470, the temporary record is reset to the null set to prepare it for processing the next string and at function block 480, the meeting record is updated and at function block 482 a check is performed to determine if an entry is already made to the meeting record before parsing the meeting record again.
Using the Identified Meeting Fields
[0146] Now that we have identified fields within the meeting text which we consider important, there are quite a few things we can do with it. One of the most important applications of pattern matching is of course to improve the query we construct which eventually gets submitted to Alta Vista and News Page. There are also a lot of other options and enhancements which exploit the results of pattern matching that we can add to BF. These other options will be described in the next section. The goal of this section is to give the reader a good sense of how the results obtained from pattern matching can be used to help us obtain better search results.
[0147] FIG. 5 is a flowchart of the detailed processing for preparing a query and obtaining information from the Internet in accordance with a preferred embodiment. Processing commences at function block 500 and immediately flows to function block 510 to process the wrapper functionality to prepare for an Internet search utilizing a web search engine. If the search is to utilize the Alta Vista search engine, then at function block 530, the system takes information from the meeting record and forms a query in function blocks 540 to 560 for submittal to the search engine. If the search is to utilize the NewsPage search engine, then at function block 520, the system takes information from the meeting record and forms a query in function blocks 521 to 528.
Alta Vista Search Engine
[0148] The strength of the Alta Vista search engine is that it provides enhanced flexibility. Using its advance query method, one can construct all sorts of Boolean queries and rank the search however you want. However, one of the biggest drawbacks with Alta Vista is that it is not very good at handling a large query and is likely to give back irrelevant results. If we can identify the topic and the company within a meeting text, we can form a pretty short but comprehensive query which will hopefully yield better results. We also want to focus on the topics found. It may not be of much merit to the user to find out info about a company especially if the user already knows the company well and has had numerous meetings with them. It's the topics they want to research on.
News Page Search Engine
[0149] The strength of the News Page search engine is that it does a great job searching for the most recent news if you are able to give it a valid company name. Therefore when we submit a query to the news page web site, we send whatever company name we can identify and only if we cannot find one do we use the topics found to form a query. If neither one is found, then no search is performed. The algorithmn utilized to form the query to submit to Alta Vista is illustrated in FIG. 7 . The algorithmn that we will use to form the query to submit to News Page is illustrated in FIG. 8 .
[0150] The following table describes in detail each function in accordance with a preferred embodiment. The order in which functions appear mimics the process flow as closely as possible. When there are situations in which a function is called several times, this function will be listed after the first function which calls it and its description is not duplicated after every subsequent function which calls it.
[0151]
| Procedure | |||
|---|---|---|---|
| Name | Type | Called By | Description |
| Main | Public | None | This is the main function |
| (BF.Main) | Sub | where the program first | |
| launches. It initializes BF | |||
| with the appropriate | |||
| parameters(e.g. Internet time- | |||
| out, stoplist . . .) and calls | |||
| GoBF to launch the main | |||
| part of the program. | |||
| ProcessCommandLine | Private | Main | This function parses the |
| (BF.Main) | Sub | command line. It assumes | |
| that the delimiter indicating | |||
| the beginning of input from | |||
| Munin is stored in the | |||
| constant | |||
| CMD_SEPARATOR. | |||
| CreateStopList | Private | Main | This function sets up a stop |
| (BF.Main) | Function | list for future use to parse out | |
| unwanted words from the | |||
| meeting text. | |||
| There are commas on each | |||
| side of each word to enable | |||
| straight checking. | |||
| CreatePatterns | Public | Main | This procedure is called once |
| (BF.Pattern | Sub | when BF is first initialized to | |
| Match) | create all the potential | ||
| patterns that portions of the | |||
| meeting text can bind to. A | |||
| pattern can contain however | |||
| many elements as needed. | |||
| There are | |||
| two types of elements. The | |||
| first type of elements are | |||
| indicators. These are real | |||
| words which delimit the | |||
| potential of a meeting field | |||
| (eg company) to follow. | |||
| Most of these indicators are | |||
| stop words as expected | |||
| because stop words are words | |||
| usually common to all | |||
| meeting text so it makes | |||
| sense they form patterns. The | |||
| second type of elements are | |||
| special strings which | |||
| represent placeholders. | |||
| A placeholder is always in | |||
| the form of $*$ where * can | |||
| be either PEOPLE, | |||
| COMPANY, TOPIC_UPPER, | |||
| TIME, LOCATION or | |||
| TOPIC_ALL. A pattern can | |||
| begin with either one of the | |||
| two types of elements and | |||
| can be however long, | |||
| involving however any | |||
| number/type of elements. | |||
| This procedure dynamically | |||
| creates a new pattern record | |||
| for each pattern in the table and | |||
| it also dynamically creates | |||
| new tAPatternElements for | |||
| each element within a | |||
| pattern. In addition, there is | |||
| the concept of being able to | |||
| substitute indicators within a | |||
| pattern. For example, the | |||
| pattern $PEOPLE$ of | |||
| $COMPANY$ is similar to | |||
| the pattern $PEOPLE$ from | |||
| $COMPANY$. “from” is a | |||
| substitute for “of”. Our | |||
| structure should be able to | |||
| express such a need for | |||
| substitution. | |||
| GoBF | Public | Main | This is a wrapper procedurer |
| (BF.Main) | Sub | that calls both the parsing | |
| and the searching subroutines | |||
| of the BF. It is also responsible | |||
| for sending data back to Munin. | |||
| ParseMeetingText | Public | GoBackGroundFinder | This function takes the initial |
| (BF.Parse) | Function | meeting text and identifies | |
| the userID of the record as | |||
| well as other parts of the | |||
| meeting text including the | |||
| title, body, participant list, | |||
| location and time. In | |||
| addition, we call a helper | |||
| function ProcessStopList to | |||
| eliminate all the unwanted | |||
| words from the original | |||
| meeting title and meeting | |||
| body so that only keywords | |||
| are left. The information | |||
| parsed out is stored in the | |||
| MeetingRecord structure. | |||
| Note that this function does | |||
| no error checking and for the | |||
| most time assumes that the | |||
| meeting text string is | |||
| correctly formatted by | |||
| Munin. | |||
| The important variable is | |||
| thisMeeting Record is the | |||
| temp holder for all info | |||
| regarding current meeting. | |||
| It's eventually returned to | |||
| caller. | |||
| FormatDelimitation | Private | ParseMeetingText, | There are 4 ways in which |
| (BF.Parse) | DetermineNumWords, | the delimiters can be placed. | |
| GetAWordFromString | We take care of all these | ||
| cases by reducing them | |||
| down to Case 4 in which | |||
| there are no delimiters | |||
| around but only between | |||
| fields in a string(e.g. | |||
| A::B::C) | |||
| DetermineNumWords | Public | ParseMeetingText, | This functions determines |
| (BF.Parse) | Function | ProcessStopList | how many words there are in |
| a string (stInEvalString) The | |||
| function assumes that each | |||
| word is separated by a | |||
| designated separator as | |||
| specified in stSeparator. The | |||
| return type is an integer that | |||
| indicates how many words | |||
| have been found assuming | |||
| each word in the string is | |||
| separated by stSeparator. This | |||
| function is always used along | |||
| with GetAWordFromString and | |||
| should be called before | |||
| calling GetAWordFrom | |||
| String. | |||
| GetAWordFromString | Public | ParseMeetingText, | This function extracts the ith |
| (BF.Parse) | Function | ProcessStopList | word of the |
| string(stInEvalString) | |||
| assuming that each word in | |||
| the string is separated by a | |||
| designated | |||
| separator contained in the | |||
| variable stSeparator. | |||
| In most cases, use this | |||
| function with | |||
| DetermineNumWords. The | |||
| function returns the wanted | |||
| word. This function checks | |||
| to make sure that | |||
| iInWordNum is within | |||
| bounds so that i | |||
| is not greater than the total | |||
| number of words in string or | |||
| less than/equal to zero. If it | |||
| is out of bounds, we return | |||
| empty string to indicate we | |||
| can't get anything. We try to | |||
| make sure this doesn't | |||
| happen by calling | |||
| DetermineNumWords first. | |||
| ParseAndCleanPhrase | Private | ParseMeetingText | This function first grabs the |
| (BF.Parse) | Function | word and send it to | |
| CleanWord in order strip | |||
| the stuff that nobody wants. | |||
| There are things in | |||
| parseWord that will kill | |||
| the word, so we will need a | |||
| method of looping through | |||
| the body and rejecting | |||
| words without killing the | |||
| whole function | |||
| i guess keep CleanWord and | |||
| check a return value | |||
| ok, now I have a word so I | |||
| need to send it down the | |||
| parse chain. This chain goes | |||
| ParseCleanPhrase-> | |||
| CleanWord-> | |||
| EvaluateWord. If the word | |||
| gets through the | |||
| entire chain without being | |||
| killed, it will be added at the | |||
| end to our keyword string. | |||
| first would be the function | |||
| that checks for “/” as a | |||
| delimiter and extracts the | |||
| parts of that. This I will call | |||
| “StitchFace” (Denise is more | |||
| normal and calls it | |||
| GetAWordFromString) | |||
| if this finds words, then each | |||
| of these will be sent, in turn, | |||
| down the chain. If | |||
| these get through the entire | |||
| chain without being added or | |||
| killed then they will be | |||
| added rather than tossed. | |||
| FindMin | Private | ParseAndCleanPhrase | This function takes in 6 input |
| (BF.Parse) | Function | values and evaluates to see | |
| what the minimum non | |||
| zero value is. It first creates | |||
| an array as a holder so that | |||
| we can sort the five | |||
| input values in ascending | |||
| order. Thus the minimum | |||
| value will be the first non | |||
| zero value element of the | |||
| array. If we go through | |||
| entire array without finding | |||
| a non zero value, we know | |||
| that there is an error and we | |||
| exit the function. | |||
| CleanWord | Private | ParseAndCleanPhrase | This function tries to clean |
| (BF.Parse) | Function | up a word in a meeting text. | |
| It first of all determines if the | |||
| string is of a valid length. It | |||
| then passes it through a | |||
| series of tests to see it is | |||
| clean and when needed, it | |||
| will edit the word and strip | |||
| unnecessary characters off of | |||
| it. Such tests includes | |||
| getting rid of file extensions, | |||
| non chars, numbers etc. | |||
| EvaluateWord | Private | ParseAndCleanPhrase | This function tests to see if |
| (BF.Parse) | Function | this word is in the stop list so | |
| it can determine whether to | |||
| eliminate the word from the | |||
| original meeting text. If a | |||
| word is not in the stoplist, it | |||
| should stay around as a | |||
| keyword and this function | |||
| exits beautifully with no | |||
| errors. However, if the | |||
| words is a stopword, an error | |||
| must be returned. We must | |||
| properly delimit the input | |||
| test string so we don't | |||
| accidentally retrieve sub | |||
| strings. | |||
| GoPatternMatch | Public | GoBF | This procedure is called |
| (BF.Pattern | Sub | when our QueryMethod is set | |
| Match) | to complex query meaning | ||
| we do want to do all the | |||
| pattern matching stuff. It's a | |||
| simple wrapper function | |||
| which initializes some arrays | |||
| and then invokes pattern | |||
| matching on the title and the | |||
| body. | |||
| MatchPatterns | Public | GoPattern Match | This procedure loops through |
| (BF.Pattern | Sub | every pattern in the pattern | |
| Match) | table and tries to identify | ||
| different fields within a | |||
| meeting text specified by | |||
| sInEvalString. For debugging | |||
| purposes it also | |||
| tries to tabulate how many | |||
| times a certain pattern was | |||
| triggered and stores it in | |||
| gTabulateMatches to see | |||
| whichp pattern fired the | |||
| most. gTabulateMatches is | |||
| stored as a global because we | |||
| want to be able to run a batch | |||
| file of 40 or 50 test strings | |||
| and still be able to know how | |||
| often a pattern was triggered. | |||
| MatchAPattern | Private | MatchPatterns | This function goes through |
| (BF.Pattern | Function | each element in the current | |
| Match) | pattern. It first evaluates to | ||
| determine whether element is | |||
| a placeholder or an indicator. | |||
| If it is a placeholder, then it | |||
| will try to bind the | |||
| placeholder with some value. | |||
| If it is an indicator, then we | |||
| try to locate it. There is a | |||
| trick however. Depending on | |||
| whether we are at current | |||
| element is the head of the | |||
| pattern or | |||
| not we want to take | |||
| different actions. If we are | |||
| at the head, we want to | |||
| look for the indicator or | |||
| the placeholder. If we | |||
| can't find it, then we | |||
| know that the current | |||
| pattern doesn't exist and | |||
| we quit. However, if it is | |||
| not the head, then we | |||
| continue looking, because | |||
| there may still be a head | |||
| somewhere. We retry in | |||
| this case. | |||
| MeetingField | Private | MatchAPattern | This function uses a big |
| (BF.Pattern | Function | switch statement to first | |
| Match) | determine what kind of | ||
| placeholder we are talking | |||
| about and depending on what | |||
| type of placeholder, we have | |||
| specific requirements | |||
| and different binding criteria | |||
| as specified in the | |||
| subsequent functions called | |||
| such as BindNames, | |||
| BindTime etc. If binding is | |||
| successful we add it to our | |||
| guessing record. | |||
| BindNames | Private | MatchMeetingField | In this function, we try to |
| (BF.Pattern | Function | match names to the | |
| Match) | corresponding placeholder | ||
| $PEOPLE$. Names are | |||
| defined as any consecutive | |||
| two words which are | |||
| capitalized. We also what to | |||
| retrieve a series of names | |||
| which are connected by and, | |||
| or & so we look until we | |||
| don't see any of these 3 | |||
| separators anymore. Note | |||
| that we don't want to bind | |||
| single word names because it | |||
| is probably too general anyway | |||
| so we don't want to produce | |||
| broad but irrelevant results. | |||
| This function calls | |||
| BindAFullName which binds | |||
| one name so in a sence | |||
| BindNames collects all the | |||
| results from BindAFullName | |||
| BindAFullName | Private | BindNames | This function tries to bind a |
| (BF.Pattern | Function | full name. If the $PEOPLE$ | |
| Match) | placeholder is not the head of | ||
| the pattern, we know that it | |||
| has to come right at the | |||
| beginning of the test string | |||
| because we have been | |||
| deleting information off of | |||
| the head of the string all | |||
| along. | |||
| If it is the head, we search | |||
| until we find something that | |||
| looks like a full name. If we | |||
| can't find it, then there's no | |||
| such pattern in the text | |||
| entirely and we quit entirely | |||
| from this pattern. This | |||
| should eventually return us to | |||
| the next pattern in | |||
| MatchPatterns. | |||
| GetNextWordAfterWhiteSpace | Private | BindAFull | This function grabs the next |
| (BF.Pattern | Function | Name, | word in a test string. It looks |
| Match) | BindTime, | for the next word after white | |
| BindCompanyTopicLoc | spaces, @ or /. The word is | ||
| defined to end when we | |||
| encounter another one of | |||
| these white spaces or | |||
| separators. | |||
| BindTime | Private | MatchMeetingField | Get the immediate next word |
| (BF.Pattern | Function | and see if it looks like a time | |
| Match) | pattern. If so we've found a | ||
| time and so we want to add it | |||
| to the record. We probably | |||
| should add more time | |||
| patterns. But people don't | |||
| seem to like to enter the time | |||
| in their titles these days | |||
| especially since we now have | |||
| tools like OutLook. | |||
| BindCompanyTopicLoc | Private | MatchMeetingField | This function finds a |
| (BF.Pattern | Function | continuous capitalized string | |
| Match) | and binds it to stMatch | ||
| which is passed by reference | |||
| from MatchMeetingField. A | |||
| continous capitalized string | |||
| is a sequence of capitalized | |||
| words which are not | |||
| interrupted | |||
| by things like,. etc. There's | |||
| probably more stuff we can | |||
| add to the list of | |||
| interruptions. | |||
| LocatePatternHead | Private | MatchAPattern | This function tries to locate |
| (BF.Pattern | Function | an element which is an | |
| Match) | indicator. Note that this | ||
| indicator SHOULD BE AT | |||
| THE HEAD of the pattern | |||
| otherwise it would have gone | |||
| to the function | |||
| LocateIndicator instead. | |||
| Therefore, we keep on | |||
| grabbing the next word until | |||
| either there's no word for us | |||
| to grab (quit) or if we find | |||
| one of the indicators we are | |||
| looking for. | |||
| ContainInArray | Private | LocatePattern | ‘This function is really |
| (BF.Pattern | Function | Head, | simple. It loops through all |
| Match) | LocateIndicator | the elements in the array | |
| ‘to find a matching string. | |||
| LocateIndicator | Private | MatchAPattern | This function tries to locate |
| (BF.Pattern | Function | an element which is an | |
| Match) | indicator. Note that this | ||
| indicator is NOT at the head | |||
| of the pattern otherwise it | |||
| would have gone to | |||
| LocatePatternHead instead. | |||
| Because of this, if our | |||
| pattern is to be satisfied, the | |||
| next word we grab HAS to | |||
| be the indicator or else we | |||
| would have failed. Thus we | |||
| only grab one word, test to | |||
| see if it is a valid indicator | |||
| and then return result. | |||
| InitializeGuessesRecord | Private | MatchAPattern | This function reinitializes |
| (BF.Pattern | Sub | our temporary test structure | |
| Match) | because we have already | ||
| transfered the info to the | |||
| permanent structure, we can | |||
| reinitialize it so they each | |||
| have one element | |||
| AddToMeetingRecord | Private | MatchAPattern | This function is only called |
| (BF.Pattern | Sub | when we know that the | |
| Match) | information stored in | ||
| tInCurrGuesses is valid | |||
| meaning that it represents | |||
| legitimate guesses of meeting | |||
| fields ready to be stored in | |||
| the permanent | |||
| record, tInMeetingRecord. | |||
| We check to make sure that | |||
| we do not store duplicates | |||
| and we also what to clean up | |||
| what we want to store so that | |||
| there's no information such | |||
| as punctuation, etc. The | |||
| reason why we don't clean up | |||
| until now is to save time. We | |||
| don't waste resources calling | |||
| ParseAndCleanPhrase until | |||
| we know for sure that we are | |||
| going to add it permanently. | |||
| NoDuplicateEntry | Private | AddToMeetingRecord | This function loops through |
| (BF.Pattern | Function | each element in the array to | |
| Match) | make sure that the test string | ||
| aString is not the same as any | |||
| of the strings already stored | |||
| in the array. Slightly different | |||
| from ContainInArray. | |||
| SearchAltaVista | Public | GoBackGroundFinder | This function prepares a |
| (BF.Search) | Function | query to be submited to | |
| AltaVista Search engine. It | |||
| submits it and then parses the | |||
| returning result in the | |||
| appropriate format | |||
| containing the title, URL and | |||
| body/summary of each story | |||
| retrieved. The number of | |||
| stories retrieved is specified | |||
| by the constant | |||
| NUM_AV_STORIES. | |||
| Important variables include | |||
| stURLAltaVista used to store | |||
| query to submit | |||
| stResultHTML used to store | |||
| html from page specified by | |||
| stURLAltaVista. | |||
| ConstructAltaVistaURL | Private | SearchAltaVista | This function constructs the |
| (BF.Search) | Function | URL string for the alta vista | |
| search engine using the | |||
| advanced query search mode. | |||
| It includes the keywords to | |||
| be used, the language and | |||
| how we want to rank the | |||
| search. Depending on | |||
| whether we want to use the | |||
| results of our pattern | |||
| matching unit, we construct | |||
| our query differently. | |||
| ConstructSimpleKeyWord | Private | ConstructAltaVistaURl, | This function marches down |
| (BF.Search) | Function | ConstructNewsPageURL | the list of keywords stored in |
| the stTitleKW or stBodyKW | |||
| fields of the input meeting | |||
| record and links them up into | |||
| one string with each keyword | |||
| separated by a connector as | |||
| determined by the input | |||
| variable stInConnector. | |||
| Returns this newly | |||
| constructed string. | |||
| ConstructComplexAVKeyWord | Private | ConstructAltaVistaURL | This function constructs the |
| (BF.Search) | Function | keywords to be sent to the | |
| AltaVista site. Unlike | |||
| ConstructSimpleKeyWord | |||
| which simply takes all the | |||
| keywords from the title to | |||
| form the query, this function | |||
| will look at the results of BF's | |||
| pattern matching process | |||
| and see if we are able to | |||
| identify any specific | |||
| company names or topics for | |||
| constructing | |||
| the queries. Query will | |||
| include company and topic | |||
| identified and default to | |||
| simple query if we cannot | |||
| identify either company or | |||
| topic. | |||
| JoinWithConnectors | Private | ConstructComplexAVKeyWord, | This function simply replaces |
| (BF.Search) | Function | ConstructComplexNPKeyWord, | the spacesbetween the words |
| RefineWith | within the string with a | ||
| Rank | connector which is specified | ||
| by the input. | |||
| RefineWithDate | Private | ConstructAltaVistaURL | This function constructs the |
| (NOT | Function | date portion of the alta vista | |
| CALLED AT | query and returns this portion | ||
| THE | of the URL as a string. It | ||
| MOMENT) | makes sure that alta vista | ||
| (BF.Search) | searches for articles within | ||
| the past PAST_NDAYS. | |||
| RefineWithRank | Private | ConstructAltaVistaURL | This function constructs the |
| (BF.Search) | Function | string needed to passed to | |
| Altavista in order to rank an | |||
| advanced query search. If we | |||
| are constructing the simple | |||
| query we will take in all the | |||
| keywords from the title. For | |||
| the complex query, we will | |||
| take in words from company | |||
| and topic, much the same | |||
| way we formed the query in | |||
| ConstructComplexAVKeyWord. | |||
| IdentifyBlock | Public | SearchAltaVista, | This function extracts the |
| (BF.Parse) | Function | SearchNewsPage | block within a string marked |
| by the beginning and the | |||
| ending tag given as inputs | |||
| starting at a certain | |||
| location(iStart). The block | |||
| retrieved does not include the | |||
| tags themselves. If the block | |||
| cannot be identified with the | |||
| specified delimiters, we | |||
| return unsuccessful through | |||
| the parameter | |||
| iReturnSuccess passed to use | |||
| by reference. The return type | |||
| is the block retrieved. | |||
| IsOpenURLError | Public | SearchAltaVista, | This function determines |
| (BF.Error) | Function | SearchNewsPage | whether the error |
| encountered is that of a | |||
| timeout error. It restores the | |||
| mouse to default arrow and | |||
| then returns true if it is a time | |||
| out or false otherwise. | |||
| SearchNewsPage | Public | GoBackGroundFinder | This function prepares a |
| (BF.Search) | Function | query to be submited to | |
| NewsPage Search | |||
| engine. It submits it and then | |||
| parses the returning result in | |||
| the appropriate format | |||
| containing the title, URL and | |||
| body/summary of each story | |||
| retrieved. The number of | |||
| stories retrieved is specified | |||
| by the constant | |||
| UM_NP_STORIES | |||
| ConstructNewsPageURL | Private | SearchNewsPage | This function constructs the |
| (BF.Search) | Function | URL to send to the | |
| NewsPage site. It uses the | |||
| information contained in the | |||
| input meeting record to | |||
| determine what keywords to | |||
| use. Also depending whether | |||
| we want simple or complex | |||
| query, we call diffent | |||
| functions to form strings. | |||
| ConstructComplexNPKeyWord | Private | ConstructNewsPageURL | This function constructs the |
| (BF.Search) | Function | keywords to be send to the | |
| NewsPage site. | |||
| UnlikeConstructKeyWordString | |||
| which simply takes all | |||
| the keywords from the title to | |||
| form the query, this function | |||
| will look at the results of BF's | |||
| pattern matching process | |||
| and see if we are able to | |||
| identify any specific | |||
| company names or topics for | |||
| constructing | |||
| the queries. Since newspage | |||
| works best when we have a | |||
| company name, we'll use | |||
| only the company name and | |||
| only if there is no company | |||
| will we use topic. | |||
| ConstructOverallResult | Private | GoBackGroundFinder | This function takes in as |
| (BF.Main) | Function | input an array of strings | |
| (stInStories) and a | |||
| MeetingRecord which stores | |||
| the information for the | |||
| current meeting. Each | |||
| element in the array stores | |||
| the stories retrieved from | |||
| each information source. | |||
| The function simply | |||
| constructs the appropriate | |||
| output to send to Munin | |||
| including a return message | |||
| type to let Munin know that | |||
| it is the BF responding and | |||
| also the original user_id and | |||
| meeting title so Munin | |||
| knows which meeting BF is | |||
| talking about. | |||
| ConnectAndTransferToMunin | Public | GoBackGroundFinder | This function allows |
| (BF.Main) | Sub | Background Finder to | |
| connect to Munin and | |||
| eventually transport | |||
| information to Munin. We | |||
| will be using the UDP | |||
| protocol instead of the TCP | |||
| protocol so we have to set up | |||
| the remote host and port | |||
| correctly. We use a global | |||
| string to store gResult | |||
| Overall because although it | |||
| is unecessary with UDP, it is | |||
| needed with TCP and if we | |||
| ever switch back don't want | |||
| to change code. | |||
| DisconnectFromMuninAndQuit | Public | ||
| (BF.Main) | Sub | ||
[0152] FIG. 6 is a flowchart of the actual code utilized to prepare and submit searches to the Alta Vista and Newspage search engines in accordance with a preferred embodiment. Processing commences at function block 610 where a command line is utilized to update a calendar entry with specific calendar information. The message is next posted in accordance with function block 620 and a meeting record is created to store the current meeting information in accordance with function block 630. Then, in function block 640 the query is submitted to the Alta Vista search engine and in function block 650, the query is submitted to the Newspage search engine. When a message is returned from the search engine, it is stored in a results data structure as shown in function block 660 and the information is processed and stored in summary form in a file for use in preparation for the meeting as detailed in function block 670.
[0153] FIG. 7 provides more detail on creating the query in accordance with a preferred embodiment. Processing commences at function block 710 where the meeting record is parsed to obtain potential companies, people, topics, location and a time. Then, in function block 720, at least one topic is identified and in function block 720, at least one company name is identified and finally in function block 740, a decision is made on what material to transmit to the file for ultimate consumption by the user.
[0154] FIG. 8 is a variation on the query theme presented in FIG. 7 . A meeting record is parsed in function block 800, a company is identified in function block 820, a topic is identified in function block 830 and finally in function block 840 the topic and or the company is utilized in formulating the query.
[0155] Alternative embodiments for adding various specific features for specific user requirements are discussed below.
Enhance Target Rate for Pattern Matching
[0156] To increase BF's performance, more patterns/pattern groups are added to the procedure “CreatePatterns.” The existing code for declaring patterns can be used as a template for future patterns. Because everything is stored as dynamic arrays, it is convenient to reuse code by cutting and pasting. The functions BindName, BindTime, BindCompanyLocTopic which are responsible for associating a value with a placeholder can be enhanced. The enhancement is realized by increasing the set of criteria for binding a certain meeting field in order to increase the number of binding values. For example, BindTime currently accepts and binds all values in the form of ##:## or #:##. To increase the times we can bind, we may want BindTime to also accept the numbers 1 to 12 followed by the more aesthetic time terminology “o'clock.” Vocabulary based recognition algorithms and assigning an accuracy rate to each guess BF makes allowing only guesses which meet a certain threshold to be valid.
[0157] Depending on what location the system identifies through pattern matching or alternatively depending on what location the user indicates as the meeting place, a system in accordance with a preferred embodiment suggests a plurality of fine restaurants whenever it detects the words lunch/dinner/breakfast. We can also use a site like company finder to confirm what we got is indeed a company name or if there is no company name that pattern matching can identify, we can use a company finder web site as a “dictionary” for us to determine whether certain capitalized words represent a company name. We can even display stock prices and breaking news for a company that we have identified.
Wireless Bargain Identification in Accordance with a Preferred Embodiment
[0158] FIG. 9 is a flow diagram that depicts the hardware and logical flow of control for a device and a software system designed to allow Web-based comparison shopping in conventional, physical, non-Web retail environments. A wireless phone or similar hand-held wireless device 920 with Internet Protocol capability is combined with a miniature barcode reader 910 (installed either inside the phone or on a short cable) and used to scan the Universal Product Code (UPC) bar code on a book or other product 900. The wireless device 920 transmits the bar code via an antennae 930 to the Pocket BargainFinder Service Module (running on a Web server) 940, which converts it to (in the case of books) its International Standard Book Number or (in the case of other products) whatever identifier is appropriate. The Service Module then contacts the appropriate third-party Web site(s) to find price, shipping and availability information on the product from various Web suppliers 950. This information is formatted and displayed on the hand-held device's screen. The IP wireless phone or other hand held device 920 utilizes a wireless modem such as a Ricochet SE Wireless Modem from Metricom. Utilizing this device, a user can hang out in a coffee shop with a portable computer perched on a rickety little table, with a latte sloshing dangerously close to the keyboard, and access the Internet at speeds rivaling direct connect via a telephone line.
[0159] The 8-ounce Ricochet SE Wireless Modem is about as large as a pack of cigarettes and setup is extremely simple, simply attach the modem to the back of your portable's screen with the included piece of Velcro, plug the cable into the serial port, flip up the stubby antenna, and transmit. Software setup is equally easy: a straightforward installer adds the Ricochet modem drivers and places the connection icon on your desktop. The functional aspects of the modem are identical to that of a traditional telephone modem.
[0160] Of course, wireless performance isn't nearly as reliable as a traditional dial-up phone connection. We were able to get strong connections in several San Francisco locations as long as we stayed near the windows. But inside CNET's all-brick headquarters, the Ricochet couldn't connect at all. When you do get online, performance of up to 28.8 kbps is available with graceful degradation to slower speeds. But even the slower speeds didn't disappoint. Compared to the alternative—connecting via a cellular modem—the Ricochet is much faster, more reliable, and less expensive to use. Naturally, the SE Wireless is battery powered. The modem has continuous battery life of up to 12 hours. And in accordance with a preferred embodiment, we ran down our portable computer's dual cells before the Ricochet started to fade.
[0161] Thus, utilizing the wireless modem, a user may utilize the web server software 940 to identify the right product 950 and then use an appropriate device's key(s) to select a supplier and place an order in accordance with a preferred embodiment. The BargainFinder Service Module then consummates the order with the appropriate third-party Web supplier 960.
mySite! Personal Web Site & Intentions Value Network Prototype
[0162] mySite! is a high-impact, Internet-based application in accordance with a preferred embodiment that is focused on the theme of delivering services and providing a personalized experience for each customer via a personal web site in a buyer-centric world. The services are intuitively organized around satisfying customer intentions—fundamental life needs or objectives that require extensive planning decisions, and coordination across several dimensions, such as financial planning, healthcare, personal and professional development, family life, and other concerns. Each member owns and maintains his own profile, enabling him to create and browse content in the system targeted specifically at him. From the time a demand for products or services is entered, to the completion of payment, intelligent agents are utilized to conduct research, execute transactions and provide advice. By using advanced profiling and filtering, the intelligent agents learn about the user, improving the services they deliver. Customer intentions include Managing Daily Logistics (e.g., email, calendar, contacts, to-do list, bill payment, shopping, and travel planning); and Moving to a New Community (e.g., finding a place to live, moving household possessions, getting travel and shipping insurance coverage, notifying business and personal contacts, learning about the new community). From a consumer standpoint, mySite! provides a central location where a user can access relevant products and services and accomplish daily tasks with ultimate ease and convenience.
[0163] From a business standpoint, mySite! represents a value-added and innovative way to effectively attract, service, and retain customers. Intention value networks allow a user to enter through a personalized site and, and with the assistance of a learning, intelligent agent, seamlessly interact with network participants. An intention value network in accordance with a preferred embodiment provides superior value. It provides twenty four hour a day, seven days a week access to customized information, advice and products. The information is personalized so that each member views content that is highly customized to assure relevance to the required target user.
Egocentric Interface
[0164] An Egocentric Interface is a user interface crafted to satisfy a particular user's needs, preferences and current context. It utilizes the user's personal information that is stored in a central profile database to customize the interface. The user can set security permissions on and preferences for interface elements and content. The content integrated into the Egocentric Interface is customized with related information about the user. When displaying content, the Egocentric Interface will include the relationship between that content and the user in a way that demonstrates how the content relates to the user. For instance, when displaying information about an upcoming ski trip the user has signed up for, the interface will include information about events from the user's personal calendar and contact list, such as other people who will be in the area during the ski trip. This serves to put the new piece of information into a context familiar to the individual user.
[0165] FIG. 10A describes the Intention Value Network Architecture implementation for the World Wide Web. For simplification purposes, this diagram ignores the complexity pertaining to security, scalability and privacy. The customer can access the Intention Value Network with any Internet web browser 1010, such as Netscape Navigator or Microsoft Internet Explorer, running on a personal computer connected to the Internet or a Personal Digital Assistant with wireless capability. See FIG. 17 for a more detailed description of the multiple methods for accessing an Intention Value Network. The customer accesses the Intention Value Network through the unique name or IP address associated with the Integrator's Web Server 1020. The Integrator creates the Intention Value Network using a combination of resources, such as the Intention Database 1030, the Content Database 1040, the Supplier Profile Database 1050, and the Customer Profile Database 1060.
[0166] The Intention Database 1030 stores all of the information about the structure of the intention and the types of products and services needed to fulfill the intention. Information in this database includes intention steps, areas of interest, layout templates and personalization templates. The Content Database 1040 stores all of the information related to the intention, such as advice, referral information, personalized content, satisfaction ratings, product ratings and progress reports.
[0167] The Supplier Profile Database 1050 contains information about the product and service providers integrated into the intention. The information contained in this database provides a link between the intention framework and the suppliers. It includes product lists, features and descriptions, and addresses of the suppliers' product web sites. The Customer Profile Database 1060 contains personal information about the customers, such as name, address, social security number and credit card information, personal preferences, behavioral information, history, and web site layout preferences. The Supplier's Web Server 1070 provides access to all of the supplier's databases necessary to provide information and transactional support to the customer.
[0168] The Product Information Database 1080 stores all product-related information, such as features, availability and pricing. The Product Order Database 1090 stores all customer orders. The interface to this database may be through an Enterprise Resource Planning application offered by SAP, Baan, Oracle or others, or it may be accessible directly through the Supplier's Web Server or application server. The Customer Information Database 1091 stores all of the customer information that the supplier needs to complete a transaction or maintain customer records.
[0169] FIG. 10B is a flowchart providing the logic utilized to create a web page within the Egocentric Interface. The environment assumes a web server and a web browser connected through a TCP/IP network, such as over the public Internet or a private Intranet. Possible web servers could include Microsoft Internet Information Server, Netscape Enterprise Server or Apache. Possible web browsers include Microsoft Internet Explorer or Netscape Navigator. The client (i.e. web browser) makes a request 1001 to the server (i.e. web server) for a particular web page. This is usually accomplished by a user clicking on a button or a link within a web page. The web server gets the layout and content preferences 1002 for that particular user, with the request to the database keyed off of a unique user id stored in the client (i.e. web browser) and the User profile database 1003. The web server then retrieves the content 1004 for the page that has been requested from the content database 1005. The relevant user-centric content, such as calendar, email, contact list, and task list items are then retrieved 1006. (See FIG. 11 for a more detailed description of this process.) The query to the database utilizes the user content preferences stored as part of the user profile in the User profile database 1003 to filter the content that is returned. The content that is returned is then formatted into a web page 1007 according to the layout preferences defined in the user profile. The web page is then returned to the client and displayed to the user 1008.
[0170] FIG. 11 describes the process of retrieving user-centric content to add to a web page. This process describes 1006 in FIG. 10B in a more detailed fashion. It assumes that the server already has obtained the user profile and the existing content that is going to be integrated into this page. The server parses 1110 the filtered content, looking for instances of events, contact names and email addresses. If any of these are found, they are tagged and stored in a temporary holding space. Then, the server tries to find any user-centric content 1120 stored in various databases. This involves matching the tagged items in the temporary storage space with calendar items 1130 in the Calendar Database 1140; email items 1115 in the Email Database 1114; contact items 1117 in the Contact Database 1168; task list items 1119 in the Task List Database 1118; and news items 1121 in the News Database 1120. After retrieving any relevant user-centric content, it is compiled together and returned 1122.
User Persona
[0171] The system allows the user to create a number of different personas that aggregate profile information into sets that are useful in different contexts. A user may create one persona when making purchases for his home. This persona may contain his home address and may indicate that this user is looking to find a good bargain when shopping. The same user may create a second persona that can be used when he is in a work context. This persona may store the user's work address and may indicate that the user prefers certain vendors or works for a certain company that has a discount program in place. When shopping for work-related items, the user may use this persona. A persona may also contain rules and restrictions. For instance, the work persona may restrict the user to making airline reservations with only one travel agent and utilizing booking rules set up by his employer.
[0172] FIG. 12 describes the relationship between a user, his multiple personas and his multiple profiles. At the User Level is the User Profile 1200. This profile describes the user and his account information. There is one unique record in the database for each user who has an account. Attached to each user are multiple Personas 1220, 1230 & 1240. These Personas are used to group multiple Profiles into useful contexts. For instance, consider a user who lives in San Francisco and works in Palo Alto, but has a mountain cabin in Lake Tahoe. He has three different contexts in which he might be accessing his site. One context is work-related. The other two are home-life related, but in different locations. The user can create a Persona for Work 1220, a Persona for Home 1230, and a Persona for his cabin home 1240. Each Persona references a different General Profile. 1250, 1260 and 1270 which contains the address for that location. Hence, there are three General Profiles. Each Persona also references one of two Travel Profiles. The user maintains a Work Travel Profile 1280 that contains all of the business rules related to booking tickets and making reservations. This Profile may specify, for instance, that this person only travels in Business or First Class and his preferred airline is United Airlines. The Work Persona references this Work Travel Profile. The user may also maintain a Home Travel Profile 1290 that specifies that he prefers to travel in coach and wants to find non-refundable fairs, since they are generally cheaper. Both the Persona for Home and the Persona for the cabin home point to the Home Travel Profile.
[0173] FIG. 13 describes the data model that supports the Persona concept. The user table 1310 contains a record for each user who has an account in the system. This table contains a username and a password 1320 as well as a unique identifier. Each user can have multiple Personas 1330, which act as containers for more specialized structures called Profiles 1340. Profiles contain the detailed personal information in Profile Field 1350 records. Attached to each Profile are sets of Profile Restriction 1360 records. These each contain a Name 1370 and a Rule 1380, which define the restriction. The Rule is in the form of a pattern like (if x then y), which allows the Rule to be restricted to certain uses. An example Profile Restriction would be the rule that dictates that the user cannot book a flight on a certain airline contained in the list. This Profile Restriction could be contained in the “Travel” Profile of the “Work” Persona set up by the user's employer, for instance. Each Profile Field also contains a set of Permissions 1390 that are contained in that record. These permissions dictate who has what access rights to that particular Profile Field's information.
Intention-Centric Interface
[0174] Satisfying Customer Intentions, such as Planning for Retirement or Relocating requires a specialized interface. Customer Intentions require extensive planning and coordination across many areas, ranging from financial security, housing and transportation to healthcare, personal and professional development, and entertainment, among others. Satisfying Intentions requires a network of complementary businesses, working across industries, to help meet consumers' needs.
[0175] An Intention-Centric Interface is a user interface designed to help the user manage personal Intentions. At any given point, the interface content is customized to show only content that relates to that particular Intention. The Intention-Centric Interface allows the user to manage the process of satisfying that particular Intention. This involves a series of discrete steps and a set of content areas the user can access. At any point, the user can also switch the interface to manage a different Intention, and this act will change the content of the interface to include only that content which is relevant to the satisfaction of the newly selected Intention.
[0176] FIG. 14 provides a detailed description of the data model needed to support an Intention-Centric Interface. Each User Persona 1410 (see FIG. 13 for a more detailed description of the Persona data model.) has any number of active User Intentions 1420. Each active User Intention is given a Nickname 1430, which is the display name the user sees on the screen. Each active User Intention also contains a number of Data Fields 1440, which contain any user data collected throughout the interaction with the user. For instance, if the user had filled out a form on the screen and one of the fields was Social Security Number, the corresponding Data Field would contain Name=“SSN” 1450, Value=“999-99-9999” 1460. Each User Intention also keeps track of Intention Step 1470 completion status. The Completion 1480 field indicates whether the user has completed the step. Every User Intention is a user-specific version of a Generic Intention 1490, which is the default model for that Intention for all users. The Generic Intention is customized through Custom Rules 1411 and 1412 that are attached to the sub-steps in the Intention. These Custom Rules are patterns describing how the system will customize the Intention for each individual user using the individual user's profile information.
Statistical Agent
[0177] An agent keeps track of key statistics for each user. These statistics are used in a manner similar to the Tamagochi virtual reality pet toy to encourage certain behaviors from the user. The statistics that are recorded are frequency of login, frequency of rating of content such as news articles, and activity of agents, measured by the number of tasks which it performs in a certain period. This information is used by the system to emotionally appeal to the user to encourage certain behaviors.
[0178] FIG. 15 describes the process for generating the page that displays the agent's current statistics. When the user requests the agent statistics page 1510 with the client browser, the server retrieves the users' statistics 1520 from the users' profile database 1530. The server then performs the mathematical calculations necessary to create a normalized set of statistics 1540. The server then retrieves the formulas 1550 from the content database 1560 that will be used to calculate the user-centric statistics. Graphs are then generated 1570 using the generic formulas and that user's statistics. These graphs are inserted into a template to create the statistics page 1580. This page is then returned to the user 1590.
Personalized Product Report Service
[0179] The system provide Consumer Report-like service that is customized for each user based on a user profile. The system records and provides ratings from users about product quality and desirability on a number of dimensions. The difference between this system and traditional product quality measurement services is that the ratings that come back to the users are personalized. This service works by finding the people who have the closest match to the user's profile and have previously rated the product being asked for. Using this algorithm will help to ensure that the product reports sent back to the user only contain statistics from people who are similar to that user.
[0180] FIG. 16 describes the algorithm for determining the personalized product ratings for a user. When the user requests a product report 1610 for product X, the algorithm retrieves the profiles 1620 from the profile database 1630 (which includes product ratings) of those users who have previously rated that product. Then the system retrieves the default thresholds 1640 for the profile matching algorithm from the content database 1650. It then maps all of the short list of users along several dimensions specified in the profile matching algorithm 1660. The top n (specified previously as a threshold variable) nearest neighbors are then determined and a test is performed to decide if they are within distance y (also specified previously as a threshold variable) of the user's profile in the set 1670 using the results from the profile matching algorithm. If they are not within the threshold, then the threshold variables are relaxed 1680, and the test is run again. This processing is repeated until the test returns true. The product ratings from the smaller set of n nearest neighbors are then used to determine a number of product statistics 1690 along several dimensions. Those statistics are inserted into a product report template 1695 and returned to the user 1697 as a product report.
Personal Profile and Services Ubiquity
[0181] This system provides one central storage place for a person's profile. This storage place is a server available through the public Internet, accessible by any device that is connected to the Internet and has appropriate access. Because of the ubiquitous accessibility of the profile, numerous access devices can be used to customize services for the user based on his profile. For example, a merchant's web site can use this profile to provide personalized content to the user. A Personal Digital Assistant (PDA) with Internet access can synchronize the person's calendar, email, contact list, task list and notes on the PDA with the version stored in the Internet site. This enables the person to only have to maintain one version of this data in order to have it available whenever it is needed and in whatever formats it is needed.
[0182] FIG. 17 presents the detailed logic associated with the many different methods for accessing this centrally stored profile. The profile database 1710 is the central storage place for the users' profile information. The profile gateway server 1720 receives all requests for profile information, whether from the user himself or merchants trying to provide a service to the user. The profile gateway server is responsible for ensuring that information is only given out when the profile owner specifically grants penmission. Any device that can access the public Internet 1730 over TCP/IP (a standard network communications protocol) is able to request information from the profile database via intelligent HTTP requests. Consumers will be able to gain access to services from devices such as their televisions 1740, mobile phones, Smart Cards, gas meters, water meters, kitchen appliances, security systems, desktop computers, laptops, pocket organizers, PDAs, and their vehicles, among others. Likewise, merchants 1750 will be able to access those profiles (given permission from the consumer who owns each profile), and will be able to offer customized, personalized services to consumers because of this.
[0183] One possible use of the ubiquitous profile is for a hotel chain. A consumer can carry a Smart Card that holds a digital certificate uniquely identifying him. This Smart Card's digital certificate has been issued by the system and it recorded his profile information into the profile database. The consumer brings this card into a hotel chain and checks in. The hotel employee swipes the Smart Card and the consumer enters his Pin number, unlocking the digital certificate. The certificate is sent to the profile gateway server (using a secure transmission protocol) and is authenticated. The hotel is then given access to a certain part of the consumer's profile that he has previously specified. The hotel can then retrieve all of the consumer's billing information as well as preferences for hotel room, etc. The hotel can also access the consumer's movie and dining preferences and offer customized menus for both of them. The hotel can offer to send an email to the consumer's spouse letting him/her know the person checked into the hotel and is safe. All transaction information can be uploaded to the consumer's profile after the hotel checks him in. This will allow partners of the hotel to utilize the information about the consumer that the hotel has gathered (again, given the consumer's permission).
Intention Value Network
[0184] In an Intention Value Network, the overall integrator system coordinates the delivery of products and services for a user. The integrator manages a network of approved suppliers providing products and services, both physical and virtual, to a user based on the user's preferences as reflected in the user's profile. The integrator manages the relationship between suppliers and consumers and coordinates the suppliers' fulfillment of consumers' intentions. It does this by providing the consumer with information about products and suppliers and offering objective advice, among other things.
[0185] FIG. 18 discloses the detailed interaction between a consumer and the integrator involving one supplier. The user accesses a Web Browser 1810 and requests product and pricing information from the integrator. The request is sent from the user's browser to the integrator's Web/Application Server 1820. The user's preferences and personal information is obtained from an integrator's customer profile database 1830 and returned to the Web/Application server. The requested product information is extracted from the supplier's product database 1840 and customized for the particular customer. The Web/Application server updates the supplier's customer information database 1850 with the inquiry information about the customer. The product and pricing information is then formatted into a Web Page 1860 and returned to the customer's Web Browser.
Summary Agent
[0186] A suite of software agents running on the application and web servers are programmed to take care of repetitive or mundane tasks for the user. The agents work according to rules set up by the user and are only allowed to perform tasks explicitly defined by the user. The agents can take care of paying bills for the user, filtering content and emails, and providing a summary view of tasks and agent activity. The user interface for the agent can be modified to suit the particular user.
[0187] FIG. 19 discloses the logic in accordance with a preferred embodiment processing by an agent to generate a verbal summary for the user. When the user requests the summary page 1900, the server gets the user's agent preferences 1920, such as agent type, rules and summary level from the user profile database 1930. The server gets the content 1940, such as emails, to do list items, news, and bills, from the content database 1950. The agent parses all of this content, using the rules stored in the profile database, and summarizes the content 1960. The content is formatted into a web page 1970 according to a template. The text for the agent's speech is generated 1980, using the content from the content database 1990 and speech templates stored in the database. This speech text is inserted into the web page 1995 and the page is returned to the user 1997.
Trusted Third Party
[0188] The above scenario requires the web site to maintain a guarantee of privacy of information according to a published policy. This system is the consumer's Trusted Third Party, acting on his behalf in every case, erring on the side of privacy of information, rather than on the side of stimulation of commerce opportunities. The Trusted Third Party has a set of processes in place that guarantee certain complicity with the stated policy.
“meCommerce”
[0189] This word extends the word “eCommerce” to mean “personalized electronic commerce.”
[0190] FIG. 20 illustrates a display login in accordance with a preferred embodiment. The display is implemented as a Microsoft Internet Explorer application with an agent 2000 that guides a user through the process of interacting with the system to customize and personalize various system components to gather information and interact with the user's personal requirements. A user enters a username at 2010 and a password at 2020 and selects a button 2040 to initiate the login procedure. As the logo 2030 suggests, the system transforms electronic commerce into a personalized, so called “me” commerce.
[0191] FIG. 21 illustrates a managing daily logistics display in accordance with a preferred embodiment. A user is greeted by an animated agent 2100 with a personalized message 2190. The user can select from various activities based on requirements, including travel 2110, household chores 2120, finances 2130 and marketplace activities 2140. Icons 2142 for routine tasks such as e-mail, calendaring and document preparation are also provided to facilitate rapid navigation from one activity to another. Direct links 2146 are also provided to allow transfer of news and other items of interest. Various profiles can be selected based on where the user is located. For example, work, home or vacation. The profiles can be added 2170 as a user requires a new profile for another location. Various items 2180 of personal information are collected from the user to support various endeavors. Moreover, permissions 2150 are set for items 2180 to assure information is timely and current.
[0192] FIG. 22 illustrates a user main display in accordance with a preferred embodiment. World 2200 and local news 2210 is provided based on a user's preference. The user has also selected real estate 2230 as an item to provide direct information on the main display. Also, a different agent 2220 is provided based on the user's preference.
[0193] FIG. 23 illustrates an agent interaction in accordance with a preferred embodiment. The agent 2310 is communicating information 2300 to a user indicating that the user's life insurance needs have changed and pointing the user to the chart that best summarizes the information for the user. Particular tips 2395 are provided to facilitate more detailed information based on current user statistics. A chart 2370 of the user's life insurance needs is also highlighted at the center of the display to assist the user in determining appropriate action. A button 2380 is provided to facilitate changing the policy and a set of buttons 2390 are provided to assist a user in selecting various views of the user's insurance requirements.
Event Backgrounder
[0194] An Event Backgrounder is a short description of an upcoming event that is sent to the userjust before an event. The Event Backgrounder is constantly updated with the latest information related to this event. Pertinent information such as itinerary and logistics are included, and other useful information, such as people the user knows who might be in the same location, are also included. The purpose of the Event Backgrounder is to provide the most up-to-date information about an event, drawing from a number of resources, such as public web sites and the user's calendar and contact lists, to allow the user to react optimally in a given situation.
Vicinity Friend Finder
[0195] This software looks for opportunities to tell the user when a friend, family member or acquaintance is or is going to be in the same vicinity as the user. This software scans the user's calendar for upcoming events. It then uses a geographic map to compare those calendar events with the calendar events of people who are listed in his contact list. It then informs the user of any matches, thus telling the user that someone is scheduled to be near him at a particular time.
Information Overload
[0196] The term information overload is now relatively understood in both its definition as well as its implications and consequences. People have a finite amount of attention that is available at any one time, but there is more and more vying for that attention every day. In short, too much information and too little time are the primary factors complicating the lives of most knowledge workers today.
[0197] The first attempts to dynamically deal with information overload were primarily focused on the intelligent filtering of information such that the quantity of information would be lessened. Rather than simply removing random bits of information, however, most of these approaches tried to be intelligent about what information was ultimately presented to the user. This was accomplished by evaluating each document based on the user's interests and discarding the less relevant ones. It follows, therefore, that the quality was also increased.
[0198] Filtering the information is only a first step in dealing with information is this new age. Arguably, just as important as the quality of the document is having ready access to it. Once you have entered a meeting, a document containing critical information about the meeting subject delivered to your office is of little value. As the speed of business continues to increase fueled by the technologies of interconnectedness, the ability to receive quality information wherever and whenever you are becomes critical. This new approach is called intelligent information delivery and is heralding in a new information age.
[0199] A preferred embodiment demonstrates the intelligent information delivery theory described above in an attempt to not only reduce information overload, but to deliver high quality information where and when users' require it. In other words, the system delivers right information to the right person at the right time and the right place.
Active Knowledge Management System Description
[0200] FIG. 24 is a block diagram of an active knowledge management system in accordance with a preferred embodiment. The system consists of the following parts: back-end 2400 connection to one or more servers, personal mobile wireless clients (Awareness Machine)2430, 2436, public clients (Magic Wall) 2410, 2420, web clients 2446, 2448, e-mail clients 2450, 2460.
Back-end Server (2400) Processes
[0201] FIG. 25 is a block diagram of a back end server in accordance with a preferred embodiment. The back-end (2400 of FIG. 24 ) is a computer system that has the following software active: Intelligent Agents Coordinator (Munin) 2580, Information Prioritization Subsystem 2530, a set of continuously and periodically running information gathering and processing Intelligent Agents 2500, 2502 and 2504, User Profiles Database 2542 and supporting software, Information Channels Database 2542 and supporting software, communications software 2550, information transformation software 2560, and auxiliary software.
The Awareness Machine (2446 & 2448 of FIG. 24 )
[0202] The Awareness Machine is a combination of hardware device and software application. The hardware consists of handheld personal computer and wireless communications device. The Awareness Machine reflects a constantly updated state-of-the-owner's-world by continually receiving a wireless trickle of information. This information, mined and processed by a suite of intelligent agents, consists of mail messages, news that meets each user's preferences, schedule updates, background information on upcoming meetings and events, as well as weather and traffic. The Awareness Machine is covered by another patent application.
[0203] FIG. 26 is a block diagram of a magic wall in accordance with a preferred embodiment.
The Magic Wall
[0204] The Magic Wall hardware includes:
-
- [0205] Computer system 2640 connected to the back-end server
- [0206] Sensor array 2634, 2630 and 2632 detects presence, position, and identity of a person
- [0207] Large touch-sensitive display 2620
- [0208] Sound input 2610 /output 2614 hardware
[0209] The Magic Wall software supports:
-
- [0210] Multimedia output compatible with current Web standards
- [0211] Speech recognition
- [0212] Tactile input
- [0213] Intelligent agents representations in the form of speech-enabled animated characters
[0214] The Magic Wall operates as follows:
- [0215] 1. If a user appears in the vicinity of Magic Wall, the sensor array triggers “user here” event that sends an environmental cue containing the person's id and the location to the Intelligent Agent Coordinator.
- [0216] 2. User is identified based on the information returned by the sensor agray.
- [0217] 3. The Magic Wall switches to “locked on the user” mode. If another user approaches, the system will notify him or her that it cannot serve another user while the current user is being served.
- [0218] 4. Intelligent Agent Coordinator is notified about the user presence.
- [0219] 5. The Intelligent Agent Coordinator decides if there is pertinent to that user and Magic Wall location time-sensitive information to show (e.g. traffic report, meeting reminder). If such information exists, it is prepared for delivery. If not, control is transferred to the Information Prioritization Subsystem.
- [0220] 6. Information Prioritization Subsystem decides what information is most relevant to the user based on their personal profile, freshness of the information, and the Intelligent Agent Coordinator's prior suggestions.
- [0221] 7. The page of information identified as the most relevant to the user at this time and place is shown. The act of the information delivery can also include animation and speech output of the intelligent agent representation.
- [0222] 8. If user desires so, he or she can ask Magic Wall to show a particular page. The Magic Wall recognizes the speech fragment and then identifies and shows the requested page.
- [0223] 9. As the user departs from the Magic Wall area, the sensor array triggers “user left” event.
- [0224] 10.The Magic Wall switches back to the waiting state.
Other Clients
[0225] The Web client is a standard browser navigating to a set of Web pages which allow user to see the same information that is available via the Magic Wall.
[0226] The e-mail client is any standard e-mail program.
Intelligent Agent Coordinator Description
[0227] This piece of code is the coordinating agent (or meta-agent) for the Active Knowledge Management system. This means that all communications between the system and each user, as well as communication between the different minion agents are handled (coordinated) by the Intelligent Agent Coordinator. Examples of these minion agents are:
-
- [0228] BackgroundFinder—an agent that parses meeting text determining important keywords and phrases and finds background information on the meeting for each user
- [0229] TrafficFinder—an agent that finds traffic information for each user based on where they live
- [0230] Several other agents that are responsible for doing statistical analysis of the data in each user's profile and updating fields pertinent to that data
[0231] The Intelligent Agent Coordinator 2580 of FIG. 25 is also the user's “interface” to the system, in that whenever the user interacts with the system, regardless of the GUI or other end-user interface, they are ultimately dealing with (asking questions of or sending commands to) the Intelligent Agent Coordinator. The Intelligent Agent Coordinator has four primary responsibilities: 1) monitoring user activities, 2) handling information requests, 3) maintaining each user's profile, and 4) routing information to and from users and to and from the other respective agents.
Monitoring User Activities
[0232] Anytime a user triggers a sensor the Intelligent Agent Coordinator receives an “environmental cue.” These cues not only enable the Intelligent Agent Coordinator to gain an understanding where users' are for information delivery purposes, but also to learn the standard patterns (arrival time, departure time, etc.) of each persons' life. These patterns are constantly being updated and refined in an attempt to increase the system's intelligence when delivering information. For instance, today it is not uncommon for a person to have several email accounts (work-based, home-based, mobile-based, etc.) as well as several different computers involved in the retrieval process for all of these accounts. Thus, for the Intelligent Agent Coordinator to be successful in delivering information to the correct location it must take into account all of these accounts and the times that the user is likely to be accessing them in order to maximize the probability that the user will see the information. This will be discussed further in another section.
Handling Information Requests
[0233] The Intelligent Agent Coordinator handles information requests from other agents in order to personalize information intended for each user and to more accurately reflect each user's interests in the information they are given. These requests will commonly be related to the user's profile. For instance, if an agent was preparing a traffic report for a user it may request the traffic region (search string) of that user from the Intelligent Agent Coordinator. All access to the user's profile data is accessed in this method.
Maintaining User Profiles
[0234] User profiles contain extensive information about the users. This information is a blend of user-specified data and information that the Intelligent Agent Coordinator has learned and extrapolated from each user's information and activities. In order to protect the data contained in the profiles, the Intelligent Agent Coordinator must handle all user information requests. The Intelligent Agent Coordinator is constantly modifying and updating these profiles by watching the user's activities and attempting to learn the patterns of their lives in order to assist in the more routine, mundane tasks. The Intelligent Agent Coordinator also employs other agents to glean meaning from each user's daily activities. These agents mine this data trying to discover indications of current interests, long-term interests, as well as time delivery preferences for each type of information. Another important aspect of the Intelligent Agent Coordinator's observations is that it also tries to determine where each user is physically located throughout the day for routing purposes.
Information Routing
[0235] Most people are mobile throughout their day. The Intelligent Agent Coordinator tries to be sensitive to this fact by attempting to determine, both by observation (unsupervised learning) and from cues from the environment, where users are or are likely to be located. This is certainly important for determining where to send the user's information, but also for determining in which format to send the information. For instance, if a user were at her desk and using the web client, the Intelligent Agent Coordinator would be receiving indications of activity from her PC and would know to send any necessary information there. In addition, because desktop PCs are generally quite powerful, a full-featured, graphically intense version could be sent. However, consider an alternative situation: the Intelligent Agent Coordinator has received an indication (via the keycard reader next to the exit) that you have just left the building. Minutes later the Intelligent Agent Coordinator also receives notification that you have received an urgent message. The Intelligent Agent Coordinator, knowing that you have left the building and having not received any other indications, assumes that you are reachable via your handheld device (for which it also knows the capabilities) and sends the text of the urgent message there, rather than a more graphically-oriented version.
Inherent Innovations
[0236] The Active Knowledge Management system represents some of the most advanced thinking in the world of knowledge management and human computer interaction. Some of the primary innovations include the following:
-
- [0237] The Intelligent Agent Coordinator as illustrated above.
- [0238] The development, demonstration, and realization of the theory of Intelligent Information Delivery
- [0239] Support for several channels of information delivery, all of which utilize a common back-end. For instance, if a user is in front of a Magic Wall the information will be presented in a multimedia-rich form. If the system determines that the user is mobile, the information will be sent by to their Awareness Machine in standard text. It facilitates delivery of information whenever and wherever a user requires the information.
- [0240] Personalization of information based not only on a static user profile, but also by taking into account history of the user interactions and current real-time situation including “who, where, and when” awareness.
- [0241] Utilization of fast and scalable Information Prioritization Subsystem that takes into account Intelligent Agents Coordinator opinion, user preferences, and history of user interactions. It takes the load of mundane decisions off the Intelligent Agents part therefore allowing the agents to be much more sophisticated and precise without compromising the system scalability.
- [0242] Speech recognition and speech synthesis in combination with intelligent agent animated representation and tactile input provides for efficient, intuitive, and emotionally rewarding interaction with the system.
Supporting Code in Accordance with a Preferred Embodiment
[0243] The following code is written and executed in the Microsoft Active Server Pages environment in accordance with a preferred embodiment. It consists primarily of Microsoft Jscript with some database calls embedded in the code to query and store information in the database.
Intention-Centric Interface
Create an Intention ASP Page (“intention create.asp”)
[0244]
| <%@ LANGUAGE = “JScript” %> |
| <% |
| Response.Buffer = true; |
| Response.Expires = 0; |
| %> |
| <html> |
| <head> |
| <title>Create An Intention</title> |
| </head> |
| <body bgcolor=“#FFE9D5” style=“font-family: Arial” text=“#000000”> |
| <% |
| //Define some variables |
| upl = Server.CreateObject(“SoftArtisans.FileUp”) |
| intention_name = upl.Form(“intention_name”) |
| intention_desc = upl.Form(“intention_desc”) |
| //intention_name = Request.Form(“intention_name”) |
| //intention_desc = Request.Form(“intention_desc”) |
| //intention_icon = Request.Form(“intention_icon”) |
| submitted = upl.Form(“submitted”) |
| items = new Enumerator(upl.Form) |
| %> |
| <% |
| //Establish connection to the database |
| objConnection = Server.CreateObject(“ADODB.Connection”) |
| objConnection.Open(“Maelstrom”) |
| %> |
| <% |
| //Check to see if the person hit the button and do the appropriate thing |
| if (submitted == “Add/Delete”) |
| { |
| flag = “false” |
| //loop through all the inputs |
| while(!items.atEnd( )) |
| { |
| i = items.item( ) |
| //if items are checked then delete them |
| if(upl.Form(i) == “on”) |
| { |
| objConnection.Execute(“delete from user_intention where |
| intention_id =” + i); |
| objConnection.Execute(“delete from intentions where |
| intention_id =” + i); |
| objConnection.Execute(“delete from tools_to_intention where |
| intention_id =” + i) |
| flag = “true” |
| } |
| items.moveNext( ) |
| } |
| // if items were not deleted then insert whatever is in the text field in the |
| database |
| if(flag == “false”) |
| { |
| intention_name_short = intention_name.replace(/ /gi,“”) |
| objConnection.Execute(“INSERT INTO intentions |
| (intention_name,intention_desc,intention_icon) values(‘“ + intention_name + ”’,‘“ + |
| intention_desc + ”’,‘“ + intention_name_short + “.gif” + ”’)”) |
| Response.write(“the intention short name is ” + intention_name_short); |
| upl.SaveAs(“E:development/asp_examples/”+ intention_name_short |
| +“.gif”) |
| } |
| } |
| // Query the database to show the most recent items. |
| rsCustomersList = objConnection.Execute(“SELECT * FROM intentions”) |
| %> |
| <input type=“Submit” name=“return_to_mcp” value=“Go to Main Control Panel” |
| onclick=“location.href=‘default.asp’”> |
| <form method=“post” action=“intention_create.asp” enctype=“multipart/form-data” > |
| <TABLE border=0> |
| <tr><td colspan=“2”><font face=“Arial” size=“+1”><b>Enter in a new |
| intention</b></font></td></tr> |
| <tr><td><font face=“Arial”>Name:</font></td> <td><INPUT TYPE=“text” |
| name=“intention_name”></td></tr> |
| <tr><td><font face=“Arial”>Description:</font></td><td><TEXTAREA |
| name=“intention_desc”></TEXTAREA></td></tr> |
| <tr><td><font face=“Arial”>Icon Image:</font></td><td><INPUT TYPE=“file” |
| NAME=“intention_icon” size=40></td></tr> |
| <tr><td colspan=“2”><INPUT type=“submit” name=“submitted” |
| value=“Add/Delete”></td></tr> |
| </TABLE> |
| <HR> |
| <font face=“Arial” size=“+1”><b>Current Intentions</b></font> |
| <TABLE> |
| <tr bgcolor=E69780 align=“center”> |
| <td> |
| <FONT color=“white”>Delete</FONT> |
| </td> |
| <TD> |
| <FONT colors=“white”>Itention</FONT> |
| </TD> |
| <TD> |
| <FONT color=“white”>Description</FONT> |
| </TD> |
| <TD> |
| <FONT color=“white”>Image</FONT> |
| </TD> |
| </tr> |
| <% |
| // Loop over the intentions in the list |
| counter = 0; |
| while (!rsCustomersList.EOF) |
| { |
| %> |
| <tr bgcolor=“white” style=“font-size: smaller”> |
| <td align=center> |
| <INPUT type=“checkbox” |
| name=“<%=rsCustomersList(“intention_id”)%>”> |
| </TD> |
| <td> |
| <%= rsCustomersList(“intention_name”)%> |
| </td> |
| <td> |
| <%= rsCustomersList(“intention_desc”)%> |
| </td> |
| <td> |
| <img src=“../images/<%= rsCustomersList(“intention_icon”)%>”> |
| </td> |
| </tr> |
| <% |
| counter++ |
| rsCustomersList.MoveNext( )} |
| %> |
| </TABLE> |
| <hr> |
| Available Tools |
| </form> |
| </BODY> |
| </HTML> |
Retrieve Intentions List ASP Page (“intentions_list.asp”)
[0245]
| <!-- #include file=“include/check_authentication.inc” --> |
| <HTML> |
| <HEAD> |
| <TITLE>mySite! Intentions List</TITLE> |
| <SCRIPT LANGUAGE=“JavaScript”> |
| function intentionsList ( ) { |
| this.internalArray = new Array( ); |
| <% |
| // establish connection to the database |
| objConnection = Server.CreateObject(“ADODB.Connection”); |
| objConnection.Open(“Maelstrom”); |
| // create query |
| intentionsQuery = objConnection.Execute(“SELECT * FROM intentions |
| ORDER BY intention_name asc”); |
| %> |
| // write out the options |
| <% |
| numOptions = 0 |
| while (!intentionsQuery.EOF) { |
| intentionName = intentionsQuery(“intention_name”); |
| intentionIcon = intentionsQuery(“intention_icon”); |
| %> |
| this.internalArray[<%= numOptions%>] = new Array(2); |
| this.internalArray[<%= numOptions%>][0] = “<%= intentionName |
| %>”; |
| this.internalArray[<%= numOptions%>][1] = “images/<%= |
| intentionIcon %>”; |
| <% numOptions++; intentionsQuery.moveNext( ); %> |
| <% } %> |
| } |
| numIntentions = <%= numOptions%>; |
| intentionArray = new intentionsList( ).internalArray; |
| function selectIntention ( ) { |
| for (i=0;i<numIntentions;i++) { |
| if (IntentionsListSelect.options[i].selected) { |
| intentionNameTextField.value = intentionArray[i][0]; |
| //intentionPicture.src = intentionArray[i][1]; |
| break; |
| } |
| } |
| } |
| </SCRIPT> |
| </HEAD> |
| <BODY BGCOLOR=“<%=Session(“main_background”)%>” style=“font-family: Arial”> |
| <CENTER> |
| <!--- <FORM NAME=“intention_list”> ---> |
| <TABLE FRAME=“BOX” border=0 CELLPADDING=“2” CELLSPACING=“2”> |
| <TR><TD COLSPAN=“3” STYLE=“font: 20pt arial” ALIGN=“CENTER”><B>Add a mySite! |
| Intention</B></TD></TR> |
| <TR><TD COLSPAN=“3”> </TD></TR> |
| <TR> |
| <TD width=“100”><font size=“−1”>Please Select An Intention You Would Like to |
| Add to Your List</font></TD> |
| <TD colspan=2> |
| <SELECT ID=“IntentionsListSelect” NAME=“IntentionsListSelect” |
| SIZE=“10” style=“font: 9pt Arial;” onClick=“selectIntention( )”> |
| <% |
| intentionsQuery.moveFirst( ); |
| for(j=0;j<numOptions;j++) { %> |
| <OPTION VALUE=“<%= intentionsQuery(“intention_id”) %>” <% if |
| (j == 0) { %> SELECTED <% } %>> |
| <%= intentionsQuery(“intention_name”) %> |
| <% intentionsQuery.moveNext( ) |
| } |
| intentionsQuery.moveFirst( ); |
| %> |
| </SELECT> |
| </TD> |
| </TR> |
| <TR><TD COLSPAN=“3”> </TD></TR> |
| <TR> |
| <TD width=“100”><font size=“−1”>Customize the Intention name</font></TD> |
| <TD COLSPAN=2“><INPUT TYPE=“text” NAME=“intentionNameTextField” |
| ID=“intentionNameTextField” SIZE=“30” VALUE=“<%= intentionsQuery(“intention_name”) |
| %>”></TD> |
| </TR> |
| <TR><TD COLSPAN=“3”> </TD></TR> |
| <TR> |
| <TD COLSPAN=“3” ALIGN=“CENTER”> |
| <INPUT TYPE=“button” NAME=“intentionOKButton” VALUE=“ OK ” |
| SIZE=“10” ID=“intentionOKButton” |
| onClick=“javaScript:top.opener.top.navframe.addAnIntention( );”> |
|   |
| ; |
| <INPUT TYPE=“button’ NAME=“intentionCancelButton” VALUE=“Cancel” |
| SIZE=“10” ID=“intentionCancelButton” onClick=“self.close( );”> |
| </TD> |
| </TR> |
| </TABLE> |
| <!--- </FORM> ---> |
| </CENTER> |
| <% objConnection.Close( ); %> |
| </BODY> |
| </HTML> |
Display User Intention List ASP Page (excerpted from “navigation.asp”)
[0246]
| <DIV ID=“intentionlist” style=“position: absolute; width:210; height:95; left: 365pt; |
| top: −5; visibility: hidden; font-family: Arial; font-color: #000000; font: 8pt |
| Arial ; ” > |
| <DIV style=“position: absolute; top:7; left:7; height:78; width:210; z-index:2; |
| background: <%=Session(“main_background”)%>; border: solid 1pt #000000; padding: 3pt; |
| overflow: auto; alink: black; link: black;”> |
| <body LINK=“#000000” ALINK=“#000000” vlink=“black”> |
| <% |
| // create query |
| intentionsQuery = objConnection.Execute(“SELECT |
| user_intention.* FROM user_intention, user_intention_to_persona WHERE |
| user_intention_to_persona.user_persona_id = ” + Session(“currentUserPersona”) + “ AND |
| user_intention_to_persona.user_intention_id = user_intention.user_intention_id” ); |
| numintentions = 0; |
| Response.Write(“<SCRIPT>numintentions=” + |
| intentionsQuery.RecordCount + “</SCRIPT><TABLE cellpadding=‘0’ width=‘100%’ |
| cellspacing=‘0’>”); |
| while (!intentionsQuery.EOF) |
| { |
| %> |
| <TR><TD><a href=“javascript:changeIntention(‘<%= |
| intentionsQuery(“user_intention_id”) %>’,‘<%=numintentions%>’)” |
| onmouseover=“mouseOverTab( )” onmouseout=“mouseOutOfTab( ) ”><font color=“Black” |
| face=“arial” size=“−2”><%= intentionsQuery{“intention_custom_name”} |
| %></font></a></TD><TD><IMG align=“right” SRC=“images/delete.gif” alt=“Delete this |
| intention” onClick=“confirmDelete(<%= intentionsQuery(“user_intention_id”) |
| %>) ”></TD></TR> |
| <%numintentions++; intentionsQuery.moveNext( ); %> |
| <% } |
| Response.Write(“<SCRIPT>numintentions=”+numintentions |
| +“</SCRIPT>”); |
| %> |
| <tr><td colspan=“2”><hr></td></tr> |
| <TR><td colspan=“2”><a href=“javascript:changeIntention(‘add |
| ...’,<%=numintentions%>);” onmouseover=“mouseOverTab( )” |
| onmouseout=“mouseOutOfTab( )”><font color=“Black” face=“arial” size=“−2”>add |
| ...</font></a></td></TR> |
| </table> |
| </body> |
| </DIV> |
| <DIV style=“position: absolute; top:0; left:−5; width: 230; height:105; z-index:1; |
| “ onmouseout=”intentionlist.style.visibility=‘hidden’” |
| onmouseout=“intentionlist.style.visibility=‘hidden’” |
| onmouseover=“intentionlist.style.visibility=‘hidden’”></DIV> |
| </DIV> |
| </DIV> |
[0247] A preferred embodiment of a system utilizes a Windows CE PDA equipped with a GPS receiver. The embodiment is configured for a mall containing a plurality of stores. The system utilizes a GPS receiver to determine the user's location. One advantage of the system is that it enables the retrieval of data for nearby stores without relying on the presence of any special equipment at the mall itself. Although the accuracy of smaller, inexpensive receivers is limited to approximately 75-100 feet, this has thus far proven to be all that is necessary to identify accurately the immediately surrounding stores. The system uses generated data rather than actual store ads and prices. Well structured online catalogs are used. Other embodiments utilize agents that “learn to shop” at a given store using a relatively small amount of knowledge. Moreover, as retailers begin to use standard packages to create online catalogs, we can expect the number of differing formats to decrease, resulting in a tractable number of competing formats. As electronic commerce progresses, it is not unreasonable to expect standards to evolve governing how merchandise offerings are represented.
Goal Specification
[0248] Before leaving on a shopping trip, a shopper creates a shopping list of items by selecting from a preexisting set of approximately 85 product categories (e.g. men's casual pants, women's formal shoes, flowers, etc,). They also indicate the shopping venue they intend to visit from a list of malls.
Initial Store Selection
[0249] Upon arriving at the mall, begins by suggesting the closest store that sells at least one item of a type entered by the user during goal specification. Along with the store name a system in accordance with a preferred embodiment prepares a list of the specific items available and their prices. A map of the mall displays both the precise location of the store and the shopper's current location. The shopper queries the system to suggest a store at any time based on their current location.
Browsing
[0250] To address the need of many shoppers to visit malls or shop generally without a particular destination in mind. FIG. 27 illustrates a display in accordance with a preferred embodiment of the invention. The display operates in a browse mode for use by shoppers as they stroll through the mall. In browse mode the system suggests items of interest for sale in the stores currently closest to the shopper. An item is considered to be of interest if it matches the categories entered in the goals screen. If there are no items of interest, the general type of merchandise sold at that store is displayed, rather than specific items. As the shopper strolls a map displays his or her precise current location in the mall. If an item displayed is selected by the shopper while browsing, the system alerts the shopper to the local retailer offering the same product for the lowest price, or announces the best local price. This search is restricted to the local mall, as that is the assumed radius the shopper is willing to travel.
Alternatives
[0251] It is worth emphasizing that the current inventive agent will support broader aspects of the shopping task, for example, it could operate as bi-directional channels. That is, not only can they provide information to the shopper, but, at the shopper's discretion, they may provide information to retailers as well. In this embodiment, the system indicates a shopper's goals and preferences to a retailer-based agent, who, in turn, responds with a customized offer that bundles service along with the product. Enabling the customization of offers is crucial to gaining the cooperation of retailers who are reluctant to compete solely on price and of value to customers who base their purchases on criteria other than price. While the preferred embodiment focuses on location-based filtering primarily in the context of the shopping task, the current invention provides the basis for “physical task support” agents that provide an information channel to people engaged in various tasks in the physical world.
The Predictive Value of Location
[0252] The present invention is a significant advance over non location based agents because a users physical location is often very predictive of his or hers current task. If we know someone is at a bowling alley or a post office we can reasonably infer their current activity. Knowledge of a user's current task largely determines the type of information they are likely to find useful. People are unlikely to concern themselves with postal rates while bowling, or optimal bowling ball weight while buying stamps. In addition, knowledge of the resources and obstacles present at a particular location suggest the range of possible and likely actions of someone at that location. This awareness of a user's possible and likely actions can be used to further constrain the type of information a user is likely to find useful. For example, knowledge of a restaurant's wine list could be used by a recommender system to constrain the wine advice it presents.
[0253] Knowledge of a shopper's precise location in a shopping mall is valuable because it enables the identification of the stores immediately surrounding the shopper. The offerings of the stores closest to the shopper represent the immediate choices available to the shopper. Given that shoppers place a premium on examining in i merchandise first hand and that there is a cost associated with walking to other stores, the merchandise of the closest surrounding stores constitute the most likely immediate selections of the shopper. Consequently, among the most useful information provided at any given time is the availability of merchandise in the surrounding stores that matches their previously stated goals.
[0254] People tend to move to different locations while performing many of their our tasks. This suggests that their immediate surroundings do not completely capture the full range of options they may have. In fact one of the main reasons for leaving a location is to perform an action that is not possible at the current location. Nevertheless, one does tend to address most tasks within relatively local areas. Thus while their immediate surroundings suggest the options they have available at a given point in time, a broader view of a location will often capture the options they are likely to consider over the course of a task. In the case of mall shopping, for example, the stores immediately surrounding the shopper represent the options available at that moment. Mall shoppers, however, are generally willing to travel to any store within the mall. Therefore the potential options over the entire shopping trip include all the stores in the mall. Accordingly, information is presented on offerings of interest only from the immediately surrounding stores because these are the immediately available options. When asked for alternatives, the system restricts itself to all the stores within the mall—the area within which the shopping task as a whole is likely to be performed. Being alerted that a store hundreds or thousands of miles away sells the same merchandise for a few dollars less than the cheapest local alternative is of little value in cases when shoppers require a first hand examination of the merchandise in question or are not willing to wait for shipping.
Physical Vs. Online Shopping
[0255] In addition to the significant advantages over non-location based agents the present invention over comes disadvantages o online (or web) shopping. It is tempting to argue that online shopping will soon become the predominant mode of shopping, pending only greater penetration of home computers, the expansion of online offerings, and better online shopping tools. At first glance it would therefore appear to be a mistake to begin using location to support an activity that will become virtualized. Already we've seen the emergence of a number of software agents that support online shopping. For example, programs that allow users to identify the cheapest source for a music CD, given a title. Similar programs have been developed for buying books, such as BargainBot. These systems demonstrate the potential of electronic commerce web agents to create perfect markets for certain products. The success of these agents will encourage the development of similar web shopping agents for a greater variety of goods.
The Limitations of Online Shopping
[0256] Certainly online shopping will continue to grow and the trend towards more powerful online shopping agents will continue. Nevertheless, it also seems clear that no matter how sophisticated web-agents become, traditional physical shopping will continue to dominate the market for the foreseeable future. Several inherent difficulties of online shopping will ensure the continued reliance on physical shopping:
Non-fungible Goods
[0257] Web-based shopping agents have typically enabled users to identify the cheapest price for fungible products such as books and music CDs. While this capacity to create “perfect markets” for such commodities is of great benefit to consumers, several difficulties exist that will complicate applying these approaches to arbitrary products.
[0258] Commodities are particularly well suited to shopping agents because it is easy to make comparisons between competing offers. Because commodities are fungible, one of the very few dimensions upon which they differ is price. Price therefore becomes the primary, if not sole, criterion upon which purchasing decisions are made.
[0259] As soon as we move beyond commodities, however, several other criteria become important. For example, how do we compare items such as sweaters, mattresses, or tables? In addition to price we care about the materials used, the color, how it fits and feels, and the workmanship. Similar problems apply to most other products.
Imprecise Goal Specificaton
[0260] A second, related difficulty lies in communicating our desires to an agent. Shopping agents are great if the user knows the precise commodity he or she wants. Then they can simply enter the product by name. Unfortunately, if they don't have a specific item in mind when they shop, then the problem of conveying what is wanted to an agent becomes more difficult. For example, how does the user tell an agent what kind of lamp they want for their living room?
Undeveloped Preferences
[0261] Interfaces that allow shoppers to include descriptive features like price ranges, color, options, brands, etc, can help address the above problem, but they are not enough. Much of the time shoppers either haven't formed preferences or can't articulate their desires until after they've started shopping and had a chance to examine various examples of the target products.
Shopping is Entertainment
[0262] People like to shop and do so without having a specific purchase in mind. One study found that 42% of consumers are “non-destination shoppers” that visit the mall primarily for leisure browsing and socializing.
Shopping is Sensory
[0263] Even if the user could effectively provide these details most would be unlikely to delegate a purchasing decision to such an agent. After all, many people are uncomfortable even trusting spouses to make appropriate purchases on their behalf. Most people want to see and touch first hand what they're considering before making a purchase decision. The few preferences they may provide an agent cannot replace this rich, first-hand experience. At best such preferences could be used to generate a candidate set for shoppers to consider.
Instant Grafication
[0264] Shopping is often a very emotional activity. People are pleased with their purchases and often can't wait to get home to try them out. The inherent delay between online purchases and their receipt is a significant issue to those who simply must take home their selections as soon as they see them.
[0265] In the end, consumers will continue to engage in physical shopping because of the limitations listed above. However, the fact that the task can't completely be delegated to software agents does not rule out a role for them. First, users find them useful for purchasing commodities when they know what they want. A second role, however, is to support the physical shopping task itself, throughout the time that a person is engaged in it. This, of course, is the approach taken in the SHOPPER'S EYE project.
SHOPPER'S EYE
[0266] At first blush it may seem that the current invention is subject to some of the same limitations as purely web-based agents. After all, why should it be any easier to communicate your goals to a PDA than it is to a web-based agent? Why would your preferences be any more developed for purchases supported by a PDA system than a web-based agent?
[0267] A key difference between purely web-based agents and the current “physical task support agents” (i.e. an agent that supports a user engaged in a task in a physical setting) is that web-based agents are completely responsible for conveying all information that will be considered by the user. On the other hand, “physical task support” agents in accordance with a preferred embodiment can augment the approaches of web-based agents by referring to aspects of a user's environment. For example, it is not terribly important to convey richly the feeling of a particular sweater if the sweater is in a store thirty feet away. It need only refer the shopper to the sweater. The shopper will gain a much better appreciation of the sweater by trying it on than through anything that can be conveyed by the system. When too many products match an imprecisely specified goal for a web-based agent, a more restrictive search must be made. However, many matches simply indicates there is a store that is likely to be of great interest to the shopper and therefore should be visited. Once inside, narrowing down the merchandise of interest in person will often be far easier than refining the goals on a web-based agent. Therefore physical task support agents can assist users to elaborate their preferences and identify specific goals by calling users' attention to aspects of their physical environment as a means of conveying information throughout the entire course of the task.
The Promise of Physical Shopping Agents
[0268] It is hardly surprising that physical shopping has been neglected by the agents community. After all, until very recently there simply was no reliable way to deliver customized information to individual shoppers in remote locations. However, the explosive growth of PDAs, and their increasingly sophisticated communications capabilities promise to make them effective channels of “just in time” information to users wherever they happen to be. The present invention provides an ituitive, novel agent that supports physical shopping by exploiting the promise of this developing channel that support all phases of the shopping task and solves the foregoing problems including:
Specification of Goals
[0269] Shoppers begin by indicating at least the general category of merchandise they are interested in. Shopping agents need to enable the specification of goals at various degrees of specificity. With the present invention these goals may be refined as the task progresses.
Exploration of Product Space
[0270] Before shoppers can make a selection, they need to become educated about what is available. Shopping agents can aid in this task by presenting various classes of offerings, reviews, demonstrations, etc. The present inventive Physical shopping agent can augment this by providing shoppers with a tour of the locally available offerings.
Refinement of Preferences
[0271] As shoppers learn what is available and examine the offerings their preferences evolve. Agents need to enable shoppers to refine their preferences over time. The present invention allows the user to refine their preferences.
Identification and Comparison of Candidate Products
[0272] As shoppers begin to understand what they want and what is available they typically compile a list of candidates that will be considered more carefully. The present inventive agents supports the construction and maintenance of such lists and facilitates the comparison of candidates within the list according to various criteria.
Negotiation of Offers
[0273] The present shopping agent is not restricted to providing the shopper with information. It is possible to negotiate prices and service options with retailers.
Product Selection, Purchase and Product Support
[0274] The present invention facilitates the transaction itself and can be used as a channel through which product service can be delivered.
[0275] While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
Claims
What is claimed is:
1. A method for delivering a best local price of an item of merchandise, comprising:
obtaining information identifying an item of merchandise that a user desires to purchase;
determining a physical location of the user;
querying a computerized network of information utilizing a query based on the information identifying the item of merchandise that the user desires to purchase and the physical location of the user; and
in response to the query:
identifying multiple retailers proximate to the user;
determining whether the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers;
based on determining the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers:
identifying the best local price comprising a lowest price at which the item of merchandise that the user desires to purchase is available for purchase as between the multiple retailers proximate to the user;
displaying the best local price and an identification of a retailer from among the multiple retailers proximate to the user at which the item of merchandise that the user desires to purchase is available for purchase at the best local price;
generating a customized product rating report about the item of merchandise that the user desires to purchase based on prior product ratings previously generated by other users whose respective user profiles are similar to, within a similarity threshold, a user profile associated with the user; and
transmitting the customized product rating report to the user; and
based on determining the item of merchandise that the user desires to purchase is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
2. The method of claim 1, further comprising obtaining information identifying a shopping list comprising a plurality of items of merchandise from the user, where the query is based on the information identifying the shopping list of items of merchandise and the physical location of the user.
3. The method of claim 1, where the information identifying the item of merchandise that the user desires to purchase is stored on a wireless handheld device comprising a GPS receiver for determining the physical location of the user.
4. The method of claim 1, further comprising displaying a map showing the physical location of the user relative to the physical location of specific retailers proximate to the physical location of the user.
5. The method of claim 4, further comprising continuously updating the map as the user moves to show a new physical location of the user relative to the physical location of specific retailers proximate to the new physical location of the user.
6. The method of claim 1, further comprising pinpointing the physical location of the user with an accuracy of approximately 100 feet or less.
7. The method of claim 1, further comprising obtaining a user profile, the user profile comprising the information identifying the item of merchandise that the user desires to purchase and shopping preferences of the user.
8. The method of claim 7, further comprising:
transmitting the physical location of the user and the user profile to a retailer-based agent comprising identifications of physical locations of the multiple retailers proximate to the user and items of merchandise available for purchase at the multiple retailers proximate to the user; and
receiving from the retailer-based agent the customized offer for sale of the item of merchandise offered for sale from a retailer proximate the user, where the item of merchandise offered for sale from a retailer proximate to the user corresponds to the item of merchandise that the user desires to purchase.
9. The method of claim 8, where the customized offer is generated based on the user profile and a result of the query.
10. The method of claim 1, further comprising inferring an activity the user is engaged in based on the physical location of the user, where the query is based on the information identifying the item of merchandise that the user desires to purchase, the physical location of the user, and the inferred activity.
11. The method of claim 1, where generating the customized product rating report comprises:
obtaining the user profile associated with the user;
obtaining additional user profiles, each additional user profile corresponding to an additional user that has previously generated the prior product rating about the item of merchandise that the user desires to purchase;
identifying, from among the additional user profiles, a set of closest user profiles that are similar to the user profile within the similarity threshold; and
combining the prior product ratings associated with each user profile in the set of closest user profiles to generate the customized product rating report about the item of merchandise that the user desires to purchase.
12. An apparatus that delivers a best local price of an item of merchandise, comprising:
a processor;
memory that stores information under the control of the processor; and
a computer executable program embodied on a computer readable medium in communication with the processor, the computer executable program comprising:
a code segment that obtains information identifying an item of merchandise that a user desires to purchase;
a code segment that determines a physical location of the user;
a code segment that queries a computerized network of information utilizing a query based on the information identifying the item of merchandise that the user desires to purchase and the physical location of the user;
a code segment that, in response to the query:
identifies multiple retailers proximate to the user;
determines whether the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers;
based on determining the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers:
identifies the best local price in response to the query, the best local price comprising a lowest price at which the item of merchandise that the user desires to purchase is available for purchase as between the multiple retailers proximate to the user;
displays the best local price and an identification of a retailer from among the multiple retailers proximate to the user at which the item of merchandise that the user desires to purchase is available for purchase at the best local price;
generates a customized product rating report about the item of merchandise that the user desires to purchase based on prior product ratings previously generated by other users whose respective user profiles are similar to, within a similarity threshold, a user profile associated with the user; and
transmits the customized product rating report to the user; and
based on determining the item of merchandise that the user desires to purchase is not available for purchase from at least one of the multiple retailers:
identifies a closest retailer from among the multiple retailers proximate to the user; and
displays a general type of merchandise available for purchase from the closest retailer.
13. The apparatus of claim 12, the computer executable program further comprising a code segment that obtains information identifying a shopping list comprising a plurality of items of merchandise from the user.
14. The apparatus of claim 12, where the query is based on the information identifying the shopping list of items of merchandise and the physical location of the user.
15. The apparatus of claim 13, wherein said shopping list is generated by the user at a location remote from the multiple retailers proximate to the user.
16. The apparatus of claim 12, the computer executable program farther comprising a code segment that displays a list of items of merchandise available at the retailer and the prices associated therewith.
17. The apparatus of claim 12, further comprising a GPS receiver in communication with the processor.
18. The apparatus of claim 12, the computer executable program further comprising a code segment that displays a map showing the physical location of the user relative to the physical location of specific retailers proximate to the physical location of the user.
19. The apparatus of claim 18, the computer executable program further comprising a code segment that continuously updates the map as the user moves to show a new physical location of the user relative to the physical location of specific retailers proximate to the new physical location of the user.
20. The apparatus of claim 12, the computer executable program further comprising:
a code segment that transmits the physical location of the user and a user profile to a retailer-based agent including the computerized network of information having identifications of physical locations of the multiple retailers proximate to the user and items of merchandise available for purchase at the multiple retailers proximate to the user, the user profile comprising the item of merchandise that the user desires to purchase and shopping preferences of the user;
a code segment that generates a customized offer for the item of merchandise based on the user profile and the result of the query; and
a code segment that receives the customized offer for sale of the item of merchandise from the retailer-based agent , the item of merchandise being offered for sale at a retailer proximate the user.
21. The apparatus of claim 12, where the computer executable program further comprises a code segment that infers an activity the user is engaged in based on the physical location of the user, where the query is based on the information identifying the item of merchandise that the user desires to purchase, the physical location of the user, and the inferred activity.
22. The apparatus of claim 12, where the code segment that generates a customized product rating report comprises:
a code segment that obtains the user profile associated with the user;
a code segment that obtains additional user profiles, each additional user profile corresponding to an additional user that has previously generated the prior product rating about the item of merchandise that the user desires to purchase;
a code segment that identifies, from among the additional user profiles, a set of closest user profiles that are similar to the user profile within the similarity threshold; and
a code segment that combines the prior product ratings associated with each user profile in the set of closest user profiles to generate the customized product rating report about the item of merchandise that the user desires to purchase.
23. A method for delivering a best local price of an item of merchandise from a retailer proximate a user, comprising:
obtaining information identifying a user profile including an item of merchandise that the user desires to purchase and the user's shopping preferences;
determining a physical location of the user;
automatically querying a computerized network of information utilizing a query based on the user profile and the physical location of the user; and
in response to the query:
identifying multiple retailers proximate to the user;
determining whether the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers;
based on determining the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers:
identifying the best local price in response to the query, the best local price comprising a lowest price at which the item of merchandise that the user desires to purchase is available for purchase as between the multiple retailers proximate to the user;
displaying the best local price and an identification of a retailer from among the multiple retailers proximate to the user at which the item of merchandise that the user desires to purchase is available for purchase at the best local price;
obtaining additional user profiles, each additional user profile corresponding to an additional user that has previously generated a product rating about the item of merchandise that the user desires to purchase;
identifying, from among the additional user profiles, a set of closest user profiles that are similar to the user profile within a similarity threshold;
combining the product ratings associated with each user profile in the set of closest user profiles to generate a customized product rating report about the item of merchandise that the user desires to purchase; and
transmitting the customized product rating report to the user; and
based on determining the item of merchandise that the user desires to purchase is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
24. The method of claim 23, farther comprising parsing the information identifying the user profile based on predefined criteria to create the query.
25. The method of claim 23, farther comprising:
transmitting the physical location of the user and the user profile to a retailer agent including a computerized network of information having identifications of physical locations of retailers and items of merchandise available for purchase at the retailers;
generating purchasing information for the item of merchandise according to the user profile and the result of the query; and
receiving the purchasing information from the retailer agent, the purchasing information including an offer for sale of the item of merchandise being associated with the item of merchandise that the user desires to purchase.
26. The method of claim 23, further comprising inferring an activity the user is engaged in based on the physical location of the user, where the query is based on the user profile, the physical location of the user, and the inferred activity.
27. A method for delivering a best local price of an item of merchandise from a retailer proximate a user, comprising:
obtaining user profile information from the user, the user profile information including information identifying items of merchandise that the user desires to purchase and the user's shopping preferences;
determining a physical location of the user;
querying a computerized network of information utilizing a query based on the user profile information and the physical location of the user; and
in response to the query:
identifying multiple retailers proximate to the user;
determining whether one or more of the items of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers;
based on determining one or more of the items of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers:
identifying at least one best local price, the at least one best local price comprising a lowest price at which one or more of the items of merchandise are available for purchase as between the multiple retailers proximate to the user;
alerting the user to the at least one best local price;
generating a customized product rating report about one or more of the items of merchandise that the user desires to purchase based on prior product ratings previously generated by other users whose corresponding user profile information is similar to, within a similarity threshold, the user profile information associated with the user; and
transmitting the customized product rating report to the user
based on determining one or more of the item of merchandise that the user desires to purchase is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
28. The method of claim 27, further comprising obtaining information identifying a shopping list comprising a plurality of items of merchandise.
29. The method of claim 28, where the query is based on the information identifying the shopping list of items of merchandise and the physical location of the user.
30. The method of claim 27, further comprising:
transmitting the physical location of the user and the user profile information to a retailer-based agent including a computerized network of information having identifications of physical locations of retailers and items of merchandise available for purchase at the retailers;
generating customized offers for sale for the item of merchandise based on the user profile information and the result of the query;
receiving from the retailer based agent the customized offers for sale of the item of merchandise from one or more retailers proximate the user; and
displaying the customized offers and a physical location of the one or more retailers proximate the user.
31. The method of claim 27, further comprising inferring an activity the user is engaged in based on the physical location of the user, where the query is based on the user profile information, the physical location of the user, and the inferred activity.
32. An apparatus that delivers a best local price of an item of merchandise from a retailer proximate a user, comprising:
a processor;
memory that stores information under the control of the processor; and
a computer executable program embodied on a computer readable medium in communication with the processor, the computer executable program comprising:
a code segment that obtains user profile information from the user, the user profile information identifying an item of merchandise that the user desires to purchase;
a code segment that determines a physical location of the user;
a code segment that queries a computerized network of information utilizing a query based on the user profile information and the physical location of the user;
a code segment that, in response to the query:
identifies multiple retailers proximate to the user;
determines whether the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers;
based on determining the item of merchandise that the user desires to purchase is available for purchase from at least one of the multiple retailers:
identifies a best local price in response to the query, the best local price comprising a lowest price at which the item of merchandise is available for purchase as between the multiple retailers proximate to the user;
alerts the user to the best local price;
obtains additional user profile information corresponding to additional users that have previously generated product ratings about one or more of the items of merchandise that the user desires to purchase;
identifies, from among the additional user profile information, a set of closest user profiles that are similar to the user profile information within a similarity threshold;
combines the product ratings associated with each user profile in the set of closest user profiles to generate a customized product rating report about the one or more items of merchandise that the user desires to purchase; and
transmits the customized product rating report to the user; and
based on determining the item of merchandise that the user desires to purchase is not available for purchase from at least one of the multiple retailers:
identifies a closest retailer from among the multiple retailers proximate to the user; and
displays a general type of merchandise available for purchase from the closest retailer.
33. The apparatus of claim 32, the computer executable program further comprising a code segment that obtains information identifying a shopping list comprising a plurality of items of merchandise from the user.
34. The apparatus of claim 32, the computer executable program further comprising a code segment that queries a computerized network of information utilizing a query based on the information identifying the shopping list of items of merchandise and the physical location of the user.
35. The apparatus of claim 32, the computer executable program further comprising:
a code segment that transmits the physical location of the user and the user profile information to a retailer-based agent including a computerized network of information having identifications of physical locations of retailers and items of merchandise available for purchase at the retailers;
a code segment that generates a customized offer for the item of merchandise based on the user profile and the result of the query;
a code segment that receives the customized offer for sale of the item of merchandise from the retailer based agent; and
a code segment that displays the customized offer and the physical location of a retailers proximate the user having the item of merchandise for sale.
36. The apparatus of claim 32, where the computer executable program further comprises a code segment that infers an activity the user is engaged in based on the physical location of the user, where the query is based on the user profile information, the physical location of the user, and the inferred activity.
37. A method for delivering purchasing information for sale of an item of merchandise from a retailer proximate a user, comprising:
obtaining user profile information from the user, the user profile information identifying the item of merchandise and the user's shopping preferences;
determining a physical location of the user;
automatically querying a computerized network of information utilizing a query based on the user profile information and the physical location of the user; and
in response to the query:
identifying multiple retailers proximate to the user;
determining whether the item of merchandise is available for purchase from at least one of the multiple retailers;
based on determining the item of merchandise is available for purchase from at least one of the multiple retailers:
generating purchasing information for the item of merchandise based on the user profile and the result of the query, the purchasing information comprising a best local price that corresponds to the lowest price at which the item of merchandise is offered as between the multiple retailers proximate to the user;
displaying the purchasing information;
obtaining additional user profile information corresponding to additional users that have previously generated product ratings about the item of merchandise;
identifying, from among the additional user profile information, a set of closest user profiles that are similar to the user profile information within a similarity threshold;
combining the product ratings associated with each user profile in the set of closest user profiles to generate a customized product rating report about the item of merchandise; and
transmitting the customized product rating report to the user; and
based on determining the item of merchandise is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
38. The method of claim 37, farther comprising parsing the user profile information based on predefined criteria to create the query.
39. The method of claim 37, further comprising:
transmitting the physical location of the user and the user profile to an agent including a computerized network of information having identifications of physical locations of retailers and items of merchandise available for purchase at the retailers; and
receiving the purchasing information from an agent in response to the identifying purchasing information.
40. The method of claim 37, further comprising inferring an activity the user is engaged in based on the physical location of the user, where the query is based on the user profile information, the physical location of the user, and inferred activity.
41. A computer readable medium encoded with a mobile shopping agent, the mobile shopping agent comprising:
means for receiving from a user an input comprising a product desired to be purchased by a user;
means for automatically querying a computerized network of information identifying items of merchandise for sale at multiple retailers proximate the user utilizing a query based on the input and a physical location of the user;
means responsive to the query for:
identifying the multiple retailers proximate to the user;
determining whether the desired product is available for purchase from at least one of the multiple retailers;
based on determining the desired product is available for purchase from at least one of the multiple retailers:
identifying a best local price, the best local price comprising a lowest price at which the desired product is available for purchase as between the multiple retailers proximate to the user;
displaying the best local price and an identification of a retailer from among the multiple retailers proximate to the user at which the desired product is available for purchase at the best local price;
generating a customized product rating report about the desired product based on prior product ratings previously generated by other users whose corresponding user profile is similar to, within a similarity threshold, a user profile associated with the user; and
transmitting the customized product rating report to the user; and
based on determining the desired product is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
42. The mobile shopping agent of claim 41, wherein the means for displaying further comprises a means for displaying a list of a plurality of retailers proximate the user and for displaying an offer for sale of items of merchandise for sale at the each of the plurality of retailers.
43. The mobile shopping agent of claim 41, further comprising:
means for generating a customized offer for the item of merchandise based a user profile and a result of the query; and
means for displaying the customized offer to the user.
44. The mobile shopping agent of claim 43, the user profile comprising shopping preferences of the user.
45. The mobile shopping agent of claim 41, further comprising inferring an activity the user is engaged in based on the physical location of the user, where the query is based on the input, the physical location of the user, and the inferred activity.
46. A method for presenting a best local price of an item of merchandise, comprising:
storing user profile information including user preferences related to at least one product desired to be purchased by a mobile user;
determining a physical location of the mobile user;
querying a computer network utilizing a query based on the stored user profile information and the physical location of the mobile shopper; and
in response to the query:
identifying multiple retailers proximate to the user;
determining whether the at least one product desired to be purchased by the mobile user is available for purchase from at least one of the multiple retailers;
based on determining the at least one product desired to be purchased by the mobile user is available for purchase from at least one of the multiple retailers:
identifying the best local price, the best local price comprising a lowest price at which the at least one product desired to be purchased is available for purchase as between the multiple retailers proximate to the user;
displaying the best local price and an identification of a retailer from among the multiple retailers proximate to the user at which the at least one product desired to be purchased is available for purchase at the best local price;
generating a customized product rating report about the at least one product desired to be purchased by the mobile user based on prior product ratings previously generated by other users whose corresponding user profile information is similar to, within a similarity threshold, the user profile information associated with the mobile user; and
transmitting the customized product rating report to the user; and
based on determining the at least one product desired to be purchased by the mobile user is not available for purchase from at least one of the multiple retailers:
identifying a closest retailer from among the multiple retailers proximate to the user; and
displaying a general type of merchandise available for purchase from the closest retailer.
47. The method of claim 46, further comprising displaying a location of the retailer at which the at least one product desired to be purchased is available for purchase at the best local price with respect to the location of the mobile user.
48. The method of claim 46, further comprising:
generating an offer for sale of the at least one product based on the user profile; and
displaying the offer and the location of a retailer associated with the offer to the mobile user.
49. The method of claim 48, where the offer is generated based on the user profile and the location of the mobile user transmitted to a retailer agent including the computerized network of information.
50. The method of claim 46, further comprising inferring an activity the mobile shopper is engaged in based on the physical location of the mobile shopper, where the query is based on the stored user profile information, the physical location of the mobile shopper, and the inferred activity.
Patent Citations (36)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5047614(A) | 1991-09-01 | Bianco | Examiner |
| US5287266(A) | 1994-02-01 | Malec et al. | Applicant |
| US5295064(A) | 1994-03-01 | Malec et al. | Applicant |
| US5495610(A) | 1996-02-01 | Shing et al. | Applicant |
| US5602997(A) | 1997-02-01 | Carpenter et al. | Applicant |
| US5630068(A) | 1997-05-01 | Vela et al. | Examiner |
| US5682525(A) | 1997-10-01 | Bouve et al. | Applicant |
| US5729697(A) | 1998-03-01 | Schkolnick et al. | Applicant |
| US5732399(A) | 1998-03-01 | Katiyar et al. | Applicant |
| US5740549(A) | 1998-04-01 | Reilly et al. | Applicant |
| US5751246(A) | 1998-05-01 | Hertel | Applicant |
| US5821513(A) | 1998-10-01 | O'Hagan et al. | Applicant |
| US5835061(A) | 1998-11-01 | Stewart | Examiner |
| US5859969(A) | 1999-01-01 | Oki et al. | Applicant |
| US5893091(A) | 1999-04-01 | Hunt et al. | Examiner |
| US5979757(A) | 1999-11-01 | Tracy et al. | Applicant |
| US6091956(A) | 2000-07-01 | Hollenberg | Examiner |
| US6112304(A) | 2000-08-01 | Clawson | Applicant |
| US6123259(A) | 2000-09-01 | Ogasawara | Examiner |
| US6134548(A) | 2000-10-01 | Gottsman et al. | Examiner |
| US6154745(A) | 2000-11-01 | Kari et al. | Examiner |
| US6195651(B1) | 2001-02-01 | Handel et al. | Applicant |
| US6199082(B1) | 2001-03-01 | Ferrel et al. | Applicant |
| US6208975(B1) | 2001-03-01 | Bull et al. | Applicant |
| US7076504(B1) | 2006-07-01 | Handel et al. | Examiner |
| US2002/0050526(A1) | 2002-05-01 | Swartz et al. | Examiner |
| US2006/0195368(A1) | 2006-08-01 | Walker et al. | Examiner |
| US2007/0078728(A1) | 2007-04-01 | Fusz et al. | Examiner |
| EP697669 | 1994-08-01 | Applicant | |
| EP669733 | 1995-08-01 | Applicant | |
| EP435225 | 1997-03-01 | Applicant | |
| EP865006 | 1998-09-01 | Applicant | |
| GB2315891 | 1998-02-01 | Applicant | |
| WO9818094(A1) | 1998-04-01 | Examiner | |
| WO98/26357 | 1998-06-01 | Applicant | |
| WO/51042 | 2000-08-01 | Applicant |
Non-Patent Literature (18)
- Tapscott, Don, “Beyond Brand: The Future of Marketing”, Feb. 9, 1998, Computerworld, v32, n6, p. 101.Examiner
- Written Opinion dated Nov. 7, 2000, for corresponding international application PCT/IB00/00386.Applicant
- International Preliminary Examination Report dated Feb. 28, 2001, for corresponding international application PCT/IB00/00386.Applicant
- Hugh W. Ryan, Scott R. Sargent, Tomothy M. Boudreau, Yannie S. Arvanitis, Stanton J. Taylor, and Craig Mindrum, “Practical Guide to Client Server Computing,” Second Edition, 1998.Applicant
- Hugh W. Ryan, Michael W. Alber, Stanton J. Taylor, Richard A. Chang, Yannis S. Arvanitis, Michael C. Davis, Nancy K. Mullen, Shari L. Dove, Prem N. Mehra, and Craig Mindrum, “Netcentric Computing: Computing, Communications, and Knowledge,” 1998.Applicant
- “Case-based Reasoning System for and Executive Briefing Book,” IBM Technical Disclosure Bulletin, vol. 34, pp. 380-381 (1991).Applicant
- “Client/Server Programming with OS/2 2.0,” pp. 10-24, 111-123, 125-137, 149-160 and 588-594 (1992).Applicant
- Paulina Borsook, “Seeking Security,” State of the Art, 18, No. 6, pp. 119-122, 124, 126 and 128 (1993).Applicant
- Robert Orfali and Dan Harkey, “Client/Server With Distributed Objects,” Special Report, Client/Server Computing, 20, No. 4, pp. 151-152, 154, 156, 158-160 and 162 (1995).Applicant
- Robert Orfali, Dan Harkey and Jeri Edwards, “Intergalactic Client/Server Computing,” Special Report, 20, No. 4, pp. 108-110, 114, 118, 120 and 122 (1995).Applicant
- Bradley J. Rhodes and Thad Starner, “Remembrance Agent, A Continuously Running Automated Information Retrieval System,” published in, The Proceedings of the First International Conference on The Practical Application of Intelligent Agents and Multi Agent Technology, pp. 487-495 [online] [retrieved on May 8, 2001] retrieved from the Internet: <URL: http://rhodes .www.media.mit.edu/people/Rhodes/Papers/remembrance.html (1996).Applicant
- “3Com PalmPilot Gets Web Browser, Paging, Fax,” Newsbytes News Network, Dialog Web pp. 1-3 (1997).Applicant
- Hiroshi Tsuda, Kanji Uchino and Kunio, “WorkWare: WWW-based Chronologic Document Organizer,” IEEE, pp. 380-385 (1998).Applicant
- J. Smeets and S. Boyer, “Internet and Client Server Patent Information Systems: New Services From Derwent,” Commercially Developed Systems/World Patent Information, 20, pp. 136-139 (1998).Applicant
- Loring Wirbel, “Software Tools—Startup's Package Creates New Channels in Handhelds,” Electronic Engineering Times, pp. 72 Dialog Web pp. 1-2 (1998).Applicant
- Paula Rooney, “Solutions Built for Palmtops—Apps to Fuel Sales,” Computer Retail Week, pp. 25 Dialog Web pp. 1-2 (1998).Applicant
- “PageNet to Eliminate 1,800 Jobs, Become Content Carrier,” Newsbytes News Network, Dialog Web pp. 1-3 (1998).Applicant
- Andrew E. Fano, Shopper's Eye: Using Location-based Filtering for a Shopping Agent in the Physical World, Proceedings of the Second International Conference on Autonomous Agents (Agents '98), May 9-13, 1998.Applicant