WO2008001362A2 - Automated querying distribution system and method - Google Patents

Automated querying distribution system and method Download PDF

Info

Publication number
WO2008001362A2
WO2008001362A2 PCT/IL2007/000775 IL2007000775W WO2008001362A2 WO 2008001362 A2 WO2008001362 A2 WO 2008001362A2 IL 2007000775 W IL2007000775 W IL 2007000775W WO 2008001362 A2 WO2008001362 A2 WO 2008001362A2
Authority
WO
WIPO (PCT)
Prior art keywords
queries
reply
query
communication port
sent
Prior art date
Application number
PCT/IL2007/000775
Other languages
French (fr)
Other versions
WO2008001362A3 (en
Inventor
Shay Inbar
Original Assignee
E.Z.Check Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by E.Z.Check Ltd. filed Critical E.Z.Check Ltd.
Publication of WO2008001362A2 publication Critical patent/WO2008001362A2/en
Publication of WO2008001362A3 publication Critical patent/WO2008001362A3/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management

Definitions

  • the process of distributing a query to a plurality of addressee and gathering replies from the same plurality of addressees may be an onerous, inefficient and time consuming process. This may especially true in the event that an issuer of such a query has to contact personally some addressees by, for example, directing of phone calls to gather a reply.
  • Such a query may be related to, for example, an opinion poll, wherein the addressee may be asked, for example, to provide a reply in which the addressee declares his/her position about a specific topic and/or support for a candidate; an invitation to an event (e.g., a wedding, a party, a lecture, a concert, a trip, a show, a sports event), wherein the addressee may be asked to provide a reply for approving or disapproving his/her participation for the same event.
  • an event e.g., a wedding, a party, a lecture, a concert, a trip, a show, a sports event
  • the present invention discloses an automated querying distribution method conducted over a communication network.
  • the automated querying distribution method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending the plurality of queries from a terminal to the plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at the terminal at least one reply sent from at least one of the plurality of stations via at least one communication port in response to the plurality of queries; and associating the at least one reply with a respective query of the plurality of queries in accordance to the identifier of the communication port via which the respective the at least one reply were sent.
  • the automated querying distribution method may further include, for example, the acts of associating a plurality of groups of addresses of stations to a respective plurality of groups of queries; determining whether at least two different queries of respective different groups of queries are associated to the same station; determining a reply status of at least one preceding query of the different queries identified to be associated to the same station; and selecting an appropriate communication port via which at least one subsequent query of the identified queries are to be sent, according to reply status of the at least one preceding query.
  • the reply status may include, for example, information of whether replies have been received in response to the at least one respective preceding query.
  • the automated querying distribution method may include, for example, the act of sending the at least one subsequent different query of the identified queries via a communication port having an identifier that is different from the identifier via which the at least one preceding query has been sent, in the event that no reply has been received in response to the at least one preceding query.
  • the reply status may include, for example, information about whether a deadline has passed, until which a respective reply is defined as to be timely received.
  • the automated querying distribution method may include, for example, the act of sending via the same communication port over which the at least one preceding query was sent the at least one subsequent query, in the event that the deadline has passed.
  • the automated querying distribution method may include, for example, the act of analyzing received queries.
  • the present invention further discloses an automated querying distribution system.
  • the system may include a database storing a plurality of queries associated to a respective plurality of addresses of respective stations.
  • the automated querying distribution system may include at least one communication port having a respective identifier.
  • the automated querying distribution system may include a terminal that may be adapted to send the plurality of queries from a terminal to the plurality of stations via the at least one communication port. Furthermore, in embodiments of the invention, the terminal is adapted to receive at least one reply sent from at least one of the plurality of stations via at least one communication port in response to the plurality of queries
  • the automated querying distribution system may include an application that enables associating the at least one reply with a respective query of the plurality of queries in accordance to the identifier of the communication port via which the at least one reply were sent.
  • the automated querying distribution system may include a database that may include a plurality of groups of addresses of stations associated to a respective plurality of groups of queries.
  • the automated querying distribution system may include an identification module for identifying at least two different queries of respective different groups of queries, wherein the different queries are associated to the same station.
  • the automated querying distribution system may include a reply management module for determining reply status of at least one preceding query of the identified queries.
  • a switching module for selecting an appropriate communication port via which successive queries of the identified queries are to be sent, wherein identifiers of the communication ports are determined according to a reply status of the at least one preceding query.
  • the present invention further discloses a machine-readable medium storing at least one instruction that, if executed by a machine, causing the machine to perform an automated querying distribution method conducted over a communication network, wherein method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending said plurality of queries from a terminal to said plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at said terminal at least one reply sent from at least one of said plurality of stations via at least one communication port in response to said plurality of queries; and associating said at least one reply with a respective query of said plurality of queries in accordance to said identifier of said communication port via which said respective said at least one reply were sent.
  • method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending said plurality of queries from a terminal to said plurality of stations via at least one communication port, wherein
  • FIG. IA is a schematic block diagram illustration of an automated querying distribution system, according to some embodiments of the invention.
  • FIG. IB is a schematic block diagram illustration of communication port, according to some embodiments of the invention.
  • FIG. 2 is a flow-chart illustration of a method for operating the automated querying distribution system, according to some embodiments of the invention
  • FIG. 3 is a continuation of the flow-chart illustration of a method for operating the automated querying distribution system, according to some embodiments of the invention.
  • FIG. 4 is a continuation of the flow-chart illustration of FIG. 3 of a method for operating the automated querying distribution system, according to some embodiments of the invention.
  • FIG. 5 is a continuation of the flow-chart illustration of FIG. 4 of a method for operating the automated querying distribution system, according to some embodiments of the invention.
  • the automated querying system and method automatically associates a query sent to a station with a reply received from the same station in accordance to the identifier of the communication port via which the reply was sent. Furthermore, in some embodiments of the invention, the automated querying system and method may enable a user thereof to trigger the sending of a plurality of groups of queries to a respective plurality of groups of stations, whereupon at least some of the stations may send a reply in response. However, in some embodiments of the invention, queries from different groups may be associated to the same station, which may pose the problem of correctly associating queries to replies received from the same station.
  • the system and method presented herein resolves the problem by, for example, sending queries from different groups via different communication ports and/or by disregarding replies from queries that are of no relevance anymore. For example, a reply embodying an approval of participation may be disregarded, if the event has already passed at the time the reply pertaining to that event is received.
  • method refers to manners, means, techniques and procedures for accomplishing a given task including, but is not limited to those manners, means, techniques and procedures either known to, or readily developed from known manners, means, techniques and procedures by practitioners of the art to which the invention belongs.
  • the present invention can be implemented in the testing or practice with methods and materials equivalent or similar to those described herein. [0047]
  • the present invention is designed to supply an automated solution for the sending of one or more messages to multiple recipients and the receiving of one or more replies from said recipients, thereby allowing the conducting of a survey or an inquiry and enabling the sending of invitations to multiple guests to participate in a pre-defined event.
  • a comprehensive and fully automated solution for the addressing of guest invitation problem is provided.
  • the system allows a user to generate and to send electronic messages to pre-defined invited guests through various types of standard communication facilities and the collecting and analyzing of invited guests' reply.
  • the following examples illustrate the method of sending single message to multiple guests, and the receiving of the guests' replies.
  • the system enables the sending of multiple messages to any of the pre-defined recipients, and the receiving of multiple replies, thereby allowing the conducting of a survey or an inquiry.
  • an interactive message distribution system (hereinafter referred to as "system") 100 enables the sending of a plurality of groups of queries to a plurality of groups of stations. Furthermore, system 100 enables the receiving and analyzing of a respective plurality of groups of replies in response to the group of queries, as outlined below.
  • the queries of a certain group may embody the same message, whereas replies in response to queries of the same group may embody different messages.
  • queries of a first group may embody a request for approving or disapproving attendance at an event like, for example: "do you intend to attend the wedding?", whereas replies to the first group queries may be different.
  • a first addressee of a first group's query may reply with approval for attending the wedding, whereas a second addressee of a first group's query may respond with a reply, in which the second addressee declines the invitation.
  • system 100 may include at least one terminal 110, and a plurality of communication ports such as, for example, communication ports 170, 180 and 190, having respective different data enabling identification of the communication ports. Such data is hereinafter referred to as "identifier".
  • system 100 may be adapted to interactively exchange data between terminal 110 and a plurality of stations such as, for example, stations 131, 132, 133 and 134.
  • terminal 110 may be adapted to send queries to stations 131, 132, 133 and 134 and to receive queries from stations 131, 132, 133 and 134.
  • system 100 may include fewer or more communication ports than the number of communication ports specified herein.
  • the number of stations with which terminal 110 may exchange may be significantly larger.
  • system 100 may enable the interactive exchange of data between terminal 110 and, e.g., hundreds of stations.
  • Terminal 110 may include, inter alia, a storage unit 120 and a processor 111, all of which may be linked to a power supply 113.
  • Storage unit 120 may include a database 121 and a set of instructions 122.
  • database 121 and instructions 122 may each be stored in respective different storage units.
  • processor 111 may execute instructions 122 resulting in an application 112, which may in some embodiments may be web- based, that enables a user of system 100 to associate a plurality of stations to a plurality of groups of queries, respectively, as already stated above. Furthermore, queries of a given group are sent to respective stations of the same group.
  • a query may embody, without limitations, an invitation to an event, wherein the addressee is asked to either approve or disapprove his/her participation; date and time when the event is scheduled to take place; arrival instructions; a site map of the event. Furthermore, a query may embody a request to respond to a poll; voting instructions, and other event-related information. A query may optionally embody other information like, e.g., a commercial message. [0059] A query and a reply may be represented in different form such as, for example, a text message, a video message, an image, a voice message, a Braille text, or in any other suitable hardware and/or software manipulatable form. A voice message may be fetched using, for example, an interactive voice response (IVR) interface.
  • IVR interactive voice response
  • each group of stations may be associated to different groups of queries.
  • stations 131 and 132 which may constitute a first group of stations, may be associated to queries of a first group (hereinafter referred to as "first-group-queries")
  • stations 133 and 134 which may be constituted as a second group of stations, may be associated to queries of a second group (hereinafter referred to as "second-group-queries").
  • the same station may be associated to queries of different groups.
  • stations 131 and 132 may constitute the first group and may be associated to first-group queries; whereby stations 132 and 133, which may constitute the second group, may be associated to second-group-queries.
  • more than one station may be associated to queries of different groups.
  • station 131, 132 and 133 which may constitute the first group, may be associated to respective first-group-queries; whereby stations 132, 133 and 134, which may constitute the second group of stations, may be associated to respective second-group queries.
  • both stations 132 and 133 are associated to first-group- queries and to second-group-queries.
  • Associating a query to a station or vice versa may be accomplished, for example, by means of data that enables the identification of the same station. Such data is hereinafter referred to as "address”.
  • the addresses of respective stations may be stored in database 121. Consequently, system 100 enables the user to provide application 112 with a command for the sending of a plurality of groups of queries to a respective plurality of groups of stations.
  • system 100 enables the receiving and the managing of replies that may be sent to, e.g., terminal 110, in response to the group of queries.
  • application 112 provides the user with information pertaining to the status of the replies to corresponding queries and enables the user to analyze and manage the event by, for example, performing statistics on the content of the received reply. For example, application 112 may automatically output the number of meals that have to be ordered in correspondence to the replies approving participation in an event, performing poll projections and performing poll projections.
  • a station may be associated to at least one different query, i.e., such a station may be shared by queries of different groups.
  • queries of different groups may be sent to the same station (hereinafter referred to as "shared station").
  • replies received in response to the different queries may not include an indication to which query each reply refers, thereby making it difficult to correctly associate replies received from the shared station to respective queries.
  • application 112 may first determine whether a shared station exists in system 100. In the event that, e.g., application 112, identifies a shared station, i.e.
  • At least two different queries of respective different groups of queries are associated to the same station, e.g., application 112, may then determine the reply status of at least one different query of the identified different queries, determining the reply status may include, for example, the act of determining whether at least one reply has been received at, e.g. terminal 110, in response to at least one respective preceding different query that was sent to station 131 prior to the sending of a subsequent different query from terminal 110 to station 131.
  • application 112 may select an appropriate communication port via which subsequent different queries of the identified queries are to be sent to station 131.
  • application 112 may determine whether station 131 has sent a reply to terminal 110, in response to the preceding first-group-query. If station 131 has sent a reply to the preceding first-group-query, before terminal 110 sends to station 131 the second-group-query, then application 112 may select communication port 170 (via which the preceding first-group-query has been sent) as the communication port via which the second-group-query is to be sent to station 131. Correspondingly, application 112 correctly associates replies to the preceding first- group-query and the second-group-query. This, since a received reply cannot possibly refer to the at least one preceding first-group-query, as a reply to the first-group-query has already been received.
  • application 112 may select a different communication port having a corresponding different identifier (e.g., communication port 180) via which the subsequent second-group-query is to be sent to station 131. Consequently, replies in response the first- and the second-group-query are received at terminal 110 via respective communication ports 170 and 180. Thus, application 112 may correctly associate the first- and the second-group-query to corresponding replies in accordance to the identifiers of communication ports 170 and 180.
  • a different communication port having a corresponding different identifier e.g., communication port 180
  • system 100 is adapted to correctly associate a plurality of queries to a station, to a respective plurality of replies received from the same station, by taking into account the date and optionally the time to which a query refers to.
  • terminal 110 may send to a station such as, for example, station 131, the first-group-query and the second-event-query that may include a request to affirm participation to an invitation to a first and a second event, respectively, that may follow each other chronologically, i.e., the first event may be scheduled to take place prior to the second event.
  • the first event may be scheduled to take place at a date that is before the date at which the second event is scheduled to take place.
  • both the first and the second event may take place at the same date, but the first event may be scheduled to take place at an earlier hour than the second event.
  • the first event may be scheduled to take place during the morning hours, whereas the second event may be scheduled to take place during the evening hours of the same date.
  • first-group-queries and second-group-queries may be sent to a station such as, for example, station 131, at different sequences.
  • terminal 110 may send the first-group-query to station 131 prior to second-group-query, and vice versa.
  • first-group -query is sent out to, e.g., station 131 via communication links 171 and 141, and application 112 receives an input from, e.g., the user, which indicates that the second-group-query is to be sent out
  • application 112 may determine whether a deadline has passed until which a respective reply, in response to the first-event-query, is defined as to be timely received.
  • Such a deadline may correspond to, for example, the scheduled starting time or expected end time of the first event.
  • the starting time of the first event may coincide or correspond to, for example, the reception time of a wedding, the beginning of an election day, the beginning of a sports event or any other event whose occurrence may be time-conditioned. Accordingly, if for example, the deadline corresponds to a scheduled date and start time of the first event, and no reply has been received at, e.g., terminal 110, until the scheduled start time and date, application 112 may determine that the subsequent second-group-query may be sent to station 131 via the same communication port via which the preceding first-group-query was sent.
  • the deadline may precede, for example, the starting time or the end time of a specific event by a predetermined time span.
  • the deadline may be set, for example, by the user to be, e.g., two hours before the scheduled start time of an event.
  • application 112 may cause the sending of the second-event-query from a different communication port (e.g., communication port 180).
  • the deadline until which a station may send a reply to the first-event-query may be predetermined by the user.
  • the deadline may be set automatically by, e.g., application 112, according to a default value or depending on the type of event and/or depending on the time at which the first-event-query has been sent out to the station to which the addressee is associated to. For example, if the first- event-query embodies an invitation to a party, whereby the first-event-query is issued within 24 hours before the scheduled starting time and date of the party, application 112 may determine that the deadline coincides with the same scheduled starting time and date.
  • first-event-query embodies an invitation to a wedding and the first- event-query was sent to respective stations, e.g., more than 3 months prior to the scheduled date and starting time of the wedding
  • application 112 may determine that the deadline may be set at least two weeks before the scheduled wedding.
  • an application of system 100 such as, e.g., application 112 may provide limitations to a deadline that are determinable by the user. For example, application 112 may not enable the user to set a deadline to a reply to the first- event-query, such that the deadline exceeds the scheduled end time of the first event.
  • an application of system 100 such as, for example, application 112 may enable determining the number of different communication ports that the system 100 has to include in order to ensure that each reply can be correctly associated to respective queries.
  • the method may include asking the question whether a user of system 100 is registered.
  • the method may include, for example, the act of registering a user to system 100, if the user is not registered yet.
  • the user may have to provide payment information (e.g., credit card information, number of bank account), and/or other personal information such as, for example, telephone number, mobile number, physical address, E-mail address, define a login name and/or define a password and the like.
  • payment information e.g., credit card information, number of bank account
  • other personal information such as, for example, telephone number, mobile number, physical address, E-mail address
  • the method may include, for example, the act of login into system 100.
  • the act of login the user into system 100 may be accomplished, e.g., as known in the art, by providing, for example, login information (e.g., login name and/or password) whereupon an application such as, for example, application 112 of system 100 determines whether the login information provided by the user corresponds to data representing login information stored in system 100.
  • login information e.g., login name and/or password
  • the data representing the user's login information may be stored in, e.g., storage unit 120.
  • the method may include, for example, the act of specifying parameters for a plurality of events by, e.g., the user. Such parameters may include, for example, date and/or time and/or place at which an event is scheduled to take place, the communication means by which a query pertaining to the event is to be sent to each addressee; the deadline until which each or some of the addressees have to reply to the query; and a time-span during which the query may be sent to each of the addressees are associated to; and the like.
  • the user may specify a parameter representing a minimum threshold number of replies confirming participation to such an event within a predetermined time span. It should be understood that the act specified by box 215 may recur until the parameters for the event are specified.
  • a first-event-deadline may be associated to the first-group-queries
  • a second-event deadline may be associated to the second-group-queries.
  • the method may include, for example, the act of associating a plurality of respective addresses of stations to a respective plurality of groups of queries.
  • the method may include, for example, the act of sending via a given communication port a given group of queries to a respective given group of stations.
  • the method may include, for example, the act of determining whether at least one of the stations is shared by at least one different query of another respective group of queries. If no station is identified as being shared by at least one different query, the method may include, as indicated by box 325, the act of sending the at least one subsequent different query via the given communication port. If at least one station is shared by at least one different query, the method may include, as indicated by box 320, the act of determining whether a reply has been received from the shared station in response to at least one preceding query of the queries that are identified of being associated to the same station.
  • the method may include, as indicated by box 325, for example, the act of sending the at least one different query via the same given communication port. If no reply has been received from the shared station, the method may include as indicated by box 340, for example, the act of sending at least one subsequent different query of the respective different group of queries to the shared station, via a respective different communication port. [0082] Reference is now made to FIG. 4. In some embodiments of the invention, the method may include, instead or in addition to the act indicated by box 320, an act that is indicated by box 420.
  • the method may include, for example, the act of determining whether a deadline is exceeded for receiving a reply from the shared station, in response to a query of the given group of queries. In the event the deadline has not been passed, the method may include, as indicated by box 340, the act of sending the at least one subsequent different query via respective different communication port to the shared station.
  • the method may include, as indicated by box 325, the act of sending the at least one subsequent different query via the given communication port.
  • the method may include, as indicated by box 510, for example, the act of receiving replies to queries, e.g., terminal 110.
  • the method may include, for example, the act of analyzing received replies.
  • system 110 may include an application like, e.g., application 112, that may enable the user to define that queries that are to be resent if within a certain time limit no reply has been received from addressees to a certain query. For example, the user may define that if less than 20% of the addressees of specific event did not reply until one week before the event, then the queries pertaining to the same event are resent to the addressees that have not yet replied.
  • an application like, e.g., application 112
  • the user may define that if less than 20% of the addressees of specific event did not reply until one week before the event, then the queries pertaining to the same event are resent to the addressees that have not yet replied.
  • the act of analyzing of received replies may include the act of determining whether a predetermined minimum number replies for a specific event has been received at, e.g., terminal 110.
  • Other acts of analyzing may be performed that may include, without limitations, automatically generating a seating order for the addressees that approved participation at the event, automatically ordering the required amount of meals, budget analysis, determining the number of waiters needed, and estimating the number of parking lots needed.
  • system 100 may perform a projection for the poll results.
  • system 100 enables performing of cost optimization.
  • the cheapest communication means may be used the first time for sending out queries for a specific event, whereas more expensive messages (e.g., voice messages), are sent only to those addressees who have not replied within a certain time span.
  • a station and/or a terminal such as, for example, station 131, station 132, station 133, station 134 and terminal 110, may be embodied, without limitations, by a cellular telephone, by a wireless telephone, by a Personal Communication Systems (PCS) device, by a PDA device that incorporates a wireless communication device, by a tablet computer, by a server computer, by a personal computer, by a wireless communication station, by a mobile computer, by a notebook computer, by a desktop computer, by a laptop computer a Personal Digital Assistant (PDA) device, by a landline phone, a pager, by server (e.g., SMS server, MMS server, internet server) and the like.
  • PCS Personal Communication Systems
  • PDA Personal Digital Assistant
  • a processor such as, for example, processor 111 may be embodied, without limitations, by a chip, by a microprocessor, by a controller, by a Central Processing Unit (CPU), by a Digital Signal Processor (DSP), by a microchip, by an Integrated Circuit (IC), or any other suitable multi-purpose or specific processor or controller.
  • CPU Central Processing Unit
  • DSP Digital Signal Processor
  • IC Integrated Circuit
  • a storage unit such as, for example, storage unit 120 may be embodied, without limitations, by a hard disk drive, by a floppy disk drive, by a Compact Disk (CD) drive, by a CD-ROM drive, by a digital versatile disc (DVD) drive, or other suitable removable or nonremovable storage units.
  • storage unit 120 may be embodied, for example, by a Random Access Memory (RAM), by a Dynamic RAM (DRAM), by a Synchronous DRAM (SD-RAM), by a Flash memory, by a volatile memory, by a non-volatile memory, by a cache memory, by a buffer, by a short-term memory unit, by a long-term memory unit, or other suitable memory units or storage units.
  • RAM Random Access Memory
  • DRAM Dynamic RAM
  • SD-RAM Synchronous DRAM
  • Flash memory by a volatile memory, by a non-volatile memory, by a cache memory, by a buffer, by a short-term memory unit, by a long-
  • a power supplys such as, for example, power supply 113 may be embodied, without limitations, by a rechargeable battery, by a non-rechargeable battery, or by any other suitable power supply.
  • FIG. 1 It should be understood that some embodiments of the invention may be implemented, for example, using a machine-readable medium or article which may store an instruction or a set of instructions that, if executed by a machine, cause the machine to perform a method or operations or both in accordance with embodiments of the invention.
  • a machine may include, for example, any suitable processing platform, computing platform, computing device, processing device, computing system, processing system, computer, processor, or the like, and may be implemented using any suitable combination of hardware or software or both.
  • the machine-readable medium or article may include but is not limited to, any suitable type of memory unit, memory device, memory article, memory medium, storage article, storage device, storage medium or storage unit such as, for example, memory, removable or non-removable media, erasable or non-erasable media, writeable or re-writeable media, digital or analog media, optical disk, hard disk, floppy disk, Compact Disk Recordable (CD-R), Compact Disk Read Only Memory (CD-ROM), Compact Disk Rewriteable (CD- RW), magnetic media, various types of Digital Versatile Disks (DVDs), a rewritable DVD, a tape, a cassette, or the like.
  • any suitable type of memory unit such as, for example, memory, removable or non-removable media, erasable or non-erasable media, writeable or re-writeable media, digital or analog media, optical disk, hard disk, floppy disk, Compact Disk Recordable (CD-R), Compact Disk Read Only Memory (CD-ROM),
  • the instructions may include any suitable type of code, for example, an executable code, a compiled code, a dynamic code, a static code, interpreted code, a source code or the like, and may be implemented using any suitable high-level, low-level, object-oriented, visual, compiled or interpreted programming language.
  • a compiled or interpreted programming language may be, for example, C, C++, C#, .Net, Java, Pascal, MATLAB, BASIC, Cobol, Fortran, assembly language, machine code and the like.
  • embodiments of the invention may be used in a variety of applications. Examples of embodiments of the invention may include the usage of the invention in conjunction with many networks.
  • Examples of such networks may include, without limitation, a wide area network (WAN), local area network (LAN), a global communication network, e.g., the Internet, a wireless communication network such as, for example, a wireless LAN (WLAN) communication network, a wireless virtual private network (VPN), a Bluetooth network, a cellular communication network, for example, a 3 rd Generation Partnership Project (3GPP), such as, for example, a Global System for Mobile communications (GSM) network, a Code Division Multiple Access (CDMA) communication network, a Wideband CDMA communication network, a Frequency Domain Duplexing (FDD) network, and the like.
  • WAN wide area network
  • LAN local area network
  • a global communication network e.g., the Internet
  • a wireless communication network such as, for example, a wireless LAN (WLAN) communication network, a wireless virtual private network (VPN), a Bluetooth network
  • a cellular communication network for example, a 3 rd Generation Partnership Project (3GPP), such as

Abstract

The present invention discloses an automated querying distribution method conducted over a communication network. The automated querying distribution method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending the plurality of queries from a terminal to the plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at the terminal at least one reply sent from at least one of the plurality of stations via at least one communication port in response to the plurality of queries; and associating the at least one reply with a respective query of the plurality of queries in accordance to the identifier of the communication port via which the respective the at least one reply were sent.

Description

AUTOMATED QUERYING DISTRIBUTION SYSTEM AND METHOD
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application claims the benefit and priority of U.S. Provisional Patent application no. 60/816,335 filed on June 26, 2006, the full disclosure which is incorporated by reference in its entirety herein.
BACKGROUND OF THE INVENTION
[0002] The process of distributing a query to a plurality of addressee and gathering replies from the same plurality of addressees may be an onerous, inefficient and time consuming process. This may especially true in the event that an issuer of such a query has to contact personally some addressees by, for example, directing of phone calls to gather a reply. [0003] Such a query may be related to, for example, an opinion poll, wherein the addressee may be asked, for example, to provide a reply in which the addressee declares his/her position about a specific topic and/or support for a candidate; an invitation to an event (e.g., a wedding, a party, a lecture, a concert, a trip, a show, a sports event), wherein the addressee may be asked to provide a reply for approving or disapproving his/her participation for the same event.
SUMMARY OF SOME EMBODIMENTS OF THE INVENTION
[0004] The present invention discloses an automated querying distribution method conducted over a communication network. In embodiments of the invention, the automated querying distribution method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending the plurality of queries from a terminal to the plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at the terminal at least one reply sent from at least one of the plurality of stations via at least one communication port in response to the plurality of queries; and associating the at least one reply with a respective query of the plurality of queries in accordance to the identifier of the communication port via which the respective the at least one reply were sent.
[0005] In embodiments of the invention, the automated querying distribution method may further include, for example, the acts of associating a plurality of groups of addresses of stations to a respective plurality of groups of queries; determining whether at least two different queries of respective different groups of queries are associated to the same station; determining a reply status of at least one preceding query of the different queries identified to be associated to the same station; and selecting an appropriate communication port via which at least one subsequent query of the identified queries are to be sent, according to reply status of the at least one preceding query.
[0006] In embodiments of the invention, the reply status may include, for example, information of whether replies have been received in response to the at least one respective preceding query.
[0007] In embodiments of the invention, the automated querying distribution method may include, for example, the act of sending the at least one subsequent different query of the identified queries via a communication port having an identifier that is different from the identifier via which the at least one preceding query has been sent, in the event that no reply has been received in response to the at least one preceding query.
[0008] In embodiments of the invention, the reply status may include, for example, information about whether a deadline has passed, until which a respective reply is defined as to be timely received. [0009] In embodiments of the invention, the automated querying distribution method may include, for example, the act of sending via the same communication port over which the at least one preceding query was sent the at least one subsequent query, in the event that the deadline has passed.
[0010] In embodiments of the invention, the automated querying distribution method may include, for example, the act of analyzing received queries.
[0011] The present invention further discloses an automated querying distribution system. In some embodiments of the invention, the system may include a database storing a plurality of queries associated to a respective plurality of addresses of respective stations.
[0012] In embodiments of the invention, the automated querying distribution system may include at least one communication port having a respective identifier.
[0013] In embodiments of the invention, the automated querying distribution system may include a terminal that may be adapted to send the plurality of queries from a terminal to the plurality of stations via the at least one communication port. Furthermore, in embodiments of the invention, the terminal is adapted to receive at least one reply sent from at least one of the plurality of stations via at least one communication port in response to the plurality of queries
[0014] In embodiments of the invention, the automated querying distribution system may include an application that enables associating the at least one reply with a respective query of the plurality of queries in accordance to the identifier of the communication port via which the at least one reply were sent.
[0015] In embodiments of the invention, the automated querying distribution system may include a database that may include a plurality of groups of addresses of stations associated to a respective plurality of groups of queries. [0016] In embodiments of the invention, the automated querying distribution system may include an identification module for identifying at least two different queries of respective different groups of queries, wherein the different queries are associated to the same station. [0017] In embodiments of the invention, the automated querying distribution system may include a reply management module for determining reply status of at least one preceding query of the identified queries.
[0018] In embodiments of the invention, a switching module for selecting an appropriate communication port via which successive queries of the identified queries are to be sent, wherein identifiers of the communication ports are determined according to a reply status of the at least one preceding query.
[0019] The present invention further discloses a machine-readable medium storing at least one instruction that, if executed by a machine, causing the machine to perform an automated querying distribution method conducted over a communication network, wherein method may include the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending said plurality of queries from a terminal to said plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at said terminal at least one reply sent from at least one of said plurality of stations via at least one communication port in response to said plurality of queries; and associating said at least one reply with a respective query of said plurality of queries in accordance to said identifier of said communication port via which said respective said at least one reply were sent. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] These and further features and advantages of the invention will become more clearly understood in the light of the ensuing description of a some embodiments thereof, given by way of example only, with reference to the accompanying figures (FIGs), wherein:
[0021] FIG. IA is a schematic block diagram illustration of an automated querying distribution system, according to some embodiments of the invention;
[0022] FIG. IB is a schematic block diagram illustration of communication port, according to some embodiments of the invention;
[0023] FIG. 2 is a flow-chart illustration of a method for operating the automated querying distribution system, according to some embodiments of the invention;
[0024] FIG. 3 is a continuation of the flow-chart illustration of a method for operating the automated querying distribution system, according to some embodiments of the invention;
[0025] FIG. 4 is a continuation of the flow-chart illustration of FIG. 3 of a method for operating the automated querying distribution system, according to some embodiments of the invention; and
[0026] FIG. 5 is a continuation of the flow-chart illustration of FIG. 4 of a method for operating the automated querying distribution system, according to some embodiments of the invention.
[0027] The drawings taken with description make apparent to those skilled in the art how the invention may be embodied in practice.
[0028] It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate identical elements.
DESCRIPTION OF SOME EMBODIMENTS OF THE INVENTION
[0029] An automated querying system and method are presented herein, which provide a solution for the need of automatically associating a query sent to a station with a reply received from the same station.
[0030] In some embodiments of the invention, the automated querying system and method automatically associates a query sent to a station with a reply received from the same station in accordance to the identifier of the communication port via which the reply was sent. Furthermore, in some embodiments of the invention, the automated querying system and method may enable a user thereof to trigger the sending of a plurality of groups of queries to a respective plurality of groups of stations, whereupon at least some of the stations may send a reply in response. However, in some embodiments of the invention, queries from different groups may be associated to the same station, which may pose the problem of correctly associating queries to replies received from the same station. The system and method presented herein resolves the problem by, for example, sending queries from different groups via different communication ports and/or by disregarding replies from queries that are of no relevance anymore. For example, a reply embodying an approval of participation may be disregarded, if the event has already passed at the time the reply pertaining to that event is received.
[0031] It should be understood that an embodiment is an example or implementation of the inventions. The various appearances of "one embodiment," "an embodiment" or "some embodiments" do not necessarily all refer to the same embodiments. [0032] Although various features of the invention may be described in the context of a single embodiment, the features may also be provided separately or in any suitable combination.
Conversely, although the invention may be described herein in the context of separate embodiments for clarity, the invention may also be implemented in a single embodiment.
[0033] Reference in the specification to "one embodiment", "an embodiment", "some embodiments" or "other embodiments" means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment, but not necessarily all embodiments, of the inventions.
[0034] It should be understood that the phraseology and terminology employed herein is not to be construed as limiting and is for descriptive purpose only.
[0035] The principles and uses of the teachings of the present invention may be better understood with reference to the accompanying description, figures and examples.
[0036] It should be understood that the details set forth herein do not construe a limitation to an application of the invention. Furthermore, it should be understood that the invention can be carried out or practiced in various ways and that the invention can be implemented in embodiments other than the ones outlined in the description below.
[0037] It should be understood that the terms "including", "comprising", "consisting" and grammatical variants thereof do not preclude the addition of one or more components, features, steps, integers or groups thereof and that the terms are not to be construed as specifying components, features, steps or integers.
[0038] The phrase "consisting essentially of", and grammatical variants thereof, when used herein is not to be construed as excluding additional components, steps, features, integers or groups thereof but rather that the additional features, integers, steps, components or groups thereof do not materially alter the basic and characteristics of the claimed composition, device or method.
[0039] If the specification or claims refer to "an additional" element, that does not preclude there being more than one of the additional element.
[0040] It should be understood that where the claims or specification refer to "a" or "an" element, such reference is not to be construed as there being only one of that element.
[0041] It should be understood that where the specification states that a component, feature, structure, or characteristic "may", "might", "can" or "could" be included, that particular component, feature, structure, or characteristic is not required to be included.
[0042] Where applicable, although state diagrams, flow diagrams or both may be used to describe embodiments, the invention is not limited to those diagrams or to the corresponding descriptions. For example, flow need not move through each illustrated box or state, or in exactly the same order as illustrated and described.
[0043] The term "method" refers to manners, means, techniques and procedures for accomplishing a given task including, but is not limited to those manners, means, techniques and procedures either known to, or readily developed from known manners, means, techniques and procedures by practitioners of the art to which the invention belongs.
[0044] The descriptions, examples, methods and materials presented in the claims and the specification are not to be construed as limiting but rather as illustrative only.
[0045] Meanings of technical and scientific terms used herein ought to be commonly understood as by one of ordinary skill in the art to which the invention belongs, unless otherwise defined.
[0046] The present invention can be implemented in the testing or practice with methods and materials equivalent or similar to those described herein. [0047] The present invention is designed to supply an automated solution for the sending of one or more messages to multiple recipients and the receiving of one or more replies from said recipients, thereby allowing the conducting of a survey or an inquiry and enabling the sending of invitations to multiple guests to participate in a pre-defined event.
[0048] In accordance with one aspect of the present invention, a comprehensive and fully automated solution for the addressing of guest invitation problem is provided. The system allows a user to generate and to send electronic messages to pre-defined invited guests through various types of standard communication facilities and the collecting and analyzing of invited guests' reply. The following examples illustrate the method of sending single message to multiple guests, and the receiving of the guests' replies.
[0049] In accordance with another aspect of the present invention, the system enables the sending of multiple messages to any of the pre-defined recipients, and the receiving of multiple replies, thereby allowing the conducting of a survey or an inquiry.
[0050] Although some demonstrative embodiments of the invention are not limited in this regard, discussions utilizing terms such as, for example, "processing," "computing," "calculating," "determining," "establishing", "analyzing", "checking", or the like, may refer to operation(s) and/or process(es) of a computer, a computing platform, a computing system, or other electronic computing device, that manipulate and/or transform data represented as physical (e.g., electronic) quantities within the computer's registers and/or memories into other data similarly represented as physical quantities within the computer's registers and/or memories or other information storage medium that may store instructions to execute operations and/or processes and/or applications.
[0051] It should be understood that terms used herein that refer to the sending and/or receiving of information from at least one module and/or station to at least one another module and/or station, refers to the sending and/or receiving of data representing the same information from the at least one module and/or station to the at least one another module and/or station. Correspondingly, terms such as, for example, "sending a reply", "receiving a reply", "sending a query" and "receiving a query" and grammatical variations thereof are referred to as processes or acts of sending data representing a reply, receiving data representing a reply, sending data representing a query and receiving data representing a query, respectively. [0052] Reference is now made to Fig. IA and to FIG. IB. According to some embodiments of the invention, an interactive message distribution system (hereinafter referred to as "system") 100 enables the sending of a plurality of groups of queries to a plurality of groups of stations. Furthermore, system 100 enables the receiving and analyzing of a respective plurality of groups of replies in response to the group of queries, as outlined below. It should be noted that the queries of a certain group may embody the same message, whereas replies in response to queries of the same group may embody different messages. For example, queries of a first group may embody a request for approving or disapproving attendance at an event like, for example: "do you intend to attend the wedding?", whereas replies to the first group queries may be different. A first addressee of a first group's query may reply with approval for attending the wedding, whereas a second addressee of a first group's query may respond with a reply, in which the second addressee declines the invitation.
[0053] According to some embodiments of the invention, system 100 may include at least one terminal 110, and a plurality of communication ports such as, for example, communication ports 170, 180 and 190, having respective different data enabling identification of the communication ports. Such data is hereinafter referred to as "identifier". Furthermore, system 100 may be adapted to interactively exchange data between terminal 110 and a plurality of stations such as, for example, stations 131, 132, 133 and 134. For example, terminal 110 may be adapted to send queries to stations 131, 132, 133 and 134 and to receive queries from stations 131, 132, 133 and 134.
[0054] It should be understood that the numbers of elements specified herein is not to be construed as limiting. Correspondingly, system 100 may include fewer or more communication ports than the number of communication ports specified herein. Furthermore, the number of stations with which terminal 110 may exchange may be significantly larger. For example, system 100 may enable the interactive exchange of data between terminal 110 and, e.g., hundreds of stations.
[0055] Terminal 110 (see FIG. IB) may include, inter alia, a storage unit 120 and a processor 111, all of which may be linked to a power supply 113.
[0056] Storage unit 120 may include a database 121 and a set of instructions 122. In some embodiments, database 121 and instructions 122 may each be stored in respective different storage units.
[0057] According to some embodiments of the invention, processor 111 may execute instructions 122 resulting in an application 112, which may in some embodiments may be web- based, that enables a user of system 100 to associate a plurality of stations to a plurality of groups of queries, respectively, as already stated above. Furthermore, queries of a given group are sent to respective stations of the same group.
[0058] According to some embodiments of the invention, a query may embody, without limitations, an invitation to an event, wherein the addressee is asked to either approve or disapprove his/her participation; date and time when the event is scheduled to take place; arrival instructions; a site map of the event. Furthermore, a query may embody a request to respond to a poll; voting instructions, and other event-related information. A query may optionally embody other information like, e.g., a commercial message. [0059] A query and a reply may be represented in different form such as, for example, a text message, a video message, an image, a voice message, a Braille text, or in any other suitable hardware and/or software manipulatable form. A voice message may be fetched using, for example, an interactive voice response (IVR) interface.
[0060] In some embodiments of the invention, each group of stations may be associated to different groups of queries. For example, as shown in FIG. IA, stations 131 and 132, which may constitute a first group of stations, may be associated to queries of a first group (hereinafter referred to as "first-group-queries"), whereas stations 133 and 134, which may be constituted as a second group of stations, may be associated to queries of a second group (hereinafter referred to as "second-group-queries").
[0061] In some embodiments of the invention, the same station may be associated to queries of different groups. For example, stations 131 and 132 may constitute the first group and may be associated to first-group queries; whereby stations 132 and 133, which may constitute the second group, may be associated to second-group-queries.
[0062] In some embodiments of the invention, more than one station may be associated to queries of different groups. For example, station 131, 132 and 133, which may constitute the first group, may be associated to respective first-group-queries; whereby stations 132, 133 and 134, which may constitute the second group of stations, may be associated to respective second-group queries. Accordingly, both stations 132 and 133 are associated to first-group- queries and to second-group-queries.
[0063] Associating a query to a station or vice versa may be accomplished, for example, by means of data that enables the identification of the same station. Such data is hereinafter referred to as "address". [0064] The addresses of respective stations may be stored in database 121. Consequently, system 100 enables the user to provide application 112 with a command for the sending of a plurality of groups of queries to a respective plurality of groups of stations. [0065] According to some embodiments, system 100 enables the receiving and the managing of replies that may be sent to, e.g., terminal 110, in response to the group of queries. Further, application 112 provides the user with information pertaining to the status of the replies to corresponding queries and enables the user to analyze and manage the event by, for example, performing statistics on the content of the received reply. For example, application 112 may automatically output the number of meals that have to be ordered in correspondence to the replies approving participation in an event, performing poll projections and performing poll projections.
[0066] As mentioned above, a station may be associated to at least one different query, i.e., such a station may be shared by queries of different groups. Correspondingly, queries of different groups may be sent to the same station (hereinafter referred to as "shared station"). However, replies received in response to the different queries may not include an indication to which query each reply refers, thereby making it difficult to correctly associate replies received from the shared station to respective queries. In order to ensure that replies received from the shared station are correctly associated to the queries, e.g., application 112, may first determine whether a shared station exists in system 100. In the event that, e.g., application 112, identifies a shared station, i.e. at least two different queries of respective different groups of queries are associated to the same station, e.g., application 112, may then determine the reply status of at least one different query of the identified different queries, determining the reply status may include, for example, the act of determining whether at least one reply has been received at, e.g. terminal 110, in response to at least one respective preceding different query that was sent to station 131 prior to the sending of a subsequent different query from terminal 110 to station 131. In accordance to the reply status of the least one different preceding query, e.g., application 112 may select an appropriate communication port via which subsequent different queries of the identified queries are to be sent to station 131.
[0067] For example, prior to sending the subsequent second-group-query to station 131, application 112 may determine whether station 131 has sent a reply to terminal 110, in response to the preceding first-group-query. If station 131 has sent a reply to the preceding first-group-query, before terminal 110 sends to station 131 the second-group-query, then application 112 may select communication port 170 (via which the preceding first-group-query has been sent) as the communication port via which the second-group-query is to be sent to station 131. Correspondingly, application 112 correctly associates replies to the preceding first- group-query and the second-group-query. This, since a received reply cannot possibly refer to the at least one preceding first-group-query, as a reply to the first-group-query has already been received.
[0068] However, if prior to the sending of the subsequent second-group-query from terminal 110 to station 131, application 112 determines that terminal 110 has not yet received a reply from station 131 in response to the preceding first-group-query, application 112 may select a different communication port having a corresponding different identifier (e.g., communication port 180) via which the subsequent second-group-query is to be sent to station 131. Consequently, replies in response the first- and the second-group-query are received at terminal 110 via respective communication ports 170 and 180. Thus, application 112 may correctly associate the first- and the second-group-query to corresponding replies in accordance to the identifiers of communication ports 170 and 180. [0069] Further, according to some embodiments of the invention, system 100 is adapted to correctly associate a plurality of queries to a station, to a respective plurality of replies received from the same station, by taking into account the date and optionally the time to which a query refers to. For example, terminal 110 may send to a station such as, for example, station 131, the first-group-query and the second-event-query that may include a request to affirm participation to an invitation to a first and a second event, respectively, that may follow each other chronologically, i.e., the first event may be scheduled to take place prior to the second event. For example, the first event may be scheduled to take place at a date that is before the date at which the second event is scheduled to take place. Alternatively, both the first and the second event may take place at the same date, but the first event may be scheduled to take place at an earlier hour than the second event. For example, the first event may be scheduled to take place during the morning hours, whereas the second event may be scheduled to take place during the evening hours of the same date.
[0070] It should be understood that first-group-queries and second-group-queries may be sent to a station such as, for example, station 131, at different sequences. For example, terminal 110 may send the first-group-query to station 131 prior to second-group-query, and vice versa. However, if, for example, first-group -query is sent out to, e.g., station 131 via communication links 171 and 141, and application 112 receives an input from, e.g., the user, which indicates that the second-group-query is to be sent out, application 112 may determine whether a deadline has passed until which a respective reply, in response to the first-event-query, is defined as to be timely received. Such a deadline may correspond to, for example, the scheduled starting time or expected end time of the first event. The starting time of the first event may coincide or correspond to, for example, the reception time of a wedding, the beginning of an election day, the beginning of a sports event or any other event whose occurrence may be time-conditioned. Accordingly, if for example, the deadline corresponds to a scheduled date and start time of the first event, and no reply has been received at, e.g., terminal 110, until the scheduled start time and date, application 112 may determine that the subsequent second-group-query may be sent to station 131 via the same communication port via which the preceding first-group-query was sent. This, a reply received from station 131 will be associated by application 112 to the second-event-query, as it can be assumed that the addressee of the first-event-query is most probably aware of the fact that a reply to the first- event-query may not be relevant anymore. In some embodiments of the invention, the deadline may precede, for example, the starting time or the end time of a specific event by a predetermined time span. The deadline may be set, for example, by the user to be, e.g., two hours before the scheduled start time of an event. However, if, for example, application 112, determines that the deadline to receive a reply to first-event-query from, e.g., station 131 has not yet been exceeded, and that an application such as, e.g., application 112, receives a command to send the second-event-query to station 131, then application 112 may cause the sending of the second-event-query from a different communication port (e.g., communication port 180).
[0071] According to some embodiments of the invention, the deadline until which a station may send a reply to the first-event-query may be predetermined by the user. Alternatively, the deadline may be set automatically by, e.g., application 112, according to a default value or depending on the type of event and/or depending on the time at which the first-event-query has been sent out to the station to which the addressee is associated to. For example, if the first- event-query embodies an invitation to a party, whereby the first-event-query is issued within 24 hours before the scheduled starting time and date of the party, application 112 may determine that the deadline coincides with the same scheduled starting time and date. In distinct contrast, if the first-event-query embodies an invitation to a wedding and the first- event-query was sent to respective stations, e.g., more than 3 months prior to the scheduled date and starting time of the wedding, application 112 may determine that the deadline may be set at least two weeks before the scheduled wedding.
[0072] According to some embodiments of the invention, an application of system 100 such as, e.g., application 112, may provide limitations to a deadline that are determinable by the user. For example, application 112 may not enable the user to set a deadline to a reply to the first- event-query, such that the deadline exceeds the scheduled end time of the first event. [0073] According to some embodiments of the invention, an application of system 100 such as, for example, application 112 may enable determining the number of different communication ports that the system 100 has to include in order to ensure that each reply can be correctly associated to respective queries. The number of different communication ports may depend, inter alia, on the following parameters: the population size of the addressees (i.e., number of stations to which a query has to be sent), the type of events embodied by respective queries, and the timing at which each query is sent out the respective addressees. [0074] Reference is now made to FIG. 2. In embodiments of the invention, as indicated by box 205, the method may include asking the question whether a user of system 100 is registered. [0075] In embodiments of the invention, as indicated by box 210a, the method may include, for example, the act of registering a user to system 100, if the user is not registered yet. In order for a user to be registered, the user may have to provide payment information (e.g., credit card information, number of bank account), and/or other personal information such as, for example, telephone number, mobile number, physical address, E-mail address, define a login name and/or define a password and the like. In embodiments of the invention, as indicated by box 210b, the method may include, for example, the act of login into system 100. The act of login the user into system 100 may be accomplished, e.g., as known in the art, by providing, for example, login information (e.g., login name and/or password) whereupon an application such as, for example, application 112 of system 100 determines whether the login information provided by the user corresponds to data representing login information stored in system 100. The data representing the user's login information may be stored in, e.g., storage unit 120. [0076] Once the user is properly registered, as indicated by box 215, the method may include, for example, the act of specifying parameters for a plurality of events by, e.g., the user. Such parameters may include, for example, date and/or time and/or place at which an event is scheduled to take place, the communication means by which a query pertaining to the event is to be sent to each addressee; the deadline until which each or some of the addressees have to reply to the query; and a time-span during which the query may be sent to each of the addressees are associated to; and the like. Furthermore, in the case in which the execution of the event depends of the number of participants, the user may specify a parameter representing a minimum threshold number of replies confirming participation to such an event within a predetermined time span. It should be understood that the act specified by box 215 may recur until the parameters for the event are specified.
[0077] It should be noted that different queries may have different deadlines. For example, a first-event-deadline may be associated to the first-group-queries, and a second-event deadline may be associated to the second-group-queries.
[0078] It should further be noted that in some embodiments of the invention, no correlation may exist between the scheduled occurrence of the events and between the respective deadlines. For example, an event to which the first-group -queries pertains, may be scheduled to take place prior to the event to which the second-event-query pertains, though the first-event deadline may be set after the second-event-deadline. [0079] In embodiments of the invention, as indicated by box 220, the method may include, for example, the act of associating a plurality of respective addresses of stations to a respective plurality of groups of queries.
[0080] In embodiments of the invention, as indicated by box 225, the method may include, for example, the act of sending via a given communication port a given group of queries to a respective given group of stations.
[0081] Reference is now made to FIG. 3. In embodiments of the invention, as indicated by box 315, the method may include, for example, the act of determining whether at least one of the stations is shared by at least one different query of another respective group of queries. If no station is identified as being shared by at least one different query, the method may include, as indicated by box 325, the act of sending the at least one subsequent different query via the given communication port. If at least one station is shared by at least one different query, the method may include, as indicated by box 320, the act of determining whether a reply has been received from the shared station in response to at least one preceding query of the queries that are identified of being associated to the same station. If a reply from the shared station has been received, the method may include, as indicated by box 325, for example, the act of sending the at least one different query via the same given communication port. If no reply has been received from the shared station, the method may include as indicated by box 340, for example, the act of sending at least one subsequent different query of the respective different group of queries to the shared station, via a respective different communication port. [0082] Reference is now made to FIG. 4. In some embodiments of the invention, the method may include, instead or in addition to the act indicated by box 320, an act that is indicated by box 420. As indicated by box 328, the method may include, for example, the act of determining whether a deadline is exceeded for receiving a reply from the shared station, in response to a query of the given group of queries. In the event the deadline has not been passed, the method may include, as indicated by box 340, the act of sending the at least one subsequent different query via respective different communication port to the shared station.
Conversely, in the event that the deadline has been exceeded, the method may include, as indicated by box 325, the act of sending the at least one subsequent different query via the given communication port.
[0083] Reference is now made to FIG. 5. In embodiments of the invention, the method may include, as indicated by box 510, for example, the act of receiving replies to queries, e.g., terminal 110.
[0084] In embodiments of the invention, as indicated by box 515, the method may include, for example, the act of analyzing received replies.
[0085] In some embodiments of the invention, system 110 may include an application like, e.g., application 112, that may enable the user to define that queries that are to be resent if within a certain time limit no reply has been received from addressees to a certain query. For example, the user may define that if less than 20% of the addressees of specific event did not reply until one week before the event, then the queries pertaining to the same event are resent to the addressees that have not yet replied.
[0086] Correspondingly, the act of analyzing of received replies may include the act of determining whether a predetermined minimum number replies for a specific event has been received at, e.g., terminal 110. Other acts of analyzing may be performed that may include, without limitations, automatically generating a seating order for the addressees that approved participation at the event, automatically ordering the required amount of meals, budget analysis, determining the number of waiters needed, and estimating the number of parking lots needed. Furthermore, if a query pertains to a query, system 100 may perform a projection for the poll results.
[0087] In some embodiments of the invention, system 100 enables performing of cost optimization. For example, the cheapest communication means may be used the first time for sending out queries for a specific event, whereas more expensive messages (e.g., voice messages), are sent only to those addressees who have not replied within a certain time span. [0088] A station and/or a terminal such as, for example, station 131, station 132, station 133, station 134 and terminal 110, may be embodied, without limitations, by a cellular telephone, by a wireless telephone, by a Personal Communication Systems (PCS) device, by a PDA device that incorporates a wireless communication device, by a tablet computer, by a server computer, by a personal computer, by a wireless communication station, by a mobile computer, by a notebook computer, by a desktop computer, by a laptop computer a Personal Digital Assistant (PDA) device, by a landline phone, a pager, by server (e.g., SMS server, MMS server, internet server) and the like.
[0089] A processor such as, for example, processor 111 may be embodied, without limitations, by a chip, by a microprocessor, by a controller, by a Central Processing Unit (CPU), by a Digital Signal Processor (DSP), by a microchip, by an Integrated Circuit (IC), or any other suitable multi-purpose or specific processor or controller.
[0090] A storage unit such as, for example, storage unit 120 may be embodied, without limitations, by a hard disk drive, by a floppy disk drive, by a Compact Disk (CD) drive, by a CD-ROM drive, by a digital versatile disc (DVD) drive, or other suitable removable or nonremovable storage units. Furthermore, storage unit 120 may be embodied, for example, by a Random Access Memory (RAM), by a Dynamic RAM (DRAM), by a Synchronous DRAM (SD-RAM), by a Flash memory, by a volatile memory, by a non-volatile memory, by a cache memory, by a buffer, by a short-term memory unit, by a long-term memory unit, or other suitable memory units or storage units.
[0091] A power supplys such as, for example, power supply 113 may be embodied, without limitations, by a rechargeable battery, by a non-rechargeable battery, or by any other suitable power supply.
[0092] It should be understood that some embodiments of the invention may be implemented, for example, using a machine-readable medium or article which may store an instruction or a set of instructions that, if executed by a machine, cause the machine to perform a method or operations or both in accordance with embodiments of the invention. Such a machine may include, for example, any suitable processing platform, computing platform, computing device, processing device, computing system, processing system, computer, processor, or the like, and may be implemented using any suitable combination of hardware or software or both. The machine-readable medium or article may include but is not limited to, any suitable type of memory unit, memory device, memory article, memory medium, storage article, storage device, storage medium or storage unit such as, for example, memory, removable or non-removable media, erasable or non-erasable media, writeable or re-writeable media, digital or analog media, optical disk, hard disk, floppy disk, Compact Disk Recordable (CD-R), Compact Disk Read Only Memory (CD-ROM), Compact Disk Rewriteable (CD- RW), magnetic media, various types of Digital Versatile Disks (DVDs), a rewritable DVD, a tape, a cassette, or the like. The instructions may include any suitable type of code, for example, an executable code, a compiled code, a dynamic code, a static code, interpreted code, a source code or the like, and may be implemented using any suitable high-level, low-level, object-oriented, visual, compiled or interpreted programming language. Such a compiled or interpreted programming language may be, for example, C, C++, C#, .Net, Java, Pascal, MATLAB, BASIC, Cobol, Fortran, assembly language, machine code and the like. [0093] It should be noted that embodiments of the invention may be used in a variety of applications. Examples of embodiments of the invention may include the usage of the invention in conjunction with many networks. Examples of such networks may include, without limitation, a wide area network (WAN), local area network (LAN), a global communication network, e.g., the Internet, a wireless communication network such as, for example, a wireless LAN (WLAN) communication network, a wireless virtual private network (VPN), a Bluetooth network, a cellular communication network, for example, a 3rd Generation Partnership Project (3GPP), such as, for example, a Global System for Mobile communications (GSM) network, a Code Division Multiple Access (CDMA) communication network, a Wideband CDMA communication network, a Frequency Domain Duplexing (FDD) network, and the like.
[0094] While the invention has been described with respect to a limited number of embodiments, these should not be construed as limitations on the scope of the invention, but rather as exemplifications of some of the embodiments. Those skilled in the art will envision other possible variations, modifications, and programs that are also within the scope of the invention. Accordingly, the scope of the invention should not be limited by what has thus far been described, but by the appended claims and their legal equivalents. Therefore, it should be understood that alternatives, modifications, and variations of the present invention are to be construed as being within the scope of the appended claims.

