49 results about "First-come, first-served" patented technology

A software system is provided for managing available to promise (ATP) and making promises to fulfill customer requests. The software system includes a plurality of generic product models (600) each representing a generic product. Each generic product model (600) specifies one component of a plurality of possible components. A plurality of specific product models (602) each represent a specific product and each specify all components of the specific product. Each component specified by each specific product model (602) is specified by one of the generic product models (600) such that each specific product model (602) is related to a subset of the generic product models (600). A customer request matching a specific product then can be fulfilled by available-to-promise of the specific product or by available-to-promise of all related generic products. In addition, an organization in a seller hierarchy can retain product and designate first-come-first-served product. The organization also can define an ATP horizon to specify when forecasted product is actually available. Further, the organization can use an automatic allocation policy to allocate to members, and some forecast entries can be designated zero-ATP entries.

A cargo reservation system and method is provided wherein interested parties are united together in the form of a club to purchase cargo transportation units or rights in a cargo space. The level of membership is based on the amount of cargo transportation units an interested individual has purchased in the club. A member is given the opportunity to reserve their total amount of cargo transportation units on a first come first serve basis without individual club members having to negotiate or bid on the price of the freight services.

A system using two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message to which the package belongs. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to the First-Come-First-Serve scheduling.

The invention belongs to the technical field of computer networks, and particularly relates to a reward-offering transaction processing method and system based on the mobile internet. The unique reward-offering transaction processing method is adopted, a reward-offering party defines a demand and transaction conditions and transfers a transaction cost in the form of a reward into a system to be frozen while publishing transaction information, the system publishes reward-offering information to mobile terminals according to transaction delivery requirements, systems of all the mobile terminals judge whether the reward-offering transaction information is displayed or not according to position radius parameters, users battle for an order according to the first-come and first-served rule after seeing the reward-offering information, after one user gets the order successfully, the two transaction parties establish the cooperative relationship after communication, after the party who gets the order finishes the demand and the transaction conditions, the two parties confirm completion of the transaction online, and the system transfers the balance into a system account of the party who gets the order after charging a service fee in proportion. In an existing E-business mode, individual demands and real-time demands of reward-offering parties can be satisfied timely and effectively, so that the reward-offering transaction linking efficiency is further improved.

A system and method are provided that preserve many of the advantages of traditional workups, including the ability to create a single deal extended in time, while avoiding aspects of prior art workup protocols that can be disadvantageous in particular trading environments and, particularly, avoiding the trading delays sometimes created by providing certain traders with exclusive trading privileges in highly-liquid, fast-moving trading environments. In a preferred embodiment, the present system comprises a distributed computer processing system programmed to provide a structured trading protocol that enhances trading efficiency and fairly distributes market opportunity to system users. More specifically, in a preferred embodiment, the present system is adapted to provide a plurality of workup phases each of which is designated a “public” phase and during which all trading is conducted on a first-come-first-served basis.

The invention discloses a multi--core processor oriented on-chip lock variable global addressing storage method and a device. The method comprises the following steps: 1, a global addressing on-chip lock memory is established in advance; a lock variable is marked in the process of constructing an application, and the lock variable is allocated to an exclusive address space during compiling and linking; 2, in the process of loading the application, the page in which the lock variable is allocated is transferred to the global addressing on-chip lock memory through the DMA (direct memory access) mode; an access request is arbitrated and added to an access queue when the application accesses the lock variable, and the access request is executed according to the first-come-first-served strategy; the mapping of the lock variable is terminated when the application ends; and the device comprises a memory bank and an access controller, wherein the memory bank is arranged on a multi--core processor chip and used for storing the lock variable of the application, and the access controller is used for controlling the reading and modification towards the lock variable when the application runs. The multi--core processor oriented on-chip lock variable global addressing storage method and the device have the advantages that the concurrent access performance of the lock variable is high, the access delay of the lock variable is low, the concurrent access overhead of the lock variable is low, and the storage method and the device are simple and convenient in use.

The invention relates to the aviation field, in particular to an integrated strategy management decision support system for trailing interval restriction and departure slot allocation, which comprisesa model construction module adapted to construct a mixed integer programming model for cross-region trailing interval restriction and departure slot allocation. And a model solving module, which is suitable for solving the mixed integer programming model. Aiming at the constraint of flight departure flow control point in downstream area, the trailing interval restriction strategy of MIT controlled flight in upstream area flow control point and the computational departure slot restriction strategy of departure slot in and out of area are generated, based on the analysis of operation restriction and optimization objective in implementation management, the mixed integer programming model is established and solved by analyzing the implementation characteristics of computing departure slot andtrailing interval constraints. It is found that the integrated consideration of trailing interval constraints and departure slot allocation is more efficient than the traditional first-come-first-served management, which reduces the overall flight delay cost.

