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.

The invention provides a dynamic scheduling method for customized buses and car pooling based on passenger appointments. Adding modifying and deleting orders are completed on a cell phone App, and an order service queue is established on a central platform for orders of all clients based on departure time. Based on the strategy of first come first serve, each order on the front of a queue is processed gradually. A possible path between starting points is calculated with shortest distance algorithm and constraint examination object functions by taking the position information of onboard GPS terminals and all order messages assigned to a customized bus before into consideration. The cost for each customized bus to complete the order is calculated, and the bus with the lowest cost is chosen to complete the order based on the greedy principle. The accessing passenger set of the customized bus is updated. The process is repeated to assign all passenger appointment to buses. Reliable technical support is provided for dynamic scheduling customized buses and car pooling based on passenger appointments.

A transaction switch and integrated circuit incorporating said for switching data through a shared memory between a plurality of data interfaces that support different data protocols, namely packetized interfaces like InfiniBand and addressed data interfaces like PCI. The transaction switch also switches transactions commanding data transfers between the disparate protocol data interfaces and between those of the data interfaces having like protocols. For example, the transaction switch enables a hybrid InfiniBand channel adapter / switch to perform both InfiniBand packet to local bus protocol data transfers through the shared memory as well as InfiniBand packet switching between the multiple InfiniBand interfaces. The transactions are tailored for each interface type to include information needed by the particular interface type to perform a data transfer. The shared buffer memory, dynamically allocated by the transaction switch on a first-come-first serve basis, results in more efficient use of precious buffering resources than in a statically allocated scheme.

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.

Aspects of the invention include a power conversion device control device, including multiple drive circuits having an alarm signal formation circuit that sets a pulse signal having as one cycle a period. The one cycle period includes a determination period, of which a different period is set for each of plural protection circuits that detect information for carrying out a protection operation of semiconductor elements configuring a power conversion device, and a constant period, in which a condition varies with respect to the determination period, takes a protection circuit for which it is first detected that a protection operation is necessary to be a first-come first-served protection circuit, and outputs the pulse signal corresponding to the first-come first-served protection circuit as an alarm signal, wherein the alarm signal formation circuit is such that a resetting condition of the alarm signal is a condition that a protection operation stopped condition.

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.

A telecommunications quality measurement system has dialers that initiate and receive telephonic test-calls through voice-oriented networks under the control and supervision of test-call-system servers. A test-call-system common server comprises a locking and queuing device that queues lock queries from test-call-system servers. Locks prevent concurrent test-calls to parties of terminating dialers. The test-call-system servers are granted permission to command initiation of test calls, one at the time in a first-come-first-serve manner to a specific party. The test-call-system common server and the terminating dialers are connected to a data-oriented network for facilitating data communication between them. Results from the test calls are sent from the terminating dialers to the appropriate test-call-system servers via the test-call-system common server.

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 embodiment of the invention discloses a method for providing call service by a call centre, comprising the steps of: receiving user calls from a user; in accordance with time sequence of the user calls from the user, determining the corresponding service sequence of the user in a call service queue; collecting the user information at the same time the user queues up for the service; in light of the corresponding service sequence of the user in the call service queue, offering the call service for the user in case of the user's turn for accepting the call service. The embodiment of the invention also discloses a call service system and a service. Via the embodiment of the invention, the call center is able to determine the sequence of the user in the call service queue in terms of the time sequence of the user after the user enters into the call centre, which is to say, the user who dials the phone at first queues up in the front of the queue, which is consistent with the principal of first-come first-served, therefore waiting time of the users can be shortened and degree of satisfaction of the users can be boosted.

