131 results about "Waiting list" patented technology

The present invention is related to a method and a system for automatically allocating a particle beam to one of a plurality of treatment rooms. Upon receiving a request from one of the beam users, the system checks whether the beam is available and may automatically allocate the beam to the requesting room. Otherwise, the request may be put on a waiting list of pending requests, in a position which depends on the priority level (and arrival lime) coupled to said request.

The systems and methods described herein may extend transactional memory implementations to support transaction communicators and/or transaction condition variables for which transaction isolation is relaxed, and through which concurrent transactions can communicate and be synchronized with each other. Transactional accesses to these objects may not be isolated unless called within communicator-isolating transactions. A waiter transaction may invoke a wait method of a transaction condition variable, be added to a wait list for the variable, and be suspended pending notification of a notification event from a notify method of the variable. A notifier transaction may invoke a notify method of the variable, which may remove the waiter from the wait list, schedule the waiter transaction for resumed execution, and notify the waiter of the notification event. A waiter transaction may commit only if the corresponding notifier transaction commits. If the waiter transaction aborts, the notification may be forwarded to another waiter.

Methods and systems for scheduling a communication between parties are presented. A system includes a wait-list module configured to determine and display information to a first party attempting to communicate with a second party. The system includes a wait-time prediction module configured to determine, based on the information determined by the wait-list module, an estimated wait time before the first party can be allowed to communicate with the second party. The system also includes a scheduling module configured to schedule a time when the first party can be allowed to communicate with the second party, wherein the scheduled time is determined by one of the first party and the second party based at least on the estimated wait time.

A system and method for adding a customer's name to a waiting list at a selected restaurant. A central waiting list database stores waiting list information for a plurality of participating restaurants. The waiting list information indicates waiting times associated with each participating restaurant and each waiting customer. Local waiting list databases located at each participating restaurant are connected to the central database through a data network such as the Internet. The central database and the local databases periodically exchange information regarding the waiting customers and their associated waiting times at each participating restaurant. A Website connected to the central database and the network enables an accessing customer to review restaurant information for the participating restaurants, select a restaurant, determine the waiting time at the selected restaurant, and add the customer's name to the waiting list for the selected restaurant.

A fully automated, voice controlled business appointment/reservation system is provided. The system has a natural language voice user interface that emulates a live office administrator for appointment/reservation bookkeeping. It includes an efficient availability searching mechanism which enables a telephone user to quickly search and reserve available time slot based on his preference. Other described novel features and implementation improvements include method and system for voice controlled appointment/reservation cancellation, method and system for voice controlled appointment/reservation waiting list, method and system for new user service sign-up and account creation, method and system enabling sequential selective dialing of a telephone user list by voice command, and method and system for scheduling data administration by voice commands.

A queuing system and method are provided for filling vacancies at seats at manual and electronic gaming tables in a card room by establishing electronic waiting lists. The queuing system comprises at least one player interface, a queue interface, and a server computer networked to the player interface and the queue interface. In use, new players are placed on one or more of the electronic waiting lists, while the seats are monitored for vacancies via the player interfaces. Upon detecting a vacant seat, the server computer automatically assigns the next new player on the corresponding waiting list to the vacant seat of the selected manual or electronic gaming table.

Allowing external computing systems to access a data conference with low risk of eavesdropping. An external computing system accesses a virtual lobby before joining the data conference. The virtual lobby is an object that may include a list of computing systems admitted to the lobby. An external computing system joins the lobby when it is included in a waiting list associated with the lobby. Being joined to the lobby does not allow full access to the live data exchanges in the data conference, but does facilitate functions that are less sensitive such as notifying a conference organizer that the joined party in the lobby would like to join the data conference. Upon receiving notice that an external computing system has joined the lobby, the conference organizer then provides further authorization for the external computing system to enter the data conference using any number of in-band or out-of-band mechanisms.

Tickets with RFID devices are issued to train passengers. Once the passengers board the train, the number and location of vacant seats is determined based on signals from the RFID devices detected by RFID readers configured within the passenger compartments of the train. Seating information is displayed on screens fitted in each compartment. This is done at or after the train reaches every major station, facilitating wait-listed passengers to occupy any vacant seats that become available.

A method for determining an ownership of for a multiple owner lock. The method includes determining potential owners of the lock by inspecting a core file of a computer system or memory of a live system to determine which threads have pointers to the lock. The method includes identifying a stack for the threads with a stack pointer pointing to the current active frame and dividing the stack into active and inactive portions. The stack information is examined for each potential owner of the lock for pointers to the lock. If the thread has a pointer to the lock in the inactive portion of the stack, the thread is removed from the set of potential owners. The method includes retrieving a waiting list for the lock, and any threads on the waiting list are removed from the set of potential owners.

The present invention provides a system and method for predicting the likelihood of materialization of pending wait-listed reservations for the purchase of perishable commodities. Details pertaining to perishable commodities for which reservations for purchase have been made in the past, are gathered and analyzed as are details pertaining to reservation requests stored in a wait list. Based upon the analysis, the likelihood that a particular pending reservation will actually be purchased or “materialize” if it is taken off the wait-list and actually reserved is determined and this information is utilized for yield management.

In the method for implementing the event transfer system of a real time operating system kernel, the task with the highest priority first obtains the event under the multi-tasking environment which requires real time characteristics. In the case of the multi-tasking environment in which the priority-based preemptive scheduling is adapted, if a plurality of tasks with respect to one event, call a kernel system function of receiving the event, the real time operating system kernel queues the tasks into the waiting-list of the event in the priority order. In this state, when the event is sent, the task having the highest priority in the waiting-list immediately obtains the event, is woken up and is resumed in its execution.

