88results about How to "Lower average wait time" patented technology

Techniques for hybrid behavioral pairing in a contact center system are disclosed. In one particular embodiment, the techniques may be realized as a method for hybrid behavioral pairing in a contact center system comprising: ordering an agent; ordering a plurality of contacts; applying, by at least one processor, a hybridization function to the ordering of the plurality of contacts to bias a first strategy for pairing toward a second strategy for pairing; comparing, by the at least one processor and based on the hybridization function, a first difference in ordering between the agent and a first contact in a first pair with a second difference in ordering between the agent and a second contact different from the first contact in a second pair; and selecting, by the at least one processor, the first pair or the second pair for connection based on the comparing.

The invention discloses an intelligent traffic light controlling system which comprises a monitoring camera, a traffic signal lamp and countdown lamp, a crossing traffic flow detection microprocessor, a traffic signal timing automatic adjustment and calculation microprocessor, a display driver module, a digital image processor, and an I/O interface. A controller automatically adjusts signal timing of traffic lights to enable utilization rate of green light in each direction of the crossing to increase or decrease along the same trend, compared with the traffic flow, thereby identifying flow state of the crossing in an effective and dynamic manner, adjusting signal timing automatically, and reducing traffic jam.

The invention discloses a method for dispatching shortest-job-first memory requests on the basis of fairness consideration, which is used for a memory controller to dispatch various threading access requests when a chip multicore processor (CMP) accesses share memory resources, takes fairness when multiple threads access the memory, reduces request average waiting time and maintains inherent parallelism of the threads. The method includes: counting waiting time of memory access requests, and setting the threshold value Tmax of the maximum waiting time through testing to guarantee fairness of the threads. According to shortest-job-first strategy, threads with fewer requests can access memory as soon as possible, so that the average waiting time of the threads is shortest. Uniform priority level of the threads in the memory is set among various banks, so that the requests of the same thread on different banks can receive services, and memory level parallelism (MLP) is realized. The method for dispatching shortest-job-first memory guarantees throughput rate of the memory system and the integral performance of the system is improved completely.

The invention discloses a scheduling method of a queuing processing system and a queuing machine for prediction of service processing time. The scheduling method comprises the following steps of: establishing a service processing time consumption database, calling service processing time consumption history for prediction of waiting time required for service handling, and optimizing a service processing queuing sequence and the distribution of a queue, thereby providing a reference for the waiting time for service handling of a client, achieving the purpose of reducing the average waiting time of the client and improving the service processing efficiency.

The invention discloses a control system and a control method for dynamic adjusting of traffic light time. The control system comprises a vehicle radio frequency module, a roadside radiofrequency receiving module, a roadside communication module and a traffic light control module. The control method comprises steps that: under a real traffic condition at a specific crossing, a wireless signal is transmitted by the vehicle radio frequency module in a broadcast mode according to driving intention of a vehicle; specific crossing information is increased after the wireless signal is received by the roadside radiofrequency receiving module, and is transmitted to the roadside communication module in a data frame mode; after the number of vehicles at the specific crossing in all directions is collected by the roadside communication module, vehicle flow information is transmitted to the traffic light control module; whether traffic light time duration needs dynamic adjustment is determined by the traffic light control module according to set control strategies, and thereby dynamic adjustment of the traffic light time is realized, and a traffic obstruction state under a abnormal traffic flow state is alleviated.

The invention discloses a multi-node rapid communication method suitable for a contention channel underwater acoustic network. Each transmission cycle in the method comprises a handshake phase, a transmission phase and an end phase; the method comprises the following concrete steps that SA1, when a channel is idle and at least one node needs to transmit data, a network enters the handshake phase; SA2, after the handshake phase is ended, the network enters the transmission phase; the moment at which the data can be transmitted to a corresponding destination node without conflict by the node is calculated by priority order through each node which needs to transmit information, and after timing is performed for the moment, the data is transmitted to the corresponding destination node; SA3, after data transmission of all the nodes is ended, the network enters the end phase. According to the multi-node rapid communication method disclosed by the invention, the data can be transmitted in batches without generating the conflict in the same transmission cycle by multiple nodes in the underwater acoustic network, so that the utilization efficiency of the channel can be effectively improved, and the average delay of the channel is reduced; the multi-node rapid communication method can be widely used for occasions with various contention protocol-based underwater acoustic communication networks, underwater acoustic sensing networks and the like.

The invention discloses a dynamic time window intersection scheduling method based on a digital twinborn scene and an edge cloud, and the method comprises the steps: building the digital twinborn scene of an intersection region, pre-defining a moving track and a potential conflict point of an automatic driving vehicle at an intersection, and carrying out the scheduling control of vehicles passing through the intersection based on a dynamic time window algorithm. The intersection passing rate is effectively improved, and the average waiting time of vehicles at the intersection is greatly shortened.