The invention relates to a scheduling method of hardware accelerators in a C-RAN. The method comprises the following steps of 1) establishing a task queue work_queue in a virtual machine controller Dom0, and simultaneously, aiming at each hardware accelerator, establishing a task queue write_queue and a task queue read_queue; 2) after the virtual machine controller Dom0 receives a request of a virtual machine DomU, adding the request in the task queue work_queue according to a first-come-first-served policy; 3) successively taking out tasks in the task queue work_queue, selecting the hardware accelerator with a current minimum load, and putting the task which is taken out into the corresponding task queue to complete a scheduling design of the plurality of hardware accelerators so that a virtual machine shares the accelerators. A signal processing speed is increased, hardware accelerator loads are balanced and a system throughput is increased.

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.

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 provides a dynamic vehicle path optimization method based on a fuzzy rolling time domain control strategy. The method specifically comprises the following steps: Step 1, initializing fuzzy rolling time domain control; Step 2, acquiring customer information; Step 3, planning a path; Step 4, rolling a window; and Step 5, performing residual processing; the dynamic vehicle path optimization method has the beneficial effects that compared with rolling time domain control, first-in-first-out, nearest neighbor and other methods, the fuzzy rolling time domain control method provided bythe invention reduces the delivery distance and the total waiting time of customers on the aspect of processing the dynamic vehicle path problem, and is more reasonable and effective. According to themethod, the threshold of the time window of the traditional rolling time domain is blurred, the problem that a traditional rolling time domain cannot plan demand points near a time window as a wholeis solved, so that the neighborhood search capability of the traditional rolling time domain is improved, and the fuzzy rolling time domain control strategy is suitable for solving various dynamic problems such as dynamic vehicle path problems.

The invention provides a home smart energy management system architecture based on multi-cloud collaboration. The architecture provides a solution for data cooperative communication among household appliances, a home smart energy gateway, a household appliance manufacturer cloud platform and a cloud agent. According to the invention, the architecture of the household smart energy management systemis designed; Architecture design is carried out for file cooperation and an interaction mode during information interaction; the cross-cloud data transmission algorithm is optimized; Through the optimal flow-based cloud agent deployment mode, a cross-cloud data transmission optimization algorithm where multiple files are transmitted to one cloud and integrated cloud migration, an inter-agent dataflow scheduling algorithm based on first-come-first-served and shortest task priority principles and a file cooperative control mechanism based on a Hash collision processing mechanism, unified coordination control of intelligent household appliances under different scenes is realized, and a foundation is laid for intelligent scheduling control of household energy and formation of a cooperation control scheme.

Tasks make updates requested by calling tasks to a shared resource serially in a first come first served manner, atomically, but not necessarily synchronously, such that a current task holding an exclusive lock on the shared resource makes the updates on behalf of one or more calling tasks queued on the lock. Updates waiting in a queue on the lock to the shared resource may be made while the lock is held, and others deferred for post processing after the lock is released. Some update requests may also, at the calling application's option, be executed synchronously. Provision is made for nested asynchronous locking. Data structures (wait_elements) describing update requests may queued in a wait queue for update requests awaiting execution by a current task, other than the calling task, currently holding an exclusive lock on the shared resource. Other queues are provided for queuing data structures removed from the wait queue but not yet processed; data structures for requests to unlock or downgrade a lock; data structures for requests which have been processed and need to be returned to free storage; and data structures for requests that need to be awakened or that describe post processing routines that are to be run while the lock is not held.

A system and method provide a group purchase service in which a discount rate is applied differentially depending on the group purchase volume on first-come-first-served basis. In the group purchase service, a central server determines a discount policy such that each local server applies differential discount rates in group purchase rounds depending on group purchase volumes of an item in a purchase process performed by buyer devices. When each of the buyer devices accesses the local server in each service area and performs the purchase process for the item through the local server, the local server applies the differential discount rates to the rounds depending on the group purchase volumes of the item. When the sales deadline arrives or when all the items sold out, the central server applies a final discount rate according to a totalization of the group purchase volumes in all the service areas