Appointments for a professional are captured and placed on an “electronic” waiting list (e.g., database of scheduled appointments) in an appointment system. When available, the professional (e.g., a physician) communicates with the appointment system and announces his availability. The appointment system begins contacting individuals (e.g., patients) on the waiting list (e.g., in an order specified by the professional), and then bridges the physician and patient for the appointment. The communications are preferably telephone calls, but may be telephone, electronic chats, e-mail, pages, etc. The appointment system includes a billing interface that charges the patient/patients insurance for the appointment. The Appointments themselves may be scheduled, for example, via a touch tone phone response system, a web interface, or other communication devices, etc.

Disclosed is a conflict management program that ensures that an application can be programmed without having to consider a conflict with another application. An application manager (25) is provided with an execution list (61) for registering a currently executed application and an execution wait list (62) for registering an application on standby. In the event of an application conflict, an application management block (64) references a conflict condition table that relates to the state of the currently executed application and to the state of the application on standby, which are registered in each list (61) and (62), and determines the states (running, terminated, waiting for execution, etc.) to which the applications should switch in accordance with the priorities of the current states of the applications. An application control block (65) respectively places the applications in the states determined by the application management block (64), thereby exercising application conflict management.

A method for more efficiently reclaiming space in a journal is disclosed. In one embodiment, such a method includes identifying a plurality of ranks in a storage system. The method creates a destage wait list for each rank, where the destage wait list identifies metadata tracks to destage from a cache to the corresponding rank. The method dispatches one or more threads for each destage wait list. The threads destage metadata tracks identified in the destage wait lists from the cache to the corresponding ranks. In certain embodiments, the method moves metadata tracks to the destage wait lists only if performing such will not cause occupied space in the journal to fall below a low watermark. Once metadata tracks are destaged from the cache, the method releases, from the journal, entries associated with the destaged metadata tracks. A corresponding system and computer program product are also disclosed.

A system and method for reporting and remotely monitoring restaurant performance information for a plurality of restaurants. The system enables customers to add their names to restaurant waiting lists through the Internet or by telephone. Waiting list information for the plurality of restaurants is stored in a central database together with other performance information such as current table status and table turn time. Restaurant management personnel can access the central database through an Internet Website, LAN, WAN, or intranet to remotely monitor performance information at the plurality of restaurants from a central management location.

The invention provides a registered method based on the remote wireless registering system of the wireless application protocol WAP, wherein the remote wireless registering system includes at least a client end with the WAP function, a WAP gateway, a WAP server and a hospital center data base. The method includes: (1) the client end transmits the request to the WAP gateway through the wireless network; (2) the wireless network selects the WAP server connected with the hospital center data base based on the request, and transmits the request to the WAP server; (3) the WAP server transmits the request of the client end to the hospital center data base, then the hospital center data base gives the registering information and transmits to the client end. According to the invention, the patients can use the wireless device at any moment in the range covered by the mobile wireless network to realize the remote call on waiting list on the Internet.

Distribution and redistribution methods and systems. A data-base stores rights allocation information, e.g., purchase or allocation records for tickets to an event. A system receives a request that may be satisfied, or partially satisfied, by reallocating rights from a first party to a second party in the database. A probability that the request will be satisfied is calculated and the party making the request receives an indication of the calculated probability. For example, some implementations include adding, responsive to receiving the request, an identifier for the second party to a queue and calculating the probability that the request will be satisfied based at least on a position of the identifier in the queue. In some implementations, a server receives a request from the second party to acquire tickets to an event, where the requested tickets must satisfy one or more conditions, e.g., location, number of seats, etc., and the server determines that the request cannot be satisfied. The server sends the requestor an invitation to join a wait-list queue and provides an indication of how likely the request is to be satisfied at a later time. In some implementations, the request is satisfied after the event begins, e.g., using tickets reclaimed from parties that do not use them. In some implementations, a rights holder determines to redistribute rights to a set of other people and invites the other people to join a queue to collect the redistributed rights. In some implementations, the system works directly with a database used for controlling admission to an event. Integration with event access control allows for real-time control and redistribution, as well as assurances of authenticity.

A method for providing mutual exclusion at a single data element level for use in embedded systems. Entries for tasks that are currently holding a resource are stored in a hold list. Entries for tasks that are not currently executing and are waiting to be freed are stored in a wait list. A single mutual exclusion semaphore flags any request to access a resource.

A method of table management utilizes a software program to manage the setup for a restaurant on any given date or occasion, prioritize seating, manage waiting lists, manage reservations, and assign seating order based on planning and layout factor information for the restaurant combined with real-time data received from the restaurant.

The invention provides a management method of mobile phone backlogs, comprising: step a, establishing a plurality of backlog lists of different importance degree based on backlog starting times, wherein, the established backlog lists comprises important backlog execution lists, important backlog waiting lists and unimportant backlog lists; step b, ordering the backlogs in each execution list according to micro-item priority method. The management method of mobile phone backlogs establishes a plurality of backlog lists of different importance degree by comprehensive consideration of durations, required resources and importance degrees of backlogs, the backlogs are ordered and sorted, and the proper remind is provided, therefore the user can very conveniently monitor and manage the backlogs.

A system and method for network virtualization and resource allocation, including storing one or more received network requests in a request table, and updating at least one of a flow table, a waiting list table, or a candidate group map based on the one or more received network requests. The updating includes monitoring a transmission progress of each of one or more flows in a network of interconnected computing devices and moving completed flows from the flow table to a success list, moving requests in the waiting list table which have reached an attempt threshold from the flow table to a fail list, and compiling any residual requests in the waiting list with new requests to generate a new request table. A deterministic request allocation and/or an optimizing request allocation is performed based on the new request table.