Claims

CLAIMSWhat is claimed is:
1. An automated querying distribution method conducted over a communication network, said method comprising the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending said plurality of queries from a terminal to said plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at said terminal at least one reply sent from at least one of said plurality of stations via at least one communication port in response to said plurality of queries; and associating said at least one reply with a respective query of said plurality of queries in accordance to said identifier of said communication port via which said respective said at least one reply were sent.
2. The method of claim 1 further comprising the acts of: associating a plurality of groups of addresses of stations to a respective plurality of groups of queries; determining whether at least two different queries of respective different groups of queries are associated to said same station; determining a reply status of at least one preceding query of said different queries identified to be associated to said same station; and selecting an appropriate communication port via which at least one subsequent query of said identified queries are to be sent, according to reply status of said at least one preceding query.
3. The method of claim 1 wherein said reply status comprises information of whether replies have been received in response to said at least one respective preceding query.
4. The method of claim 3, wherein in the event that no reply has been received in response to said at least one preceding query, said method further comprises the acts of: sending said at least one subsequent different query of said identified queries via a communication port having an identifier that is different from said identifier via which said at least one preceding query has been sent.
5. The method of claim 4 wherein said reply status includes information about whether a deadline has passed, until which a respective reply is defined as to be timely received.
6. The method of claim 5 wherein in the event that said deadline has passed, said at least one subsequent query is sent via said same communication port over which said at least one preceding query was sent.
7. The method of claim 1, further comprising the act of analyzing received queries.
8. The method of claim 7, wherein said act of analyzing includes at least one of the following acts: determining whether a predetermined minimum number replies for a specific event has been received; automatically generating a seating for addressees of corresponding station that approved participation in the event; automatically ordering the required amount of meals, performing budget analysis, determining the number of waiters needed, estimating the number of parking lots needed, and performing a projection for a poll result.
An automated querying distribution system, said system comprising: a database storing a plurality of queries associated to a respective plurality of addresses of respective stations; at least one communication port having a respective identifier; a terminal, wherein said terminal is adapted to send said plurality of queries from a terminal to said plurality of stations via said at least one communication port, and wherein said terminal is adapted to receive at least one reply sent from at least one of said plurality of stations via at least one communication port in response to said plurality of queries; and an application that enables associating said at least one reply with a respective query of said plurality of queries in accordance to said identifier of said communication port via which and said at least one reply were sent.
10. The automated querying distribution system of claim 9, comprising: a database of a plurality of groups of addresses of stations associated to a respective plurality of groups of queries; an identification module for identifying at least two different queries of respective different groups of queries, wherein said different queries are associated to said same station; a reply management module for determining reply status of at least one preceding query of said identified queries; and a switching module for selecting an appropriate communication port via which successive queries of said identified queries are to be sent, wherein identifiers of said communication ports are determined according to a reply status of said at least one preceding query.
11. The system of claim 8 wherein said reply status includes information about received replies in response to respective queries.
12. The system of claim 9, wherein in the event that no reply has been received in response to said at least one preceding query, said system at least one subsequent different query of said identified queries via a communication port having an identifier that is different from said identifier via which said at least one preceding query was sent.
13. The system of claim 12, wherein said reply status includes information about whether a deadline has passed, until which a respective reply is defined as to be timely received at said terminal.
14. The system of claim 13, wherein in the event that said deadline has passed, said at least one subsequent query is sent via the same communication port via which said at least one preceding query was sent.
15. A machine-readable medium storing at least one instruction that, if executed by a machine, causing the machine to perform an automated querying distribution method conducted over a communication network, said method comprising the following acts: associating a plurality of queries to a respective plurality of addresses of a respective plurality of stations; sending said plurality of queries from a terminal to said plurality of stations via at least one communication port, wherein each communication port has an identifier; receiving at said terminal at least one reply sent from at least one of said plurality of stations via at least one communication port in response to said plurality of queries; and associating said at least one reply with a respective query of said plurality of queries in accordance to said identifier of said communication port via which said respective said at least one reply were sent.
PCT/IL2007/000775 2006-06-26 2007-06-26 Automated querying distribution system and method WO2008001362A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US81633506P 2006-06-26 2006-06-26
US60/816,335 2006-06-26