The invention discloses a method for accessing sqlite safely by multiple processes, which comprises the following steps: A, accessing of a database is divided into a read thread, a write thread and afile thread; B, the process in the step A queries the state of the database lock before accessing the database, if the database is locked, the thread preparing to access the database is in a waiting state, and after the lock is released, the thread preparing to access the database obtains the control right of the lock to operate on the database; C, the thread adopts the first-come-first-served principle to obtain the locks, after the operation of the thread to the database is completed, the locks are released, other thread obtains the lock state at this time and then operates on the database.The invention can improve the shortage of the prior art, creates an independent database access channel, solves the problem of concurrent access of the database, and avoids the situation that the database lock cannot be accessed.

A system and method is disclosed for facilitating the acquisition of medical images used as part of a clinical trials process by requiring Imaging Centers to compete with each other to supply the images. Agreements between the Sponsor and a plurality of Imaging Centers stipulate that the Sponsor is only required to accept a certain total number of medical images and is free to reject any medical images that either do not comply with the protocol, or which exceed the total number of medical images required for the study. This motivates the Imaging Centers to quickly obtain and transmit to the Sponsor high quality medical images that meet the basic requirements outlined in the clinical study protocol, since images are accepted and compensated for by the Sponsor on a first-come, first-served basis. A system for implementing this method is also disclosed.

The invention relates to the aviation field, in particular to a cross-region trailing interval restriction and departure time slot allocation comprehensive strategy calculation method, which calculates the cross-region trailing interval restriction and departure time slot allocation comprehensive strategy by constructing a cross-region trailing interval restriction and departure time slot allocation mixed integer programming model and solving the model. Aiming at the constraint of flight departure flow control point in downstream area, the trailing interval restriction strategy of MIT controlled flight in upstream area flow control point and the computational departure slot restriction strategy of departure slot in and out of area are generated, based on the analysis of operation restriction and optimization objective in implementation management, the mixed integer programming model is established and solved by analyzing the implementation characteristics of computing departure slot and trailing interval constraints. It is found that the integrated consideration of trailing interval constraints and departure slot allocation is more efficient than the traditional first-come-first-served management, which reduces the overall flight delay cost.

The invention discloses an intelligent man-machine cooperation scheduling method and system for bulk commodity transaction market supervision resource allocation. Intelligent real-time scheduling and distribution are carried out on human and machine resources according to task requirements so as to improve the task completion rate; when the task arrives, the task processing module performs solving of a part of key path set and allocation calculation of deadline according to a topological graph relation formed by different links of the task to obtain a task to-be-executed queue and a task pool; afterwards, intelligent real-time distribution of human and machine resources is carried out through a resource scheduling module, and an execution sequence and specific starting time of tasks are output; a scheduling distribution strategy is automatically adjusted according to execution information fed back by tasks in real time, so that as many tasks as possible are completed before deadline. The scheduling method gives consideration to the influence of task execution uncertainty, and has the advantages of being high in scheduling plan robustness and low in task delay risk compared with a previous mode of 'first coming and first serving' and single and fixed distribution.

The invention discloses a queuing-based network access method, which mainly solves the problem that users send a large number of access requests during dense access under high network load and the waste of broadband resources is caused in the prior art. The scheme comprises the following steps: when the number of users of a target network service reaches the access control requirements, deferring the access of subsequent user access requests in a queuing manner according to a first-come-first-served criterion, periodically updating the queuing information and sending the queuing information to equipment that requests to access the network, successively authorizing queuing users to access the network according to the current network operation, and avoiding the phenomenon that too many users repeatedly try to access the network when the network service is busy. The queuing-based network access method disclosed by the invention is based on the principle of fair access, and ensures that unnecessary invalid access attempts can be reduced and the network access efficiency can be increased; and the normal operation of the network can be guaranteed, and the user satisfaction can be improved.

The invention relates to a coin machine fare counting system and belongs to the technical field of automatic coin machines. The coin machine fare counting system comprises a cash counting terminal, afully automatic coin liner, a coin machine and a server. The cash counting terminal is connected to the server via a wireless network. The fully automatic coin liner and the coin machine achieve real-time information interaction with each other by using noncontact communication technology. The fully automatic coin liner and the cash counting terminal transfer information to each other by using a noncontact IC card. The cash counting terminal transmits information to the server through the network. The coin machine fare counting system can realize instant data communication between the fully automatic coin liner and the coin machine, effectively changes the complicated mode of manual recording, manual account keeping, and manual review in a cash counting link, realizes the universal use ofall fully automatic coin liner, automatically numbers the fully automatic coin liner according to the license plate number of a vehicle, solves the defect that the fully automatic coin liner is searched according to areas and replaced according to the number, achieves a convenient management mode of first come first served, and improves the turnover efficiency of the fully automatic coin liners.