The invention discloses a coverage hole repair method and system for failed nodes in Internet of Things (IOT). The method comprises the steps that a sink node conducts roll poling for remaining energy Erj of all sensor nodes in a network every T seconds; the sink node determines whether each sensor node is effective or not based on preset conditions; the sink node removes an ineffective sensor node based on determination results, and re-clusters the effective sensor nodes in the network according to the remaining energy Erj and the hill climbing algorithm based on topology potential; and the ineffective sensor node calculates the topology potential (img file shown in the description) between the ineffective sensor node and each redundant sensor node, and selecting the matched redundant sensor node to replace the ineffective sensor node according to the maximum topology potential, the principle of first come first served, or a combination of both. According to the invention, the topology potential is used for re-clustering the effective sensor nodes, the optimal redundant sensor node can be selected in accordance with the magnitude of the topology potential and the principle of first come first served, through a combination of the two above, the network is allowed to gain unified energy distribution and always maintain local redundancy coverage in high-density areas of communication, and the network lifetime is extended while the communication quality of the network is ensured.

A memory controller includes a plurality of request queues for storing requests transmitted from corresponding host devices among a plurality of host devices, and a token information generation unit for generating information related to the numbers of first and second tokens corresponding to the plurality of respective host devices. The memory controller also includes a request scheduler for selecting repeatedly and sequentially the plurality of request queues, and outputting requests stored in a selected request queue, by using the first and second tokens, wherein the request scheduler outputs one request per one first token and, when first tokens are all consumed, outputs one request per one second token. The scheduler may output requests according to a first-ready first-come first-served (FR-FCFS) rule when using a first token, and output requests according to a first-ready (FR) rule when using a second token. The number of first tokens and second tokens may depend on characteristics of the host devices. A bandwidth control unit may control the number of first and second tokens based on bandwidth. The scheduler may stop outputting requests of a currently selected request queue, and output requests of a request queue corresponding to a top-priority host device.

The invention discloses a defense system and method for an Internet-of-Things system to resist DDOS attack. The defense system includes two or more different server groups, wherein an Internet-of-Things system terminal is connected with the two or more different server groups via more than one wireless narrow band, the two or more different server groups work in parallel, and the two servers are connected with the same database. The Internet-of-Things system terminal in the defense system for an Internet-of-Things system to resist DDOS attack can be connected to two different server groups through one or two wireless narrow bands (two shown in the figure), two groups of connections (terminal-to-server) work in parallel, a first-come-first-served management mode is adopted for analysis andacquisition of data, the two server groups operate one database, and at the moment, even if one server group is attacked or down, the system still can work normally without being affected.

Aspects of the invention include a power conversion device control device, including multiple drive circuits having an alarm signal formation circuit that sets a pulse signal having as one cycle a period. The one cycle period includes a determination period, of which a different period is set for each of plural protection circuits that detect information for carrying out a protection operation of semiconductor elements configuring a power conversion device, and a constant period, in which a condition varies with respect to the determination period, takes a protection circuit for which it is first detected that a protection operation is necessary to be a first-come first-served protection circuit, and outputs the pulse signal corresponding to the first-come first-served protection circuit as an alarm signal, wherein the alarm signal formation circuit is such that a resetting condition of the alarm signal is a condition that a protection operation stopped condition.

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.

Embodiments of the invention provide a system model building method and apparatus. According to one embodiment, the system model building method comprises the steps of performing process division on at least one service node comprised in a service system to obtain an arrival process, a service process and a leaving process, wherein the arrival process is used for representing a process that a service object arrives at the service system from outside, the service process represents a process that the service object accepts a service in the service system, and the leaving process represents a process that the service object leaves from the service system; according to a first-come-first-served rule, building an arrival queuing model of the arrival process, a service queuing model of the service process and a leaving queuing model of the leaving process; and according to the arrival queuing model, the service queuing model and the leaving queuing model, building a system model of the service system.

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.

A method and apparatus for output information are disclosed. One embodiment of the method includes: acquiring at least one user's access log for recording a sent page request; sequencing the uniform resource locators in the page requests sent in the access log of each user in a first-come-first-served order to obtain a uniform resource locator sequence of the user; acquiring a set of target uniform resource locator sequences to be counted; matching the uniform resource locator sequence of each user with the target uniform resource locator sequence set to obtain the number of times that each target uniform resource locator sequence appears in the uniform resource locator sequence of each user; The number of occurrences of each target uniform resource locator sequence in the uniform resourcelocator sequence of each user is converted to a conversion rate between pages for output. This embodiment can reduce the complexity of analyzing the page conversion rate.

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.