CN114827261A - Table arranging method, device, equipment and storage medium for cross-border matching activities - Google Patents
Table arranging method, device, equipment and storage medium for cross-border matching activities Download PDFInfo
- Publication number
- CN114827261A CN114827261A CN202210460340.7A CN202210460340A CN114827261A CN 114827261 A CN114827261 A CN 114827261A CN 202210460340 A CN202210460340 A CN 202210460340A CN 114827261 A CN114827261 A CN 114827261A
- Authority
- CN
- China
- Prior art keywords
- users
- pair
- arrangement
- user
- table arrangement
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000000694 effects Effects 0.000 title claims abstract description 49
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000015654 memory Effects 0.000 claims description 29
- 238000004590 computer program Methods 0.000 claims description 23
- 238000010586 diagram Methods 0.000 description 16
- 230000006870 function Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000003993 interaction Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000003032 molecular docking Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000011179 visual inspection Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms
- H04L12/1818—Conference organisation arrangements, e.g. handling schedules, setting up parameters needed by nodes to attend a conference, booking network resources, notifying involved parties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms
- H04L12/1822—Conducting the conference, e.g. admission, detection, selection or grouping of participants, correlating users to one or more conference sessions, prioritising transmission
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/141—Setup of application sessions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The specification relates to the technical field of cross-border matching systems, and provides a table arranging method, a table arranging device, table arranging equipment and a storage medium for cross-border matching activities, wherein the method comprises the following steps of: generating a table arrangement pairing information table according to the user set participating in table arrangement; selecting a pair from the table arrangement pairing information table, and determining whether two users in the pair meet a table arrangement condition; when the two users meet the table arrangement condition, carrying out table arrangement processing on the pair according to the table position attributes of the two users to obtain a table arrangement result; updating a table arrangement pairing information table according to the table arrangement result; and displaying the table arrangement result. The embodiment of the specification can improve the diversity of the row tables for matching activities.
Description
Technical Field
The present disclosure relates to the field of cross-border matching system technologies, and in particular, to a method, an apparatus, a device, and a storage medium for arranging tables for cross-border matching activities.
Background
A cross-border matching System (GMS) is an online platform aiming at establishing interconnection and intercommunication for small and medium-sized enterprises in the world. The cross-border matching system can provide the user with the publishing function of the contents such as supply and demand information, activity information (namely cross-border matching activity information), special area information (namely cross-border matching activity special area information) and the like, and can provide services such as real-time cross-border negotiation docking and the like for supply and demand parties.
In the cross-border matching system, the table arrangement is that the system pairs every two users (namely middle and small enterprises) for cross-border matching activities and allocates a table position for online negotiation, and the process is the cross-border matching activity. At present, a cross-border matching system generally arranges tables for a host party/guest parties, namely pairwise pairing is carried out between the host party (namely, in-country medium and small enterprises) and the guest party (namely, overseas medium and small enterprises), and a table position for online negotiation is distributed. However, the table arrangement method is difficult to meet the requirement of diversified matching activities.
Disclosure of Invention
An object of the embodiments of the present specification is to provide a method, an apparatus, a device and a storage medium for arranging tables for cross-border matching activities, so as to implement diversification of the arranged tables for matching activities.
To achieve the above object, in one aspect, the present specification provides a method for arranging tables for cross-border matching activities, including:
generating a table arrangement pairing information table according to the user set participating in table arrangement;
selecting a pair from the table arrangement pairing information table, and determining whether two users in the pair meet a table arrangement condition;
when the two users meet the table arrangement condition, carrying out table arrangement processing on the pair according to the table position attributes of the two users to obtain a table arrangement result;
updating a table arrangement pairing information table according to the table arrangement result;
and displaying the table arrangement result.
In the table arrangement method for cross-border matching activities in the embodiments of the present description, each record in the table arrangement pairing information table corresponds to one pair; each pair contains the following information for both users:
user identification, user type, industry affiliated, negotiation turns, number of times that a table has been put on in a single negotiation turn, total number of times that a table has been put on, table attribution identification, and a table empty and full flag.
In the table arrangement method for cross-border matching activities of the embodiments of the present specification, the table arrangement conditions include:
the number of times that each user has been put on the table in the negotiation turn does not reach a first upper limit value;
the total number of times that each user has been put on the table in all negotiation turns does not reach a second upper limit value; and (c) a second step of,
at least one user is a specified type of user.
In the table ranking method for cross-border matching activities according to the embodiment of the present specification, the performing table ranking processing on the pair according to the table position attributes of the two users includes:
and when the two users both occupy the table positions and both the table positions are in the vacant state, selecting the table position with the smaller number of times of putting on the table to place the pair.
In the table arrangement method for cross-border matching activities in the embodiment of the present specification, the performing table arrangement processing on the pair according to the table position attributes of the two users further includes:
and when the two users both occupy the desk positions and one desk position is in the vacancy state, placing the pair to the desk position corresponding to the vacancy state.
In the table arrangement method for cross-border matching activities in the embodiment of the present specification, the performing table arrangement processing on the pair according to the table position attributes of the two users further includes:
when the two users both occupy the table positions and the table positions of the two users are in a full state, judging whether the table positions which are not occupied exist;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
In the table ranking method for cross-border matching activities according to the embodiment of the present specification, the performing table ranking processing on the pair according to the table position attributes of the two users includes:
and when one of the two users occupies the desk and the desk is in an empty state, placing the pair to the desk.
In the table ranking method for cross-border matching activities according to the embodiment of the present specification, the performing table ranking processing on the pair according to the table position attributes of the two users includes:
when one of the two users occupies the table and the table is in a full state, judging whether the table which is not occupied exists;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
In another aspect, embodiments of the present specification further provide a table arrangement device for cross-border matching activities, including:
the generating module is used for generating a table arrangement pairing information table according to the user set participating in table arrangement;
the judging module is used for selecting a pair from the table arrangement pairing information table and confirming whether two users in the pair meet the table arrangement condition;
the table arrangement module is used for carrying out table arrangement processing on the pair according to the table position attributes of the two users when the two users meet the table arrangement condition to obtain a table arrangement result;
the updating module is used for updating the table arrangement pairing information table according to the table arrangement result;
and the display module is used for displaying the table arrangement result.
In another aspect, the embodiments of the present specification further provide a computer device, which includes a memory, a processor, and a computer program stored on the memory, and when the computer program is executed by the processor, the computer program executes the instructions of the above method.
In another aspect, the present specification further provides a computer storage medium, on which a computer program is stored, and the computer program is executed by a processor of a computer device to execute the instructions of the method.
In another aspect, the present specification further provides a computer program product, which includes a computer program that, when executed by a processor of a computer device, executes the instructions of the method described above.
As can be seen from the technical solutions provided by the embodiments of the present specification, in the embodiments of the present specification, after the table arrangement pairing information table is generated according to the set of users participating in table arrangement, one pair may be selected from the table arrangement pairing information table, and if two users in the pair meet the table arrangement condition, the table arrangement processing may be performed on the pair according to the table position attributes of the two users, so as to obtain a table arrangement result, and the table arrangement pairing information table is updated according to the table arrangement result and the table arrangement result is displayed. Therefore, by repeating the steps, the table arrangement of each pair in the same negotiation turn in the table arrangement pairing information table can be realized; for two users in any pairing, the two users are not limited to a host (namely, domestic small and medium enterprises) and an guest (namely, overseas small and medium enterprises), but also can be the host and the host, and even can be the guest and the guest; therefore, the row tables for matching activities are diversified, the requirement for diversification of matching activities is met, and the user experience is improved.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present specification, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort. In the drawings:
FIG. 1 illustrates a system architecture diagram of a cross-border matching system in some embodiments of the present description;
FIG. 2 illustrates a flow diagram of a method of arranging tables for cross-border matchmaking activities in some embodiments of the present description;
FIG. 3a is a schematic diagram illustrating a state of a table in an unoccupied state in an embodiment of the present disclosure;
FIG. 3b is a diagram illustrating a state of a table in an occupied and vacant position in one embodiment of the present description;
FIG. 3c is a schematic diagram illustrating a state of a table when the table is occupied and full in one embodiment of the present disclosure;
FIG. 4 is a flow diagram illustrating a table arrangement process for pairing according to the table location attributes of two users in the table arrangement method of FIG. 2;
FIG. 5 illustrates a block diagram of a table ganging apparatus for cross-border matchmaking activities in some embodiments of the present description;
FIG. 6 is a block diagram illustrating the architecture of a computer device in some embodiments of the present description.
[ description of reference ]
10. A client;
20. a server side;
3. a table position;
51. a generation module;
52. a judgment module;
53. a table arrangement module;
54. an update module;
55. a display module;
602. a computer device;
604. a processor;
606. a memory;
608. a drive mechanism;
610. an input/output interface;
612. an input device;
614. an output device;
616. a presentation device;
618. a graphical user interface;
620. a network interface;
622. a communication link;
624. a communication bus.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step should fall within the scope of protection of the present specification.
Fig. 1 illustrates a cross-border matching system, which may include a client 10 and a server 20, in some embodiments of the present description. Wherein, a part of the clients 10 can be located inside, and another part of the clients 10 can be located outside; the client 10 located in the interior and the client 10 located out of the country can communicate through the server 20, so that cross-border matching is realized; communication between different clients 10 located within the home may also be performed through the server 20 to enhance the diversity of matching activities. Wherein the clients 10 may communicate with each other (i.e., conduct an online negotiation session) based on the table assigned to them by the server 20.
In some embodiments, the client 10 may be a self-service terminal device, a mobile terminal (i.e., a smart phone), a display, a desktop computer, a tablet computer, a laptop computer, a digital assistant, a smart wearable device, or the like. Wherein, wearable equipment of intelligence can include intelligent bracelet, intelligent wrist-watch, intelligent glasses or intelligent helmet etc.. Of course, the client 10 is not limited to the electronic device with a certain entity, and may also be software running in the electronic device. The server 20 may be an electronic device with computing and network interaction functions; software that runs in the electronic device and provides business logic for data processing and network interaction is also possible.
The embodiment of the present specification provides a method for arranging tables for a cross-border matching activity, which can be applied to the side of the above-mentioned service end, and as shown in fig. 2, in some embodiments, the method for arranging tables for the cross-border matching activity may include the following steps:
And 203, when the two users meet the table arrangement condition, carrying out table arrangement processing on the pair according to the table position attributes of the two users to obtain a table arrangement result.
And step 204, updating a table arrangement pairing information table according to the table arrangement result.
And step 205, displaying the table arrangement result.
According to the table arrangement method for cross-border matching activities, after the table arrangement pairing information table is generated according to the user set participating in table arrangement, one pair can be selected from the table arrangement pairing information table, if two users in the pair meet a table arrangement condition, table arrangement processing can be performed on the pair according to the table position attributes of the two users, a table arrangement result is obtained, and the table arrangement pairing information table is updated according to the table arrangement result and is displayed. Therefore, by repeating the steps, the table arrangement of each pair in the same negotiation turn in the table arrangement pairing information table can be realized; for two users in any pairing, the two users are not limited to a host party (namely domestic small and medium-sized enterprises) and an object party (namely overseas small and medium-sized enterprises), but also can be the host party and the host party, and even can be the object party and the object party; therefore, the row tables for matching activities are diversified, the requirement for diversification of matching activities is met, and the user experience is improved.
To facilitate increased negotiation efficiency, a cross-border negotiation system may configure multiple negotiation rounds in a single cross-border negotiation campaign. For example, a cross-border matching activity is completed in one day, four negotiation turns are arranged in one day, and the time of the four negotiation turns is as follows: the time of the first negotiation is: 9: 00-10: 00; the time of the second negotiation is: 10: 30-11: 30; the time of the third negotiation is: 14: 00-15: 00; the time of the fourth negotiation is: 15: 30-16: 30. For each negotiation ethic, table arrangement processing is needed, so that users can negotiate online based on table arrangement results.
Before performing the table arrangement process, the server may generate a table arrangement pairing information table according to the set of users participating in table arrangement. The users in the user set participating in the table arrangement can be registered users of the cross-border matching system, are in an online state at present, and can be in online negotiation with other users at any time. Each record in the table arrangement pairing information table corresponds to one pairing; each pair comprises fields of user identification, user type, affiliated industry, negotiation turns, number of times of table-serving in a single negotiation turn, total number of times of table-serving, table position attribution identification, table position empty and full flag and the like of users of both sides.
The user identification is a user ID and is used for uniquely identifying one user; according to actual needs, users in the user set can be divided into different user types according to one or more dimensions; for example, if the region attribution is used as the division dimension, the user can be divided into two types, namely a main party and a guest party; with the association with the service provider (i.e., the service provider matching the activity) as a dimension of the division, the users can be divided into service provider customers, non-service provider customers, and so on. The total number of times a table has been taken is the total number of times a table has been taken within a specified range (i.e., all negotiation rounds of a cross-border matchmaking activity). For example, taking the above-mentioned one-scene-crossing matching activity (four negotiation turns are arranged in one day) as an example, the sum of the times that the user puts the table in the four negotiation turns is the total number of times that the user has put the table.
In the embodiment of the present specification, a table is a virtual meeting room or an instant messaging group (limited to participation of two users); and the table arrangement is a processing process of allocating table positions to each pair in the table arrangement pairing information table. The table attribution identifier is used to indicate or indicate which user the current table is occupied by, and therefore, the table attribution identifier may be a table number (i.e., an ID of the table) and a user identifier combination (table number-user identifier). The table empty/full flag is used to indicate the idle/busy status of the table (for example, when the table empty/full flag takes a value of 1, the table is full, and when the table empty/full flag takes a value of 0, the table is empty). In some embodiments, different images may be used to represent the different states of the table in order to facilitate visual inspection of the table state. For example, the table 3 may be represented graphically as shown in FIG. 3a when it is in an unoccupied state; when the table 3 is occupied and empty, it can be represented graphically as shown in fig. 3 b; when the table 3 is occupied and full, it can be represented graphically as shown in figure 3 c.
The table attribution mark and the table empty and full mark can be used as the table attribute of the user. The server can configure the table attribute of the user in an initialization stage. For example, in one embodiment, the server may provide an appropriate number of tables based on the number of users in the user set to account for negotiation efficiency and system resource overhead. In the same negotiation ethics, when the users who possess the table have completed the negotiation of the negotiation ethics, the occupation of the table is automatically released so as to be convenient for other users to use.
Through the user information read from the user database, the server side can assign values (such as user identification, user type, industry of the user and the like) to partial fields in the table arrangement pairing information table; based on a preset configuration strategy, the server side can carry out initialization assignment on fields such as negotiation turns, the number of times of having put the table in a single negotiation turn, the total number of times of having put the table, a table attribution identification and a table empty and full mark.
In order to improve the negotiation experience and efficiency of users, users of both parties in each configuration should be as many as the negotiation objects desired by the other parties. Therefore, the server side can carry out pairing by calculating the matching degree between the users. For example, in some embodiments, the server may formulate a formula for a target user (i.e., the currently selected user) in the set of users
Calculating the matching degree of other users in the user set and the target user; pairing the user corresponding to the highest matching degree with the target user; likewise, in this manner, the remaining users in the user set may be paired. Wherein s is j Matching degree value of the jth user and the target user; a is i The correlation between the ith characteristic of the jth user and the negotiation demand characteristic corresponding to the target user; lambda [ alpha ] i Is a i The coefficient of (a). For example, in one embodiment, the negotiation requirements characteristics of the target user may includeA primary product or a primary service, an affiliated industry, an intentional amount of collaboration, a collaboration mode, a collaboration scale, a time period, and the like.
In other embodiments, a threshold may be set by calculating the matching degree between users for pairing, and when the matching degree value between the user with the highest matching degree and the target user reaches the threshold, the user with the highest matching degree may be paired with the target user; otherwise, it may be considered that there is no user matching the target user, and the pairing of the target user may be abandoned, so as to avoid wasting the user's time.
In some embodiments, the table arrangement condition may include:
the number of times that each user has been put on the table in the negotiation turn does not reach a first upper limit value;
the total number of times that each user has been put on the table in all negotiation turns does not reach a second upper limit value; and the number of the first and second groups,
at least one user is a specified type of user.
The first upper limit value may be 1 time; the second upper limit value can be determined according to the round of negotiation (for example, if the round of negotiation is 10 rounds, the second upper limit value can be set to 10 times), and by setting the number of times of having put the table and the total number of times of having put the table, the fairness and the participation degree of the negotiation can be improved, and the user experience is improved. The specified type of user may be customized as desired, for example, in one embodiment, the specified type of user may be a master and a service provider customer.
If two users in the pair meet the table arrangement condition, the pair can be arranged according to the table position attributes of the two users, otherwise, the pair can be skipped (i.e. the pair is not arranged).
For example, in an exemplary embodiment, if the second threshold is 10 times, both users (user a and user b) in the pair are primary users, and if the total number of times that user a has been used for the table is 10 times and the total number of times that user b has been used for the table is eight times, the pair is skipped because the total number of times that user a has been used for the table reaches the second threshold.
Referring to fig. 4, performing table arrangement processing on the pair according to the table attributes of the two users may include the following steps:
If there is an unoccupied table, the pairing may be placed to the table, step 407. If there are a plurality of unoccupied tables, one table may be selected from the plurality.
If the table is empty, the pairing may be placed to the table, step 410.
If there is an unoccupied table, the pairing may be placed to the table, step 412. If there are a plurality of unoccupied tables, one table may be selected from the plurality.
By combining the method shown in fig. 4, the table arrangement processing is performed on the pair according to the table attributes of the two users, which can be divided into the following cases:
1) and when the two users both occupy the table positions and both the table positions are in the vacant state, selecting the table position with the smaller number of times of putting on the table to place the pair.
2) And when the two users both occupy the desk positions and one desk position is in the vacancy state, placing the pair to the desk position corresponding to the vacancy state.
3) When the two users both occupy the table positions and the table positions of the two users are in a full state, judging whether the table positions which are not occupied exist; if there is an unoccupied table, placing the pair to the table; if there are no unoccupied table bits, the pairing is skipped.
4) And when one of the two users occupies the desk and the desk is in an empty state, placing the pair to the desk.
5) When one of the two users occupies the table and the table is in a full state, judging whether the table which is not occupied exists; if there is an unoccupied table, placing the pair to the table; if there are no unoccupied table bits, the pairing is skipped.
In some embodiments, updating the table arrangement pairing information table according to the table arrangement result may include: and updating the fields of the number of times of table-loading, the total number of times of table-loading, the table position attribution identification, the table position empty and full mark and the like of the two users in the pairing.
While the process flows described above include operations that occur in a particular order, it should be appreciated that the processes may include more or less operations that are performed sequentially or in parallel (e.g., using parallel processors or a multi-threaded environment).
Corresponding to the above-mentioned table arrangement method for the cross-border matching activity, embodiments of the present specification further provide a table arrangement device for the cross-border matching activity, which can be configured on the above-mentioned server. Referring to fig. 5, in some embodiments, the table ganging apparatus for cross-border matchmaking activities may comprise:
the generating module 51 may be configured to generate a table arrangement pairing information table according to a set of users participating in table arrangement;
the determining module 52 may be configured to select a pair from the table arrangement pairing information table, and determine whether two users in the pair satisfy the table arrangement condition;
the table arrangement module 53 may be configured to, when the two users meet the table arrangement condition, perform table arrangement processing on the pair according to the table position attributes of the two users to obtain a table arrangement result;
an updating module 54, configured to update the table arrangement pairing information table according to the table arrangement result;
a display module 55 may be used to display the row table results.
In the table arrangement device for cross-border matching activities of some embodiments, each record in the table arrangement pairing information table corresponds to one pair; each pair contains the following information for both users:
user identification, user type, industry affiliated, negotiation turns, number of times that a table has been put on in a single negotiation turn, total number of times that a table has been put on, table attribution identification, and a table empty and full flag.
In a ganged table arrangement for a cross-border matchmaking activity of some embodiments, the ganged table conditions comprise:
the number of times that each user has been on the table in the negotiation turn does not reach a first upper limit value;
the total number of times that each user has been put on the table in all negotiation turns does not reach a second upper limit value; and the number of the first and second groups,
at least one user is a specified type of user.
In the table arrangement device for cross-border matching activities of some embodiments, the table arrangement processing the pair according to the table position attributes of the two users includes:
and when the two users both occupy the table positions and both the table positions are in the vacant state, selecting the table position with the smaller number of times of putting on the table to place the pair.
In the table arrangement device for cross-border matching activities of some embodiments, the table arrangement processing the pair according to the table position attributes of the two users further includes:
and when the two users both occupy the desk positions and one desk position is in the vacancy state, placing the pair to the desk position corresponding to the vacancy state.
In the table arrangement device for cross-border matching activities of some embodiments, the table arrangement processing the pair according to the table position attributes of the two users further includes:
when the two users both occupy the table positions and the table positions of the two users are in a full state, judging whether the table positions which are not occupied exist;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
In the table arrangement device for cross-border matching activities of some embodiments, the table arrangement processing the pair according to the table position attributes of the two users includes:
and when one of the two users occupies the desk and the desk is in an empty state, placing the pair to the desk.
In the table arrangement device for cross-border matching activities of some embodiments, the table arrangement processing the pair according to the table position attributes of the two users includes:
when one of the two users occupies the table and the table is in a full state, judging whether the table which is not occupied exists;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.
It should be noted that, in the embodiments of the present specification, the user information (including, but not limited to, user device information, user personal information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) referred to are information and data that are authorized by the user and are sufficiently authorized by the parties.
Embodiments of the present description also provide a computer device. As shown in fig. 6, in some embodiments of the present description, the computer device 602 may include one or more processors 604, such as one or more Central Processing Units (CPUs) or Graphics Processors (GPUs), each of which may implement one or more hardware threads. The computer device 602 may also include any memory 606 for storing any kind of information such as code, settings, data, etc., and in a particular embodiment, a computer program on the memory 606 and executable on the processor 604, the computer program when executed by the processor 604 may perform the instructions of the table ranking method for cross-border matching activities described in any of the embodiments above. For example, and without limitation, memory 606 may include any one or more of the following in combination: any type of RAM, any type of ROM, flash memory devices, hard disks, optical disks, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent fixed or removable components of computer device 602. In one case, when the processor 604 executes the associated instructions, which are stored in any memory or combination of memories, the computer device 602 may perform any of the operations of the associated instructions. The computer device 602 also includes one or more drive mechanisms 608, such as a hard disk drive mechanism, an optical disk drive mechanism, etc., for interacting with any memory.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), computer-readable storage media, and computer program products of some embodiments of the specification. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processor to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processor, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processor to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processor to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computer device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium which can be used to store information that can be accessed by a computer device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The embodiments of this specification may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The described embodiments may also be practiced in distributed computing environments where tasks are performed by remote processors that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
It should also be understood that, in the embodiment of the present specification, the term "and/or" is only one kind of association relation describing an associated object, and means that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of an embodiment of the specification. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (12)
1. A method of arranging tables for cross-border matchmaking activities, comprising:
generating a table arrangement pairing information table according to the user set participating in table arrangement;
selecting a pair from the table arrangement pairing information table, and determining whether two users in the pair meet a table arrangement condition;
when the two users meet the table arrangement condition, carrying out table arrangement processing on the pair according to the table position attributes of the two users to obtain a table arrangement result;
updating a table arrangement pairing information table according to the table arrangement result;
and displaying the table arrangement result.
2. The method of claim 1, wherein each record in the table alignment pair information table corresponds to a pair; each pair contains the following information for both users:
user identification, user type, industry affiliated, negotiation turns, number of times that a table has been put on in a single negotiation turn, total number of times that a table has been put on, table attribution identification, and a table empty and full flag.
3. The method of claim 1, wherein the table alignment condition comprises:
the number of times that each user has been put on the table in the negotiation turn does not reach a first upper limit value;
the total number of times that each user has been put on the table in all negotiation turns does not reach a second upper limit value; and the number of the first and second groups,
at least one user is a specified type of user.
4. The method of claim 1, wherein said ranking the pair according to the table position attributes of the two users comprises:
and when the two users both occupy the table positions and both the table positions are in the vacant state, selecting the table position with the smaller number of times of putting on the table to place the pair.
5. The method of claim 1, wherein the ranking the pair according to the table position attributes of the two users further comprises:
and when the two users both occupy the desk positions and one desk position is in the vacancy state, placing the pair to the desk position corresponding to the vacancy state.
6. The method of claim 1, wherein the ranking the pair according to the table position attributes of the two users further comprises:
when the two users both occupy the table positions and the table positions of the two users are in a full state, judging whether the table positions which are not occupied exist;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
7. The method of claim 1, wherein said ranking the pair according to the table position attributes of the two users comprises:
and when one of the two users occupies the desk and the desk is in an empty state, placing the pair to the desk.
8. The method of claim 1, wherein said ranking the pair according to the table position attributes of the two users comprises:
when one of the two users occupies the table and the table is in a full state, judging whether the table which is not occupied exists;
if there is an unoccupied table, placing the pair to the table;
if there are no unoccupied table bits, the pairing is skipped.
9. A ganged table apparatus for cross-border matchmaking activities, comprising:
the generating module is used for generating a table arrangement pairing information table according to the user set participating in table arrangement;
the judging module is used for selecting a pair from the table arrangement pairing information table and confirming whether two users in the pair meet the table arrangement condition;
the table arrangement module is used for carrying out table arrangement processing on the pair according to the table position attributes of the two users when the two users meet the table arrangement condition to obtain a table arrangement result;
the updating module is used for updating the table arrangement pairing information table according to the table arrangement result;
and the display module is used for displaying the table arrangement result.
10. A computer device comprising a memory, a processor, and a computer program stored on the memory, wherein the computer program, when executed by the processor, performs the instructions of the method of any one of claims 1-8.
11. A computer storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor of a computer device, executes instructions of a method according to any one of claims 1-8.
12. A computer program product, characterized in that the computer program product comprises a computer program which, when executed by a processor, executes instructions for a method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210460340.7A CN114827261B (en) | 2022-04-28 | 2022-04-28 | Table arrangement method, device, equipment and storage medium for cross-border matching activities |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210460340.7A CN114827261B (en) | 2022-04-28 | 2022-04-28 | Table arrangement method, device, equipment and storage medium for cross-border matching activities |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114827261A true CN114827261A (en) | 2022-07-29 |
| CN114827261B CN114827261B (en) | 2024-10-11 |
Family
ID=82510036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210460340.7A Active CN114827261B (en) | 2022-04-28 | 2022-04-28 | Table arrangement method, device, equipment and storage medium for cross-border matching activities |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114827261B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111563683A (en) * | 2020-05-09 | 2020-08-21 | 中国银行股份有限公司 | Multi-turn table arranging method and device for cross-border matching activities |
| CN111581990A (en) * | 2020-05-14 | 2020-08-25 | 中国银行股份有限公司 | Cross-border transaction matching method and device |
| CN111861427A (en) * | 2020-08-06 | 2020-10-30 | 中国银行股份有限公司 | Negotiation activity management method and device |
| CN111985808A (en) * | 2020-08-19 | 2020-11-24 | 中国银行股份有限公司 | Method and device for matching movable table arrangement |
| CN114372533A (en) * | 2022-01-12 | 2022-04-19 | 中国银行股份有限公司 | Hybrid table arrangement data processing method and device for matching activities |
-
2022
- 2022-04-28 CN CN202210460340.7A patent/CN114827261B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111563683A (en) * | 2020-05-09 | 2020-08-21 | 中国银行股份有限公司 | Multi-turn table arranging method and device for cross-border matching activities |
| CN111581990A (en) * | 2020-05-14 | 2020-08-25 | 中国银行股份有限公司 | Cross-border transaction matching method and device |
| CN111861427A (en) * | 2020-08-06 | 2020-10-30 | 中国银行股份有限公司 | Negotiation activity management method and device |
| CN111985808A (en) * | 2020-08-19 | 2020-11-24 | 中国银行股份有限公司 | Method and device for matching movable table arrangement |
| CN114372533A (en) * | 2022-01-12 | 2022-04-19 | 中国银行股份有限公司 | Hybrid table arrangement data processing method and device for matching activities |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114827261B (en) | 2024-10-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107845012B (en) | Order processing method and device | |
| AU2013305922B2 (en) | Hierarchical based sequencing machine learning model | |
| US8548865B1 (en) | System and method for group gift exchanges | |
| US20220174100A1 (en) | System and method for grouping participant devices in a communication environment | |
| CN110889656B (en) | Warehouse rule configuration method and device | |
| US20150339596A1 (en) | Apparatus and Methods of Recommending Multiple Options to a Group of Remote Users and Forming an Agreement | |
| CN107369055A (en) | The picking distribution method and device of order messages | |
| CN107622060A (en) | Order trace analysis method and device | |
| Sihna et al. | Medical education system based on Metaverse platform: A game theoretic approach | |
| CN110753323B (en) | Card resource allocation method and server | |
| CN106998314A (en) | Account exchange method and device | |
| CN114372533A (en) | Hybrid table arrangement data processing method and device for matching activities | |
| CN110727877B (en) | Group operation method and system suitable for social software | |
| KR20140031429A (en) | Item recommend system and method thereof, apparatus supporting the same | |
| CN114827261B (en) | Table arrangement method, device, equipment and storage medium for cross-border matching activities | |
| US11922343B2 (en) | Systems and methods for combinatorial resource optimization | |
| CN105335373A (en) | Information searching method and apparatus | |
| CN110929284A (en) | Multi-system data sharing model construction method and data sharing method | |
| CN111859115B (en) | User allocation method and system, data processing equipment and user allocation equipment | |
| US10616293B1 (en) | Multiple account binding | |
| CN106598987A (en) | Information recommendation method and device | |
| CN109829103A (en) | A kind of method for down loading and device of application program | |
| CN104240016A (en) | Management method and device for users in virtual place | |
| US20230419192A1 (en) | Systems and methods for virtual space reservation in the metaverse | |
| WO2023029830A1 (en) | Electronic certificate generation method and apparatus, electronic device, and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |