Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A computer-implemented method for communicating with a customer device, the method comprising: periodically monitoring, by a server, locations of a plurality of electronic devices comprising at least the customer device by receiving a device identifier and location information from each electronic device, the location information being associated with location of each electronic device and determined from a plurality of location signals received, by each electronic device, from a plurality of beacons configured to periodically transmit the location signals within a predetermined location; verifying, by the server, the device identifier and the location information from the customer device as being associated with the customer device in a database configured to store a first plurality of records of a first plurality of preexisting queues and one or more records of a plurality of customer devices; upon the customer device being located within the predetermined location, retrieving, by the server, a second plurality of records associated with a second plurality of preexisting queues in the database, the second plurality of preexisting queues being selected from the first plurality of preexisting queues responsive to the predetermined location; generating, by the server, on the customer device a first graphical user interface configured to display a second plurality of preexisting queues; receiving, by the server, an input from the customer device requesting participation in a desired queue, the desired queue being selected from the second plurality of preexisting queues presented on the first graphical user interface; retrieving, by the server, a third plurality of records associated with one or more tokens in the database issued to one or more electronic devices corresponding to previous participants in the desired queue, wherein each of the one or more previous participants corresponds to a uniquely identified input requesting participation in the desired queue and received by the server before receiving the input from the customer device; and each of the one or more tokens is assigned sequentially to each of the one or more previous participants successively entering the desired queue; determining, by the server, an estimated processing time responsive to one or more tokens being processed in a predetermined period of time, wherein the server monitors a time duration corresponding to a time that each token entered the desired queue until each token was processed to calculate the estimated processing time; assigning, by the server, a next token to be associated with the customer device, the next token being associated with the input requesting participation in the desired queue from the customer device and being sequentially next to the token assigned to last of the one or more previous participants in the entry queue; and generating, by the server, a second graphical user interface on the customer device configured to provide the estimated processing time and information associated with the next token.
2. The computer-implemented method of claim 1 , wherein the plurality of preexisting queues comprises a queue in a physical location.
This invention relates to a computer-implemented method for managing data processing tasks, specifically addressing inefficiencies in task distribution across multiple preexisting queues. The method improves task allocation by dynamically routing tasks to the most suitable queue based on factors such as queue load, task priority, or geographic proximity. A key feature is the inclusion of a queue located in a physical location, which may be a data center, server farm, or other physical infrastructure. The method ensures tasks are directed to the optimal queue, reducing latency and improving resource utilization. The system may also monitor queue performance and adjust routing rules in real-time to maintain efficiency. This approach is particularly useful in distributed computing environments where tasks must be processed across geographically dispersed locations while minimizing delays and optimizing computational resources. The method enhances scalability and reliability in task processing systems by intelligently distributing workloads across available queues, including those tied to specific physical locations.
3. The computer-implemented method of claim 1 , wherein the plurality of preexisting queues comprises a virtual queue.
The invention relates to a computer-implemented system for managing task execution using multiple preexisting queues, where at least one of these queues is a virtual queue. The system organizes tasks into these queues to optimize processing efficiency, load balancing, or resource allocation in a computing environment. The virtual queue is a logical construct that simulates a physical queue but operates without dedicated hardware resources, allowing dynamic allocation and reallocation of tasks based on real-time system demands. This approach enables flexible task scheduling, where tasks can be dynamically reassigned between physical and virtual queues to improve throughput, reduce latency, or handle fluctuating workloads. The method leverages the virtual queue to absorb temporary spikes in task volume, preventing bottlenecks in the primary processing system. By integrating a virtual queue into the existing queue management framework, the system enhances scalability and adaptability without requiring additional physical infrastructure. The core innovation lies in the seamless interaction between physical and virtual queues, ensuring continuous operation even under variable workload conditions. This solution addresses inefficiencies in traditional queue-based systems by introducing a software-defined queue that dynamically adjusts to system conditions, thereby improving overall performance and resource utilization.
4. The computer-implemented method of claim 1 , wherein each of the one or more previous participants corresponds to a uniquely identified input obtained via a mobile application on a mobile device.
This invention relates to a computer-implemented method for tracking and verifying participant interactions in a system, particularly where participants are identified via mobile applications. The method addresses the challenge of accurately associating participant inputs with unique identifiers to ensure data integrity and traceability in digital interactions. The method involves processing input data from one or more participants, where each participant is linked to a uniquely identified input obtained through a mobile application on a mobile device. The system ensures that each input is distinctly attributed to a specific participant, preventing misattribution or duplication. This is achieved by leveraging mobile device identifiers, such as device IDs or user accounts, to create a verifiable record of each interaction. The method may also include steps to validate the authenticity of the input, such as checking timestamps, geolocation data, or cryptographic signatures, to further enhance reliability. By associating each participant with a unique identifier from their mobile application, the system enables accurate tracking of contributions, participation history, or transaction records. This is particularly useful in applications like voting systems, collaborative platforms, or secure authentication processes where traceability and non-repudiation are critical. The method ensures that all inputs are properly logged and linked to their respective sources, reducing the risk of fraud or errors in data collection. The system may also include additional features, such as real-time validation or automated alerts for suspicious activity, to maintain the integrity of the participant data.
5. The computer-implemented method of claim 1 , wherein at least one of previous participants corresponds to a uniquely identified input obtained using an infra-red detector.
This invention relates to a computer-implemented method for tracking and identifying participants in a system, particularly in scenarios where participant identification is required for access control, authentication, or interaction monitoring. The method addresses the challenge of accurately identifying individuals in environments where traditional identification methods (e.g., manual input or visible markers) may be impractical or insecure. The method involves capturing input data from participants using an infra-red detector, which generates a uniquely identifiable signal for each participant. This signal is processed to extract unique identifiers, allowing the system to distinguish between different participants. The identifiers are then associated with specific actions, interactions, or access permissions within the system. The use of infra-red detection enables passive, non-intrusive identification, reducing the need for active participation from the user (e.g., scanning a badge or entering credentials). The method may also involve comparing the uniquely identified inputs against a database of authorized participants to verify access rights or track participation history. This ensures secure and automated identification without requiring visible markers or manual intervention. The system can be applied in various contexts, such as secure access control, attendance tracking, or interactive environments where participant differentiation is necessary. The infra-red detection method enhances reliability and security by minimizing the risk of spoofing or unauthorized access.
6. The computer-implemented method of claim 1 , wherein the information associated with the next token comprises a number indicating a place in the desired queue.
The invention relates to computer-implemented methods for managing token-based systems, particularly in environments where tokens are used to control access to resources or services. The problem addressed is the need to efficiently organize and prioritize tokens within a queue, ensuring that each token is processed in the correct order while maintaining system performance and fairness. The method involves assigning a numerical value to each token, where the number represents the token's position in a desired queue. This numerical value allows the system to determine the token's priority and sequence within the queue, ensuring that tokens are processed in the correct order. The method may also include generating tokens, validating them, and managing their lifecycle within the system. The numerical value associated with each token can be used to enforce ordering rules, prevent token misuse, and optimize resource allocation. The system may further include mechanisms to update or adjust the numerical value based on changing conditions, such as system load or priority changes. This approach ensures that tokens are processed efficiently while maintaining fairness and system stability.
7. The computer-implemented method of claim 1 , wherein the information associated with the next token comprises a haptic alert indicating user of the customer device to physically join the desired queue.
This invention relates to a computer-implemented method for managing customer queues, particularly in environments like retail stores or service centers where physical queues are common. The problem addressed is the inefficiency and confusion in traditional queue systems, where customers may not know when to physically join a line or may miss important updates about queue status. The method involves a system that monitors queue conditions and provides real-time information to customers via their devices. When a customer is assigned to a queue, the system determines the optimal time for them to physically join based on factors like current queue length, service speed, and customer proximity. The system then sends a notification to the customer's device, which includes a haptic alert—a physical vibration or pulse—to signal when they should move to the queue. This alert ensures the customer receives the notification even if their device is in a pocket or purse, preventing missed updates. The system may also provide additional context, such as the estimated wait time or the exact location of the queue, to further streamline the process. By using haptic feedback, the method improves user engagement and reduces the likelihood of customers missing critical queue updates, leading to a more organized and efficient queue management system. The invention is particularly useful in high-traffic environments where clear, timely communication is essential.
8. The computer-implemented method of claim 1 , wherein the data record associated with the one or more tokens in the database issued to one or more previous participants in the desired queue are modified as expired once the previous participants have been processed.
This invention relates to a computer-implemented method for managing data records in a queue-based system, particularly for tracking and processing participants in a queue. The method addresses the problem of efficiently managing and updating data records associated with participants who have been processed, ensuring that outdated or expired records do not interfere with subsequent operations. The method involves modifying data records in a database that are linked to one or more tokens issued to previous participants in a queue. Once these participants have been processed, the associated data records are updated to reflect their expired status. This ensures that the system accurately reflects the current state of the queue, preventing stale data from affecting future operations. The method may also include steps for generating tokens, assigning them to participants, and tracking their progress through the queue. By marking processed participants' records as expired, the system maintains data integrity and improves efficiency in queue management. This approach is particularly useful in systems where queue processing involves multiple stages or where historical data must be distinguished from active records.
9. The computer-implemented method of claim 8 , wherein the expiration of the one or more tokens in the database issued to one or more previous participants is in response to receiving, by the server, from an electronic device associated with a service station associated with the desired queue, an indication that the participants have been processed.
This invention relates to a computer-implemented method for managing participant queues in a service station environment, such as a drive-thru or checkout system. The method addresses the problem of efficiently tracking and processing participants in a queue, ensuring that tokens issued to participants expire once they have been served, preventing unauthorized reuse or system errors. The method involves a server that issues tokens to participants in a queue, where each token represents a participant's position in the queue. The server monitors the status of these tokens and expires them once the associated participants have been processed. This expiration is triggered by receiving an indication from an electronic device at the service station that the participants have been served. The system ensures that only valid, unexpired tokens are processed, maintaining accurate queue management and preventing system inconsistencies. The method may also include additional steps such as receiving a request from a participant's device to join the queue, generating a unique token for the participant, and transmitting the token to the participant's device. The server tracks the status of each token and updates the queue accordingly. The expiration mechanism ensures that once a participant is processed, their token is invalidated, preventing further use. This approach improves efficiency and reliability in queue management systems.
10. The computer-implemented method of claim 1 , wherein the second graphical user interface on the customer device is configured to display a message to be transmitted to a queue management server.
This invention relates to a computer-implemented method for managing customer interactions in a queue-based system, particularly in environments like call centers or service desks. The problem addressed is the need for efficient communication between customers and service providers, ensuring messages are properly routed and managed in a structured manner. The method involves a system where a customer device interacts with a queue management server. The customer device displays a graphical user interface (GUI) that allows the customer to input a message. This message is then transmitted to the queue management server, which processes and manages the message within a queue system. The queue management server ensures that messages are prioritized, routed, and delivered to the appropriate service provider or system component for resolution. The GUI on the customer device is specifically configured to facilitate this message transmission, ensuring that the message is formatted correctly and includes necessary metadata for proper queue management. The system may also include additional interfaces or components that handle authentication, message validation, or status updates to enhance the overall efficiency of the queue-based interaction. This approach improves customer service by reducing delays, ensuring messages are properly organized, and providing a structured way for customers to communicate with service providers. The method is particularly useful in high-volume environments where manual handling of messages would be inefficient.
11. A computer system comprising: a server configured to: periodically monitor location of a plurality of electronic devices comprising at least a customer device by receiving a device identifier and location information from each electronic device, the location information being associated with location of each electronic device and determined from a plurality of location signals received, by each electronic device, from a plurality of beacons configured to periodically transmit the location signals within a predetermined location; verify the device identifier and the location information from the customer device as being associated with the customer device in a database configured to store a first plurality of records of a first plurality of preexisting queues and one or more records of a plurality of customer devices; upon the customer device being located within the predetermined location, retrieve a second plurality of records associated with a second plurality of preexisting queues in the database, the second plurality of preexisting queues being selected from the first plurality of preexisting queues responsive to the predetermined location; generate on the customer device a first graphical user interface configured to display a second plurality of preexisting queues; receive an input from the customer device requesting participation in a desired queue, the desired queue being selected from the second plurality of preexisting queues presented on the first graphical user interface; retrieve a third plurality of records associated with one or more tokens in the database issued to one or more electronic devices corresponding to previous participants in the desired queue, wherein each of the one or more previous participants corresponds to a uniquely identified input requesting participation in the desired queue and received by the server before receiving the input from the customer device; and each of the one or more tokens is assigned sequentially to each of the one or more previous participants successively entering the desired queue; determine an estimated processing time responsive to the one or more tokens being processed in a predetermined period of time, wherein the server monitors a time duration corresponding to a time that each token entered the desired queue until each token was processed to calculate the estimated processing time; assign a next token to be associated with the customer device, the next token being associated with the input requesting participation in the desired queue from the customer device and being sequentially next to the token assigned to last of the one or more previous participants in the entry queue; and generate a second graphical user interface on the customer device configured to provide the estimated processing time and information associated with the next token.
This invention relates to a computer system for managing virtual queues in physical locations, such as retail stores or service centers. The system addresses the problem of inefficient customer wait times by automating queue management through electronic devices and beacons. The system includes a server that periodically monitors the location of multiple electronic devices, including customer devices, by receiving device identifiers and location data from each device. The location data is determined from signals received from beacons placed within a predetermined area. When a customer device is detected within the designated location, the server retrieves relevant preexisting queues from a database based on the customer's location. A graphical user interface on the customer device displays these queues, allowing the customer to select a desired queue. The server then retrieves records of previously issued tokens for that queue, which are assigned sequentially to participants. The system calculates an estimated processing time by monitoring how long each token remains in the queue before being processed. The customer is assigned the next available token in sequence, and a second graphical user interface provides the estimated wait time and token information. This system improves queue management by providing real-time updates and reducing physical wait times.
12. The computer system of claim 11 , wherein the plurality of preexisting queues comprises a queue in a physical location.
A computer system is designed to manage and optimize the distribution of tasks or data across multiple preexisting queues, including at least one queue located in a physical location. The system dynamically assigns tasks to these queues based on factors such as queue capacity, processing speed, and geographic proximity to minimize latency and improve efficiency. The queues may be distributed across different locations, including physical sites, cloud-based environments, or hybrid systems. The system monitors queue performance in real-time, reallocating tasks as needed to balance workloads and prevent bottlenecks. This approach ensures that tasks are processed in the most efficient manner, reducing delays and improving overall system responsiveness. The inclusion of a physically located queue allows for localized processing, which can be critical for applications requiring low-latency responses or compliance with data residency regulations. The system may also prioritize tasks based on urgency, ensuring that high-priority items are routed to the most suitable queue. By integrating both physical and virtual queues, the system provides flexibility and scalability, adapting to varying workload demands while maintaining optimal performance.
13. The computer system of claim 11 , wherein the plurality of preexisting queues comprises a virtual queue.
A computer system is designed to manage data processing tasks by utilizing a plurality of preexisting queues, including at least one virtual queue. The system is configured to dynamically allocate tasks to these queues based on factors such as task priority, resource availability, or workload distribution. The virtual queue operates as a logical construct rather than a physical storage, allowing for flexible task management without requiring dedicated hardware resources. This approach enhances scalability and efficiency by enabling the system to adapt to varying workloads and resource constraints. The use of virtual queues reduces overhead associated with physical queue management while maintaining task organization and processing order. The system may also include mechanisms to monitor queue status, adjust allocations in real-time, and ensure tasks are processed according to predefined rules or policies. This design is particularly useful in environments where task prioritization and resource optimization are critical, such as cloud computing, distributed systems, or high-performance computing applications. The virtual queue feature allows the system to handle dynamic workloads more effectively by abstracting the underlying queue management, thereby improving overall system performance and responsiveness.
14. The computer system of claim 11 , wherein each of the one or more previous participants corresponds to a uniquely identified input obtained via a mobile application on a mobile device.
A computer system is designed to manage and analyze participant interactions in a collaborative environment, particularly where participants contribute input via mobile devices. The system tracks and processes input from multiple participants, each uniquely identified through a mobile application running on their respective mobile devices. This ensures that each participant's contributions can be distinctly attributed and managed within the system. The system may also include mechanisms to verify the identity of participants, ensuring secure and authenticated interactions. Additionally, the system can analyze the collected input to derive insights, such as trends, patterns, or collective decisions, based on the aggregated data from all participants. The mobile application facilitates seamless interaction, allowing participants to submit input, receive feedback, or engage in collaborative tasks remotely. The system's ability to uniquely identify each participant via their mobile device enhances accountability and traceability, making it suitable for applications in voting, surveys, or collaborative decision-making processes. The overall goal is to provide a robust, secure, and scalable platform for managing participant interactions in a mobile-centric environment.
15. The computer system of claim 11 , wherein at least one of previous participants corresponds to a uniquely identified input obtained using an infra-red detector.
A computer system is designed to track and analyze participant interactions in a physical space, such as a retail environment or event venue. The system addresses challenges in accurately identifying and monitoring individuals over time, particularly in dynamic settings where traditional methods like RFID or facial recognition may be unreliable or privacy-invasive. The system uses an infra-red detector to capture unique input data from participants, such as hand or body movements, which are then processed to generate a uniquely identified input. This input is linked to a specific participant, allowing the system to distinguish between different individuals and track their behavior, preferences, or interactions with objects or other participants. The system may also correlate this data with other sensors or identifiers to enhance accuracy. By leveraging infra-red detection, the system provides a non-intrusive, privacy-conscious method of participant tracking, improving data collection for analytics, security, or personalized experiences. The technology is particularly useful in environments where traditional tracking methods are impractical or where minimizing personal data collection is a priority.
16. The computer system of claim 11 , wherein the information associated with the next token comprises a number indicating a place in the desired queue.
The invention relates to a computer system designed to manage token-based processing in a queue, addressing the challenge of efficiently determining the next token's position in the desired queue. The system processes tokens sequentially, where each token represents a task or item to be handled in a specific order. A key aspect of the system is its ability to associate each token with metadata that includes a numerical value indicating its placement within the queue. This numerical indicator helps the system prioritize or sequence tokens accurately, ensuring tasks are executed in the correct order or according to predefined rules. By embedding this positional information directly with the token, the system avoids additional computational overhead for recalculating or tracking queue positions separately. This approach enhances processing efficiency, particularly in systems where token order is critical, such as task scheduling, resource allocation, or data stream management. The numerical indicator may be dynamically updated as tokens are processed or reordered, maintaining synchronization between the token's state and its position in the queue. The system could be implemented in software, firmware, or hardware, leveraging memory structures or data fields to store the positional metadata alongside each token.
17. The computer system of claim 11 , wherein the information associated with the next token comprises a haptic alert indicating user of the customer device to physically join the desired queue.
This invention relates to a computer system for managing customer queues in a physical environment, such as a retail store or service center. The system addresses the problem of inefficient queue management, where customers may not be properly directed to the correct queue, leading to delays and confusion. The system uses a customer device, such as a smartphone, to provide real-time guidance to users about which queue to join. The system determines the optimal queue for a customer based on factors like wait times, service availability, and customer preferences. When the system identifies the desired queue, it sends information to the customer device to guide the user to that queue. This information includes a haptic alert, which provides a physical vibration or tactile feedback to the user, prompting them to physically move to the desired queue. The system may also provide additional guidance, such as visual or auditory cues, to ensure the user reaches the correct location. By using haptic alerts, the system ensures that the user receives a clear, non-intrusive notification even in noisy or visually cluttered environments. The system improves queue efficiency by reducing confusion and ensuring customers are directed to the most appropriate queue based on real-time conditions.
18. The computer system of claim 11 , wherein the data record associated with the one or more tokens in the database issued to one or more previous participants in the desired queue are modified as expired once the previous participants have been processed.
This invention relates to a computer system for managing participant queues, particularly in scenarios where tokens are issued to participants to control access or processing. The system addresses the challenge of efficiently tracking and updating the status of tokens assigned to participants in a queue, ensuring that expired tokens do not interfere with subsequent operations. The system includes a database that stores data records associated with tokens issued to participants. When a participant is processed, the corresponding token data record is modified to indicate expiration, preventing reuse or misprocessing. This ensures that only valid, unexpired tokens are considered for further operations. The system may also include mechanisms to generate, distribute, and validate tokens, as well as to manage queue priorities or participant eligibility. The expiration update process may be triggered automatically upon processing completion or manually by an administrator. This approach improves queue management accuracy and prevents errors caused by stale or outdated token data.
19. The computer system of claim 18 , wherein the expiration of the one or more tokens in the database issued to one or more previous participants is in response to receiving, by the server, from an electronic device associated with a service station associated with the desired queue, an indication that the participants have been processed.
This invention relates to a computer system for managing participant queues, particularly in service stations. The system addresses the problem of efficiently tracking and processing participants in a queue, ensuring that tokens issued to participants expire once they have been served, preventing misuse or overuse of the queue system. The system includes a server that issues tokens to participants for accessing a desired queue. These tokens are stored in a database and are associated with specific participants. The server monitors the status of these tokens and expires them when the participants have been processed. The expiration process is triggered by receiving an indication from an electronic device associated with the service station that the participants have been served. This ensures that tokens are only valid for their intended use and are automatically invalidated once the service is completed, improving queue management efficiency and security. The system may also include additional features such as generating a queue identifier for the desired queue, receiving participant information from electronic devices, and validating the tokens before processing. The server can also track the status of participants in the queue, ensuring that only valid tokens are processed and that the queue operates smoothly. This invention enhances the reliability and accuracy of queue management systems in service stations.
20. The computer system of claim 11 , wherein the second graphical user interface on the customer device is configured to display a message to be transmitted to a queue management server.
The invention relates to a computer system designed to facilitate communication between a customer device and a queue management server. The system includes a second graphical user interface (GUI) on the customer device that is specifically configured to display a message intended for transmission to the queue management server. This message is likely part of a process where the customer device interacts with the server to manage or update queue statuses, such as for service appointments, ticketing systems, or other queuing scenarios. The GUI serves as an intermediary interface, allowing the customer to view and confirm the message content before it is sent to the server. The system ensures that the message is properly formatted and ready for transmission, potentially including details like queue position, estimated wait times, or service updates. The overall purpose is to streamline communication between the customer and the server, improving efficiency in queue management operations.
Unknown
April 28, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.