The invention discloses an energy saving method for a sleep mode of a mobile station. After sending a sleep request to a base station and getting a sleep response from the base station, the mobile station enters the sleep mode and the parameters of the base station which are returned to the mobile station include: an initial dormant window length Tmin, a largest dormant window cardinal number B and a largest dormant window index E, wherein a largest dormant window length Tmax is obtained according to the formula that Tmax=B * 2 <E> and a second dormant window length T2 is 2Tmin. When 2Tmin is lauger than Tmax, T2 is equal to Tmax; from a third dormant window, the dormant window length Tk=Tmin * Int [(k-1) <2>/2), wherein k stands for a kth dormant window; when Tk is larger than Tmax, Tk is equal to Tmax and when the mobile station is in the dormant window status, data receiving and sending are stopped. The mobile station works according to the growth mode of the dormant window length which is put forward by the invention. Therefore, both the power consumption and the response time are obviously reduced and the comprehensive performance is improved.

Provided is an elevator group management system which is improved in operation efficiency by considering a situation change which occurred at a riding place after the registration of a destination floor. An allocated cage reconsideration means (21) executes an allocated cage reconsideration during a reconsideration period for the unit of an reconsideration registration information set which is composed of at least one piece of tentatively-allocated cage registration information managed by a registered destination-floor riding-place call management unit (13). After the end of the allocated cage reconsideration, the allocated cage reconsideration means (21) corrects, on the basis of the contents of the corrected reconsideration registration information set, the contents of the tentatively-allocated cage registration information in the registered destination-floor riding-place call management unit (13). In other words, the allocated cage reconsideration means (21) performs the new registration of the tentatively-allocated cage registration information after the reconsideration and also the erasure of the tentatively-allocated cage registration information before the reconsideration.

The invention discloses a multi-node parallel communication method for a competitive channel underwater acoustic network containing a movement node. The method comprises the steps of: laying static nodes; after the movement node enters the communication range of the underwater acoustic communication network, determining the current position and velocity vector of the node relative to a coordinate system, and broadcasting other nodes in the underwater acoustic communication network when a channel is idle to add network signaling; when the node needs to send data, participating in channel competition in a new transmission cycle, calculating the time when the node can send data to a corresponding destination node without conflict, and sending data at the time; and when the movement node needs to exit the network, broadcasting the other nodes when the channel is idle to exit the network signaling, and receiving, by the other nodes, the signaling. The method can effectively improve the utilization efficiency of the channel and reduce the average delay of communication, and can be widely applied to various occasions containing movement nodes, such as underwater acoustic communication networks, underwater acoustic sensor networks and the like.

A traffic light intelligent control method based on road real-time capacity comprises the following steps of 1, calculating phase initial green light duration according to real-time traffic flow information, and optimizing the green light duration of each phase by using an algorithm, 2, judging whether the green light duration is reasonable or not, and performing fine adjustment to avoid traffic jam caused by overlong green light duration of a certain phase, 3, calculating the road flow processing capacity according to the real-time traffic flow information, and calculating the phase priorityin combination with the vehicle queuing length and the vehicle average waiting time, and 4, enabling the phase green light duration and the phase sequence to act on the traffic lights. The method hasthe characteristic of solving the problem of road congestion by reasonably utilizing the real-time capacity of the adjacent roads.

The invention discloses a publishing and subscription method. A publisher produces an advertisement message and forwards the advertisement message to the whole network; each proxy node produces a route table based on an advertisement theme; a subscriber produces a subscription message and routes the subscription message to the publisher of the relevant theme according to a route produced by the route table based on the advertisement theme; each node produces a route table based on a subscription content; the message published by the publisher is routed to the subscriber according to the route table based on the subscription content; furthermore, during routing, the message is cached into a certain proxy node on a deliver route and is marked as cached; the subscriber sends a historical message subscription which is routed to the publisher with the corresponding theme according to the route table based on the advertisement theme; historical messages meeting a subscription condition are searched along the deliver route; and the searched historical messages are turned to the subscriber along an opposite route. By the publishing and subscription method, the problem that a user cannot acquire the historical messages in a publishing/subscription system is solved; and the historical messages can be searched quickly and reliably.

The invention discloses a performance prediction method of concurrency working loads in a distributed database. A linear regression model is established and used for judging the interaction between queries in the distributed database and predicting query time delay L under different concurrency degrees in the distributed database, and the database selectively distributes tasks through the query time delay L. The method includes the main steps that A, metrics of the query time delay L are selected; B, the interaction under combined concurrency conditions is inquired about and the linear regression model is established; C, correctness and validity of the linear regression model are verified through experiments. It is proved through repeated experiments that the total average relative error of the query time delay is 14%, the total average relative error of network delay is 30% and the total average relative error of the number of I/O block reading times is 37%, it can be seen from experiment results that the linear regression model can well conduct performance prediction of concurrency work responsibility on the distributed database, and therefore subsequent task distribution of the database is facilitated, and the average waiting time of query can be shortened.