Publications (2)

Publication Number Publication Date
WO2008001362A2 true WO2008001362A2 (en) 2008-01-03
WO2008001362A3 WO2008001362A3 (en) 2009-04-30

Family

ID=38846093

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IL2007/000775 WO2008001362A2 (en) 2006-06-26 2007-06-26 Automated querying distribution system and method

Country Status (1)

Country Link
WO (1) WO2008001362A2 (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6233584B1 (en) * 1997-09-09 2001-05-15 International Business Machines Corporation Technique for providing a universal query for multiple different databases

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6233584B1 (en) * 1997-09-09 2001-05-15 International Business Machines Corporation Technique for providing a universal query for multiple different databases

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
'Semantic Email presentation at WWW2004 conference, May 17-22, 2004', 17 May 2004 article MCDOWELL ET AL. *

Also Published As

Publication number Publication date
WO2008001362A3 (en) 2009-04-30

Similar Documents

Publication Publication Date Title
US20050261951A1 (en) Method and apparatus for processing marketing information
US8332760B2 (en) Dynamically mapping chat session invitation history
US10318116B2 (en) Dynamic presentations management
US20210105147A1 (en) Data analysis system and method for predicting meeting invitees
WO2017121286A1 (en) Method and device for prompting relationship and task during communication
US20090222522A1 (en) Method and system of organizing and suggesting activities based on availability information and activity requirements
US20080141142A1 (en) Unified view of aggregated calendar data
US20120209863A1 (en) Information processing apparatus
US20160019485A1 (en) Method and system for scheduling meetings
US7778858B1 (en) Linking unable to respond messages to entries in electronic calendar
US20050044081A1 (en) Apparatus and methods for managing data used by a mobile device
US20090083377A1 (en) Meeting coordinator
CN104820918A (en) Intelligent transaction processing method, method and system
CN111859134A (en) Calendar-based service information pushing method and device and computer storage medium
US7716671B2 (en) Method for coordinating a set of related tasks and events by reducing duplicated effort
AU2002258345B2 (en) An enterprise knowledge and information acquisition, management and communications system with intelligent user interfaces
EP3258391A1 (en) Means for determining past activities of a user and triggering an action accordingly
CN109598481B (en) Conference management authority processing method and device, computer equipment and storage medium
CN112184138A (en) RPA and AI combined power grid work order processing method and device and electronic equipment
WO2008001362A2 (en) Automated querying distribution system and method
KR20060114987A (en) System and method for making, managing and evaluating a meeting using the position information of a mobile terminal and computer readable medium processing the method
JPWO2012036039A1 (en) Mobile terminal device
CN113379388B (en) Method for remote physical examination reservation platform to switch subtask flows according to configuration parameters
WO2013101564A1 (en) Path composition for planning
CN112260965A (en) Message processing method, device, equipment and storage medium

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07766806

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase in:

Ref country code: DE

NENP Non-entry into the national phase in:

Ref country code: RU

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS FO RIGHTS PURSUANT TO RULE 112(1) EPC (EPOFORM 1205A DATED 08.05.2009)

122 Ep: pct application non-entry in european phase

Ref document number: 07766806

Country of ref document: EP

Kind code of ref document: A2