A method and system for calculating the completion time of a banking business in progress are characterized in that the system comprises a bank counter business server (101), a bank self-service machine business server (102), a bank online banking business server (103), a mobile banking business server (104), a banking business completion time calculating server (105), a customer historical data server (106) and a mobile banking (107) with a guiding robot; the method comprises the steps that the bank online banking business server (103) calculates the completion time of the banking business in progress, records the time of each process of the specific business and stores the recorded time in the customer historical data server (106); the historical consumed time data of the calculated banking business and the handling time data of the personal part and the process of the business in progress of a customer who handles the business are inquired through the customer historical data server (106), and the remaining completion time of the banking business is accurately figured out.

The invention discloses a convenient car reservation service platform based on an intelligent mobile phone. The convenient car reservation service platform comprises a passenger client and the like. The passenger client possesses intelligent mobile phone client software which is installed on a passenger user cellphone. The intelligent mobile phone client software automatically acquires passenger user position information and sends the current passenger user position to a center scheduling server. The center scheduling server determines the passenger user position, packs a car reservation request of the passenger user, the positional information of the passenger user and a contact number of the passenger user and sends to a corresponding taxi scheduling center client. After receiving the passenger user car reservation request, the taxi scheduling center client carries out integration with a taxi scheduling system through an interface control. The taxi scheduling center client returns scheduled car reception driver license plate number information to the center scheduling server. The center scheduling server returns the driver license plate number information to the passenger client. By using the platform of the invention, user call charges can be saved and processing efficiency of a taxi scheduling center can be improved.

The invention discloses an intelligent scheduling method of an online customer service system, which comprises the steps of constructing a multi-priority customer queue according to customer characteristics, and establishing a corresponding relationship between a scheduling strategy and a system state. The scheduling process comprises the steps of firstly, assigning customers in a time sequence queue of the customer service system to corresponding characteristic sub-queues in multiple queues according to the customer characteristics; extracting the head customer of each sub-queue, and selecting the scheduled customer according to the priority of the sub-queues and the waiting time of the customers; judging the state of the online customer service system, and selecting a proper scheduling strategy according to the system state; and finally, selecting a customer service agent to be allocated to the customer according to the selected scheduling strategy. According to the invention, the average waiting time of customers can be reduced, the reasonable distribution of customer service agents is realized, and the load balance among the customer service agents is realized, so that the service quality and the working efficiency of the online customer service system are improved, and the customer satisfaction is improved.

The invention relates to a cluster resource management and task scheduling method and system based on deep reinforcement learning. The method comprises the steps: placing tasks needing to be operatedin a to-be-scheduled task queue; sequentially processing the tasks in the to-be-scheduled task queue through a resource scheduling management intelligent agent, and generating a scheduling decision according to cluster resource conditions and resource requirements of the tasks, wherein the resource scheduling management intelligent agent is a neural network obtained by training by using a deep reinforcement learning method according to historical task records running on a cluster; and according to the scheduling decision, scheduling the task to a corresponding machine in the cluster for execution. According to the invention, the utilization rate of cluster resources and the throughput rate of the system can be improved, and computer cluster resource allocation can be self-adaptive when thetask load condition changes; according to the method, the task response time can be shorter, the number of cluster machines can be reduced under the condition of the same load, and the method and system have important significance in saving energy and protecting the environment.

The invention discloses a traditional Chinese medicine prescription automatic dispensing and medicine fetching method and a storage medium. The method comprises a prescription distribution step: obtaining a plurality of prescriptions, querying medicine warehouses according to a medicine list of each prescription to determine the storage positions of medicine, and distributing all prescriptions oneby one; a prescription dispensing step: acquiring medicine chest information required to be retrieved by a prescription required to be dispensed currently by an operating and dispensing table; sending the medicine chest information to a control device of the medicine warehouse to make a medicine chest grabbing mechanism of the medicine warehouse grab the corresponding medicine chests to a conveying belt and conveying the medicine chests to corresponding operating and dispensing tables; judging whether the medicine chests in the operating and dispensing tables finish medicine fetching; and ifyes, controlling discharging mechanisms of the operating and dispensing tables to convey the current medicine chests back to the conveying belt so as to convey the medicine chests back to the medicinewarehouses correspondingly. According to the method, the needed medicine can be automatically conveyed to the operating and dispensing tables to allow medicine fetching personnel to obtain, so that it is not needed to spend time in finding the medicine positions one by one, and the medicine fetching efficiency is improved.

The invention discloses a flexible automatic production line system of engine cylinder covers. The system comprises a rough turning outer circle module, a boring and burning inner hole module, a correcting and turning module, a finish boring inner hole module, a semi-finish processing module, a rough honing and grinding module, a finish turning water channel module and a spiral umbrella honing module, wherein the rough turning outer circle module, the correcting and turning module, the semi-finish processing module and the finish turning water channel module are positioned in the same row; the boring and burning inner hole module, the finish boring inner hole module, the rough honing and grinding module and the spiral umbrella honing module are positioned in the same row; a transfer area is arranged between the two rows of equipment; one joint walk robot is arranged beside each processing module; multiple part temporary storage areas are arranged in the transfer area; and conveying devices are arranged among the part temporary storage areas. The system can solve the defects in the prior art, and improves the conveying efficiency of processed parts in an automatic production line.