CN116720010A - Method and device for recommending riding and repairing stations and electronic equipment - Google Patents

Method and device for recommending riding and repairing stations and electronic equipment Download PDF

Info

Publication number
CN116720010A
CN116720010A CN202310609426.6A CN202310609426A CN116720010A CN 116720010 A CN116720010 A CN 116720010A CN 202310609426 A CN202310609426 A CN 202310609426A CN 116720010 A CN116720010 A CN 116720010A
Authority
CN
China
Prior art keywords
riding
user
data
channel
channels
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.)
Pending
Application number
CN202310609426.6A
Other languages
Chinese (zh)
Inventor
郑霖
陆梦倩
王维强
汲小溪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alipay Hangzhou Information Technology Co Ltd
Original Assignee
Alipay Hangzhou Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Alipay Hangzhou Information Technology Co Ltd filed Critical Alipay Hangzhou Information Technology Co Ltd
Priority to CN202310609426.6A priority Critical patent/CN116720010A/en
Publication of CN116720010A publication Critical patent/CN116720010A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/14—Payment architectures specially adapted for billing systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
    • G06Q20/322—Aspects of commerce using mobile devices [M-devices]
    • G06Q20/3224—Transactions dependent on location of M-devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
    • G06Q20/327—Short range or proximity payments by means of M-devices
    • G06Q20/3274—Short range or proximity payments by means of M-devices using a pictured code, e.g. barcode or QR-code, being displayed on the M-device
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46—Secure multiparty computation, e.g. millionaire problem

Abstract

The specification provides a method and device for recommending a riding and boarding site and electronic equipment. The method comprises the following steps: when the current bus taking channel responds to the arrival request of the user and finds that the user needs to complement the last arrival station, inquiring the user bus taking data of the last bus taking record of the user stored in the current bus taking channel; based on a multiparty safety ordering algorithm, ordering the user riding data stored in other riding channels and recorded by the last riding of the user and the user riding data in the current riding channel according to time sequence; the multiparty safety ordering algorithm is used for determining ordering results between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data; and recommending the top-up site to the user according to the site name corresponding to each user riding data in the sequencing result. The user riding data cannot go out of the domain in the multiparty safety ordering process, so that the privacy of the user is protected.

Description

Method and device for recommending riding and repairing stations and electronic equipment
Technical Field
The embodiment of the specification relates to the technical field of Internet, in particular to a method and a device for recommending riding and repairing sites and electronic equipment.
Background
As mobile payment is applied to a ride scenario, a user may ride a public transportation using a mobile terminal swipe code. The public transportation operation public conventions and payment companies settle the user riding fees. In general, a user's primary fare may be calculated by determining a start-to-end path from a station scanning a code at an inbound and outbound.
However, in some special cases (such as network abnormality), the outbound site may not be recorded when outbound occurs, resulting in a problem that the person has not settled the fare normally although it has been outbound.
When the user swipes the mobile phone next time, the user is prompted to manually and additionally register the last outbound site, and the process is called subway top-up site.
Disclosure of Invention
The embodiment of the specification provides a method and device for recommending riding and boarding sites and electronic equipment.
According to a first aspect of embodiments of the present specification, there is provided a method of recommending a ride-on-boarding site, the method comprising:
under the condition that a current riding channel responds to a user's inbound request to find that the user needs to complement a last outbound site, inquiring user riding data stored in the current riding channel and recorded in the last riding of the user;
Based on a multiparty safety ordering algorithm, ordering user riding data stored in other riding channels and recorded by the last riding of the user and user riding data in the current riding channel according to time sequence; the multiparty safety ordering algorithm is used for determining ordering results between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data;
and recommending the top-up site to the user according to the site name corresponding to each user riding data in the sequencing result.
Optionally, the sorting, based on the multiparty secure sorting algorithm, the user boarding data of the last boarding record of the user stored in other boarding channels and the user boarding data in the current boarding channel according to time sequence includes:
the current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
splitting post-arrival event time stored in user riding data in respective riding channels into two parts;
splitting any riding channel into two parts, namely calculating a negation value of event time after entering a station;
Exchanging post-arrival event times for any portion of the two riding channels;
summing event time after entering stations exchanged in each riding channel, and summing the summation results of the two riding channels again;
if the re-summation result is negative, the user riding data of the riding channel with the negation value is arranged before the user riding data of the other riding channel;
and if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
Optionally, the sorting, based on the multiparty secure sorting algorithm, the user boarding data of the last boarding record of the user stored in other boarding channels and the user boarding data in the current boarding channel according to time sequence includes:
the current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
performing order-preserving encryption on the post-arrival event time in the user riding data stored in the riding channels to obtain the post-arrival event time of the ciphertext;
and determining a sequencing result between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the method further comprises:
acquiring the geographical position of an event after the arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to each user riding data based on the geographical position of the event after the station entering.
Optionally, the determining the site name corresponding to each user riding data based on the post-arrival event geographical location includes:
acquiring a site name within a preset radius of the geographical position of the event after entering the station;
calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the incoming event;
and determining the site name with the minimum distance as the site name corresponding to the user riding data of the event geographical position after the arrival.
Optionally, the recommending the top-up website to the user according to the website name corresponding to each user riding data in the sorting result includes:
and determining the site name corresponding to the user riding data with the latest time in the sequencing result as the complement site to be recommended to the user.
Optionally, the recommending the top-up website to the user according to the website name corresponding to each user riding data in the sorting result includes:
Recommending site names corresponding to a preset number of user riding data with later time in the sequencing result to the user; so that the user selects one from the recommended site names as the top-up site.
According to a second aspect of embodiments of the present specification, there is provided an apparatus for recommending a ride-on-boarding site, the apparatus comprising:
the system comprises a response unit, a first-time bus taking unit and a second-time bus taking unit, wherein the response unit is used for inquiring user bus taking data of a last-time bus taking record of a user stored in a current bus taking channel under the condition that the current bus taking channel responds to an arrival request of the user and finds that the user needs to be complemented with a last-time outbound station;
the sequencing unit is used for sequencing the user riding data stored in the previous riding records of the user in other riding channels and the user riding data in the current riding channel according to time sequence based on a multiparty safety sequencing algorithm; the multiparty safety ordering algorithm is used for determining ordering results between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data;
and the recommending unit recommends a top-up website to the user according to the website name corresponding to each user riding data in the sequencing result.
Optionally, the sorting unit includes:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
a splitting subunit for splitting the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit divides any riding channel into two parts of event time negation values after entering the station;
an exchange subunit for exchanging event time after any part of the two riding channels enter the station;
a summation subunit, for summing the event time after the arrival exchanged in each riding channel, and for summing the summation results of the two riding channels again;
a sorting subunit, if the re-summation result is negative, sorting the user riding data of the riding channel with the negation value before the user riding data of the other riding channel; and if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
Optionally, the sorting unit includes:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
An encryption subunit, configured to perform order-preserving encryption on the post-arrival event time stored in the user riding data in the riding channels to obtain a post-arrival event time of the ciphertext;
and the sequencing subunit determines sequencing results between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the apparatus further includes:
the acquisition unit is used for acquiring the geographical position of the event after the arrival of the riding data of each user in the sequencing result;
and the determining unit is used for determining the site name corresponding to each user riding data based on the geographical position of the event after the arrival.
Optionally, the determining unit includes:
the acquisition subunit acquires the site name within a preset radius of the geographical position of the event after the arrival;
a calculating subunit for calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the incoming event;
and the determining subunit determines the site name with the smallest distance as the site name corresponding to the user riding data of the geographical position of the event after the arrival.
Optionally, the recommending unit includes:
and determining the site name corresponding to the user riding data with the latest time in the sequencing result as the complement site to be recommended to the user.
Optionally, the recommending unit includes:
recommending site names corresponding to a preset number of user riding data with later time in the sequencing result to the user; so that the user selects one from the recommended site names as the top-up site.
According to a third aspect of embodiments of the present specification, there is provided an electronic device comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to any of the methods of recommending a ride-patch site described above.
According to the scheme, through a multiparty safety ordering algorithm, under the condition that user riding data in a plurality of riding channels does not go out of a domain, the most likely outbound sites when the user takes the bus last time are determined based on the user riding data stored in each riding channel, and therefore the outbound sites are recommended to the user for the user to select the complement sites. Thus, not only can automatic site subsidy be realized, but also the risk of personal data leakage of users can be avoided because the user riding data of each riding channel does not go out of the domain.
Drawings
FIG. 1 is a flow chart of a method of recommending a ride complement site provided by an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a multiparty secure ordering calculation process provided by an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of a real path of a previous ride of a user restored from user ride data shown in tables 1-6 provided in the present specification;
FIG. 4 is a schematic diagram of a top-up site interface on a user terminal according to an embodiment of the present disclosure;
fig. 5 is a hardware configuration diagram of an apparatus for recommending a riding supplement station according to an embodiment of the present disclosure;
fig. 6 is a schematic block diagram of an apparatus for recommending a riding supplement station according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present specification. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present description as detailed in the accompanying claims.
The terminology used in the description presented herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the description. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items. Plural herein may refer to two or more cases.
It should be understood that although the terms first, second, third, etc. may be used in this specification to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.
As described above, with the popularization of the mobile terminal code scanning riding, queuing ticket purchasing time is greatly saved, and people travel is facilitated. To take care of different passengers, public transportation companies may cooperate with different third party platforms to open various types of riding channels to each of the third party platforms that may open a riding code. For example, a ride code may be generated by a ride applet in the payment software, a ride applet in the instant messaging software, a ride APP of the public transportation operator itself, etc. to effect a code scanning approach.
However, since different riding channels are generally independent, companies of the riding channels do not disclose user riding data as core assets externally, and the user riding data as personal data of users is inconvenient to leave the domain in terms of privacy. This results in the problem of data islanding, giving individual users the option to make single-sided transactions (only in-site, no out-site) to evade tickets. These single-sided transactions, due to lack of outbound sites, cannot be settled normally, and can cause losses to public transportation operators.
Although site subsidy can be performed when the user enters the site next time, the subsidized outbound site is completely manually received by the user, and the user can completely select the outbound site with the lowest cost as the subsidized site.
Accordingly, it is desirable to provide a system that determines the most likely outbound point last time the user was to assist in completing the ride-on boarding station.
In order to solve the above problems, the present disclosure provides a scheme for recommending a riding-complement site, which aims to restore an actual riding path of a user according to user riding data recorded during the last riding of the user in a multiparty riding channel, and determine a most likely outbound site of the user according to the actual riding path to help to complete the riding-complement site. Thus, the unilateral transaction proportion can be reduced, and the loss of public transport means operation companies can be reduced.
In addition, by utilizing a multiparty safety sorting algorithm, when the user riding data recorded in the last riding of the user in each riding channel does not go out of the domain, the actual riding path of the user is restored. Therefore, the personal data of the user cannot be leaked because the riding data of the user cannot go out of the domain, and the privacy of the user is guaranteed.
The public transportation means can be facilities such as subways, buses, urban light rails, trains and the like provided with an entrance gate, an exit gate and the like, and can realize public transportation scenes of code scanning riding.
The following may be introduced with reference to the example shown in fig. 1, where the method may be applied to a server corresponding to any riding channel, where the server may be a server, a server cluster, or a cloud platform constructed by the server cluster corresponding to the riding channel; the method may comprise the steps of:
step 210: under the condition that a current riding channel responds to a user's inbound request to find that the user needs to complement a last outbound site, inquiring user riding data stored in the current riding channel and recorded in the last riding of the user;
step 220: based on a multiparty safety ordering algorithm, ordering user riding data stored in other riding channels and recorded by the last riding of the user and user riding data in the current riding channel according to time sequence; the multiparty safety ordering algorithm is used for determining ordering results between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data;
step 230: and recommending the top-up site to the user according to the site name corresponding to each user riding data in the sequencing result.
The embodiments of the present description apply between at least two riding channels. The passenger channels that the user uses when currently standing, as well as other passenger channels that the user does not use. When a plurality of riding channels are installed on a mobile terminal of one user, the current riding channel is 1, and other riding channels than the current riding channel are 1 or more. That is, the current riding channels described in the present embodiment are 1, and other riding channels may be 1 or a plurality thereof. The plural number here includes 2 or more than 2. Generally, the more riding channels, the more comprehensive the user riding data can be obtained, the more accurate the user riding path is restored, and the more accurate the final recommended top-up station is.
In practical applications, the user riding data are recorded and stored in a standardized data format. The constitution of the user riding data is exemplarily described in this specification.
The user ride data may include, but is not limited to: user identification, time of arrival, time of post-arrival event, and geographic location of post-arrival event.
The user identification refers to information which can uniquely correspond to users and is used for determining which user generates the riding data. The user identification may be, for example, a user account, a user ID, a user cell phone number, and the like. This is not intended to be limiting in this specification.
The entering time refers to the time of the user scanning the code to enter the station and is used for determining the starting time of one riding journey. The arrival time may be recorded in the form of a time stamp or in the form of year, month, hour, and hour Zhong Miao. This is not intended to be limiting in this specification.
The post-arrival event time refers to the time when the user executes the related event through the channel after the group entering time. The post-arrival event time is typically recorded in the same form as the aforementioned arrival time.
The event refers to various service functions provided by a channel, such as wifi (e.g. subway station wifi), news browsing, video watching, network telephone, etc. in the connection station.
The method is described below in connection with an actual event, and after a user enters a station, the user can acquire a public wifi password in a station through a channel to connect wifi. The operation of acquiring the wifi password triggers one event, and the operation of successfully connecting the wifi password with the wifi input triggers the other event. For another example, assuming that the channel also provides news blocks, the user may browse news after entering the station, and each time the user clicks on a news, an event is triggered. It is not important in this specification to obtain just the time of the post-arrival event and the geographical location of the post-arrival event, but in particular what event is.
The post-arrival event geographical location refers to location data recorded by a user when performing related events through a channel after the group entering time. In particular, the geographical location may be location data recorded by a positioning device in the mobile terminal. The geographic location may be generally referred to as LBS (Location Based Services, location based service) data. The post-arrival event geographic location may be recorded in terms of latitude and longitude coordinates.
Further, the present invention will be described with reference to specific examples, in which the user riding data includes two parts, one part is user riding data stored in the current riding channel and the other part is user riding data stored in the other riding channel.
User ride data stored in other ride channels are shown in table 1 below:
user identification Time of arrival Event time after inbound Post-arrival event geographic location
user001 2020/4/1/11:14 2020/4/1/11:21 (113.277,23.091)
user001 2020/4/1/11:14 2020/4/1/14:49 (113.271,23.117)
user001 2020/4/1/11:14 2020/4/1/15:12 (113.262,23.124)
TABLE 1
User ride data stored in the current ride channel is shown in table 2 below:
user identification Time of arrival Event time after inbound Post-arrival event geographic location
user001 2020/4/1/11:14 2020/4/1/12:08 (113.275,23.088)
user001 2020/4/1/11:14 2020/4/1/15:31 (113.257,23.123)
user001 2020/4/1/11:14 2020/4/1/15:51 (113.273,23.098)
TABLE 2
The user riding data in table 1 and table 2 are stored locally at the service end corresponding to each riding channel. Because the user identifier is carried in the inbound request initiated by the user currently, the historical user riding data of the user identifier can be screened through the user identifier of the inbound request. Further, since the user boarding data also includes the time of boarding, the user boarding data after the last time of boarding can be specified as the user boarding data recorded by the last time of boarding.
Inquiring user riding data shown in table 2 in the current riding channel; after the user riding data shown in table 1 is queried by other riding channels; the current riding channel may securely rank table 1 and table 2 in time order (i.e., in post-arrival event time) based on a multiparty secure ranking algorithm. Under the condition that the user riding data does not go out of the domain, determining the time sequence of the user riding data; and then, based on the time sequence and the corresponding station of each user riding data, the last riding path of the user is restored.
In this specification, the multiparty secure ordering algorithm is an algorithm for implementing ordering under the condition that data does not go out of domain. Specifically, under the condition that the other riding channels do not send stored user riding data, a sorting result between the local user riding data and the user riding data of the other riding channels is obtained under the current riding channel, wherein the sorting result is a sorting sequence number, and no user riding data is involved.
In an embodiment, the step 220 may specifically include:
step A1: the current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
Step A2: splitting post-arrival event time stored in user riding data in respective riding channels into two parts;
step A3: splitting any riding channel into two parts, namely calculating a negation value of event time after entering a station;
step A4: exchanging post-arrival event times for any portion of the two riding channels;
step A5: summing event time after entering stations exchanged in each riding channel, and summing the summation results of the two riding channels again;
step A6: if the re-summation result is negative, the user riding data of the riding channel with the negation value is arranged before the user riding data of the other riding channel; or if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
The following is a schematic diagram of a multiparty safe ordering calculation process shown in fig. 2, which is described by taking two riding channels as an example, and simplifying post-arrival event time into a numerical value for ease of understanding. The event time after the user in the first riding channel enters the bus is 10 as shown in fig. 2; the event time after the arrival in the user riding data of the second riding channel is 15.
First, the post-arrival event time stored in the user riding data in the respective riding channels is split into two parts. In fig. 2, the post-arrival event time 10 of the first riding channel is split into 3 and 7; the post-arrival event time 15 for the second ride channel is split into 5 and 10. Note that the post-arrival event time is still stored in the bus channel without leaving the domain, and the splitting may be performed by the respective bus channel. However, the agreement may also be performed by a trusted third party if negotiations are made between the various riding channels. For example, a locally executed program provided by a trusted third party splits post-arrival event time locally at each of the riding channels. The local post-arrival event time can also be provided for a trusted third party to split. Splitting by a trusted third party can prevent cheating of riding channels from tampering with user riding data. Wherein the split may be a random split.
Then, any riding channel is split into two parts, namely, event time negation after entering the station is achieved. In fig. 2, the event time after entering 5 and 10 after the second riding channel is split are negated to obtain event time after entering-5 and-10.
The post-arrival event time for either portion of the two riding channels is then exchanged. In fig. 2, the post-arrival event time 3 split in the first riding channel is exchanged with the post-arrival event time-10 split in the second riding channel.
And finally, summing the event time after the arrival exchanged in each riding channel, and summing the summation results of the two riding channels again. In fig. 2, the post-arrival event time after the first ride channel exchange includes 7 and-10, and the summation result is-3; the post-arrival event time after the second ride channel exchange includes 3 and-5, and the summation result is-2. And re-summing the summation result-3 of the first riding channel and the summation result-2 of the second riding channel, wherein the re-summation result is-5.
And since the re-summation result is negative, the user riding data of the riding channel with the negation value is arranged before the user riding data of the other riding channel. That is, the user ride data of the second ride channel is arranged before the user ride data of the first ride channel.
It should be noted that, since the post-arrival event time 15 of the second riding channel is greater than the post-arrival event time 10 of the first riding channel, it is indeed supposed that the post-arrival event time 15 is arranged before the post-arrival event time 10, and it is seen that the above-mentioned multiparty safety ranking is correct. In addition, no matter how split and how exchanged, the final ordering result is virtually unaffected, i.e., the result of the multiparty secure ordering described above is said to be unique.
Through the multiparty safety sequencing calculation, the user riding data exchanged between riding channels is the post-arrival event time, and the post-arrival event time is only the post-arrival event time of the split part. Because even this exchanged user ride data reveals no complete user ride data can be deduced. The multiparty safety ordering has higher data safety, and ensures that personal data of a user is not leaked.
There is also provided in this specification another multiparty secure ordering scheme, specifically said step 220, which may comprise:
step B1: the current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
step B2: performing order-preserving encryption on the post-arrival event time in the user riding data stored in the riding channels to obtain the post-arrival event time of the ciphertext;
step B3: and determining a sequencing result between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
The order-preserving encryption can be performed based on an order-preserving encryption algorithm which does not change the original size order of the plaintext after encryption. For example, the Order-preserving encryption algorithm may include an OPE (Order-Preserving Encryption) algorithm.
The multi-party safety ordering adopting order-preserving encryption is that the user riding data in the riding channel can go out of the domain, but the encrypted ciphertext user riding data is leaked out of the domain, so that the ciphertext is leaked instead of the plaintext user riding data. Therefore, the clear user ride data may still be considered unobservable. The multi-party security ordering through order-preserving encryption is also specific and high in data security, so that personal data of a user are prevented from being leaked.
After the multiparty safe ordering is known, the ordering result in the step 220 is shown in the rank fields in the following tables 3 and 4:
user ride data stored in other ride channels are shown in table 3 below:
user identification Time of arrival Event time after inbound Post-arrival event geographic location rank
user001 2020/4/1/11:14 2020/4/1/11:21 (113.277,23.091) 1
user001 2020/4/1/11:14 2020/4/1/14:49 (113.271,23.117) 3
user001 2020/4/1/11:14 2020/4/1/15:12 (113.262,23.124) 4
TABLE 3 Table 3
User ride data stored in the current ride channel is shown in table 4 below:
user identification Time of arrival Event time after inbound Post-arrival event geographic location rank
user001 2020/4/1/11:14 2020/4/1/12:08 (113.275,23.088) 2
user001 2020/4/1/11:14 2020/4/1/15:31 (113.257,23.123) 5
user001 2020/4/1/11:14 2020/4/1/15:51 (113.273,23.098) 6
TABLE 4 Table 4
After the sorting result between the user riding data of the current riding channel and the user riding data of other riding channels is calculated based on the multiparty safety sorting algorithm, the site name corresponding to each user riding data also needs to be determined.
Since the user riding data is recorded when the user uses the service function provided by the riding channel after entering the station, the user is not necessarily located at the station when the user riding data is recorded, and it is likely to be a road section located between two stations. Therefore, the user riding data is not actually recorded with the information of the station name.
The subsidized site needs a site name, and for this purpose, the site name where the user may be located at the time may be determined based on the geographical location of the event after entering the site, which may specifically include:
acquiring the geographical position of an event after the arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to each user riding data based on the geographical position of the event after the station entering.
In this embodiment, the site name near the geographical location of the post-arrival event may be queried based on the information provided by the navigation map and then determined as the site name where the user riding data is located.
In one embodiment, an in-station event geographic location may obtain multiple site names for an attachment. In this regard, the determining the site name corresponding to each user riding data based on the post-arrival event geographic location includes:
Acquiring a site name within a preset radius of the geographical position of the event after entering the station;
calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the incoming event;
and determining the site name with the minimum distance as the site name corresponding to the user riding data of the event geographical position after the arrival.
In this way, by calculating the distance between each station and the post-arrival event geographical location, the station with the smallest distance is determined as the station name of the post-arrival event geographical location. Thus, the following tables 5 and 6 can be obtained on the basis of the above tables 3 and 4:
user ride data stored in other ride channels are shown in table 5 below:
TABLE 5
User ride data stored in the current ride channel is shown in table 6 below:
TABLE 6
After the site name corresponding to each user riding data in the sequencing result is determined, the real riding path of the user last time can be restored.
Based on the sorting results of the above tables 5 and 6 and the determined site names, and in combination with the schematic view of the travel path of the vehicle shown in fig. 3, the last travel path of the user can be restored: baoshan Dadao- > Changgang- > Beijing Lu- > park front- > Siemens- > Jiangnan West.
And finally, recommending the top-up site to the user according to the site name corresponding to each user riding data in the sequencing result by the current channel.
In an implementation manner, a site name corresponding to the user riding data with the latest time in the sorting result can be determined to be a top-up site recommended to the user.
In another implementation manner, site names corresponding to a preset number of user riding data with later time in the sequencing result can be recommended to the users; so that the user selects one from the recommended site names as the top-up site.
Taking the above tables 5 and 6 as an example, assuming that the site name of 3 is output in reverse rank, the most likely outbound site of the user is { user001: (front park, gate, jiang Naxi) }.
A schematic diagram of a subsidy site interface on a user terminal as shown in fig. 4. When a user uses the current riding channel code scanning and entering the station, the prompt information of the left diagram of fig. 4 is triggered to be displayed due to the fact that the user is found to be in a unilateral transaction (lack of an outbound station) last time. When the user clicks the 'complement site', triggering the embodiment of recommending the riding complement site to recommend the site name of the complement site to the user; and adjusts to the interface of the right hand view of fig. 4. The interface presents a top-up site (park front, gate Jiang Naxi) for user selection. The user can select one of the stations as a top-up station, so that top-up is completed, and the last riding cost is settled.
According to the scheme, through a multiparty safety ordering algorithm, under the condition that user riding data in a plurality of riding channels does not go out of a domain, the most likely outbound sites when the user takes the bus last time are determined based on the user riding data stored in each riding channel, and therefore the outbound sites are recommended to the user for the user to select the complement sites. Thus, not only can automatic site subsidy be realized, but also the risk of personal data leakage of users can be avoided because the user riding data of each riding channel does not go out of the domain.
Corresponding to the method embodiment of recommending the riding-up station, the specification also provides an embodiment of a device for recommending the riding-up station. The embodiment of the device can be implemented by software, or can be implemented by hardware or a combination of hardware and software. Taking a software implementation as an example, the device in a logic sense is formed by reading corresponding computer service program instructions in the nonvolatile memory into the memory by the processor of the device where the device is located for operation. In terms of hardware, as shown in fig. 5, a hardware structure diagram of a device where a device of a riding and boarding site is recommended in the present specification is shown in fig. 5, and in addition to the processor, the network interface, the memory and the nonvolatile memory shown in fig. 5, the device where the device is located in the embodiment generally includes other hardware according to the actual function of the recommended riding and boarding site, which is not repeated herein.
Referring to fig. 6, a block diagram of an apparatus for recommending a riding-complement site according to an embodiment of the present disclosure corresponds to the embodiment shown in fig. 1, and the apparatus includes:
a response unit 310, configured to query user boarding data stored in a current boarding channel and recorded in a previous boarding record of a user when the current boarding channel responds to an inbound request of the user and finds that the user needs to top up a last outbound site;
a ranking unit 320 that ranks, based on a multiparty secure ranking algorithm, the user boarding data of the last boarding record of the user stored in the other boarding channels and the user boarding data in the current boarding channel in time sequence; the multiparty safety ordering algorithm is used for determining ordering results between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data;
and a recommending unit 330, configured to recommend a top-up website to the user according to the website name corresponding to each user riding data in the sorting result.
Optionally, the sorting unit 320 includes:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
A splitting subunit for splitting the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit divides any riding channel into two parts of event time negation values after entering the station;
an exchange subunit for exchanging event time after any part of the two riding channels enter the station;
a summation subunit, for summing the event time after the arrival exchanged in each riding channel, and for summing the summation results of the two riding channels again;
a sorting subunit, if the re-summation result is negative, sorting the user riding data of the riding channel with the negation value before the user riding data of the other riding channel; and if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
Optionally, the sorting unit 320 includes:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
an encryption subunit, configured to perform order-preserving encryption on the post-arrival event time stored in the user riding data in the riding channels to obtain a post-arrival event time of the ciphertext;
And the sequencing subunit determines sequencing results between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the apparatus further includes:
the acquisition unit is used for acquiring the geographical position of the event after the arrival of the riding data of each user in the sequencing result;
and the determining unit is used for determining the site name corresponding to each user riding data based on the geographical position of the event after the arrival.
Optionally, the determining unit includes:
the acquisition subunit acquires the site name within a preset radius of the geographical position of the event after the arrival;
a calculating subunit for calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the incoming event;
and the determining subunit determines the site name with the smallest distance as the site name corresponding to the user riding data of the geographical position of the event after the arrival.
Optionally, the recommending unit 330 includes:
and determining the site name corresponding to the user riding data with the latest time in the sequencing result as the complement site to be recommended to the user.
Optionally, the recommending unit 330 includes:
recommending site names corresponding to a preset number of user riding data with later time in the sequencing result to the user; so that the user selects one from the recommended site names as the top-up site.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. A typical implementation device is a computer, which may be in the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or a combination of any of these devices.
The implementation process of the functions and roles of each unit in the above device is specifically shown in the implementation process of the corresponding steps in the above method, and will not be described herein again.
For the device embodiments, reference is made to the description of the method embodiments for the relevant points, since they essentially correspond to the method embodiments. The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purposes of the present description. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Fig. 6 above describes an internal functional module and a structural schematic of an apparatus for recommending a riding-complement site, and its substantial execution subject may be an electronic device, including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as the method embodiment of recommending a ride-on-boarding site shown in any one of the preceding claims.
In the above embodiment of the electronic device, it should be understood that the processor may be a central processing unit (english: central Processing Unit, abbreviated as CPU), or may be other general purpose processors, digital signal processors (english: digital Signal Processor, abbreviated as DSP), application specific integrated circuits (english: application Specific Integrated Circuit, abbreviated as ASIC), or the like. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc., and the aforementioned memory may be a read-only memory (ROM), a random access memory (random access memory, RAM), a flash memory, a hard disk, or a solid state disk. The steps of a method disclosed in connection with the embodiments of the present specification may be embodied directly in a hardware processor, or in a combination of hardware and software modules in a processor.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the electronic device embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference is made to the description of the method embodiments in part.
Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the examples disclosed herein. This specification is intended to cover any variations, uses, or adaptations of the specification following, in general, the principles of the specification and including such departures from the present disclosure as come within known or customary practice within the art to which the specification pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the specification being indicated by the following claims.
It is to be understood that the present description is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present description is limited only by the appended claims.

Claims (15)

1. A method of recommending a ride-complement site, the method comprising:
under the condition that a current riding channel responds to a user's inbound request to find that the user needs to complement a last outbound site, inquiring user riding data stored in the current riding channel and recorded in the last riding of the user;
the current riding channel sorts the user riding data of the last riding record of the user stored in other riding channels and the user riding data in the current riding channel according to time sequence based on a multiparty safety sorting algorithm; the multiparty safety ordering algorithm is used for determining an ordering result between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data, wherein the ordering result comprises an ordering sequence number of the user riding data of the current riding channel and an ordering sequence number of the user riding data of the other riding channels;
and recommending a top-up station to the user according to the station name corresponding to each user riding data in the sequencing result by the current riding channel.
2. The method of claim 1, the sorting the user occupancy data stored in the other occupancy channels for the last occupancy record of the user and the user occupancy data in the current occupancy channel in a time-sequential manner based on a multiparty safety sorting algorithm, comprising:
The current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
splitting post-arrival event time stored in user riding data in respective riding channels into two parts;
splitting any riding channel into two parts, namely calculating a negation value of event time after entering a station;
exchanging post-arrival event times for any portion of the two riding channels;
summing event time after entering stations exchanged in each riding channel, and summing the summation results of the two riding channels again;
if the re-summation result is negative, the user riding data of the riding channel with the negation value is arranged before the user riding data of the other riding channel;
and if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
3. The method of claim 1, the sorting the user occupancy data stored in the other occupancy channels for the last occupancy record of the user and the user occupancy data in the current occupancy channel in a time-sequential manner based on a multiparty safety sorting algorithm, comprising:
the current riding channels and other riding channels are combined in pairs, and the following treatment is carried out for each riding channel combined in pairs:
Performing order-preserving encryption on the post-arrival event time in the user riding data stored in the riding channels to obtain the post-arrival event time of the ciphertext;
and determining a sequencing result between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
4. The method of claim 1, the method further comprising:
acquiring the geographical position of an event after the arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to each user riding data based on the geographical position of the event after the station entering.
5. The method of claim 4, the determining a site name for each user ride data based on the post-arrival event geographic location, comprising:
acquiring a site name within a preset radius of the geographical position of the event after entering the station;
calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the event after entering the station;
and determining the site name with the minimum distance as the site name corresponding to the user riding data of the event geographical position after the arrival.
6. The method of claim 1, wherein recommending the top-up website to the user according to the website name corresponding to each user riding data in the sorting result comprises:
And determining the site name corresponding to the user riding data with the latest time in the sequencing result as the complement site to be recommended to the user.
7. The method of claim 1, wherein recommending the top-up station to the user according to the station name corresponding to each user riding data in the sorting result comprises:
recommending site names corresponding to a preset number of user riding data with later time in the sequencing result to the user; so that the user selects one from the recommended site names as the top-up site.
8. An apparatus for recommending a ride-complement site, the apparatus comprising:
the system comprises a response unit, a first-time bus taking unit and a second-time bus taking unit, wherein the response unit is used for inquiring user bus taking data of a last-time bus taking record of a user stored in a current bus taking channel under the condition that the current bus taking channel responds to an arrival request of the user and finds that the user needs to be complemented with a last-time outbound station;
the sequencing unit is used for sequencing the user riding data of the last riding record of the user stored in other riding channels and the user riding data in the current riding channel according to time sequence based on a multiparty safety sequencing algorithm; the multiparty safety ordering algorithm is used for determining an ordering result between the current riding channel and the user riding data of other riding channels under the condition that the other riding channels do not send the stored user riding data, wherein the ordering result comprises an ordering sequence number of the user riding data of the current riding channel and an ordering sequence number of the user riding data of the other riding channels;
And the recommending unit is used for recommending the top-up station to the user according to the station name corresponding to each user riding data in the sorting result by the current riding channel.
9. The apparatus of claim 8, the ranking unit comprising:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
a splitting subunit for splitting the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit divides any riding channel into two parts of event time negation values after entering the station;
an exchange subunit for exchanging event time after any part of the two riding channels enter the station;
a summation subunit, for summing the event time after the arrival exchanged in each riding channel, and for summing the summation results of the two riding channels again;
a sorting subunit, if the re-summation result is negative, sorting the user riding data of the riding channel with the negation value before the user riding data of the other riding channel; and if the re-summation result is positive, the user riding data of the riding channel with the negation value is arranged behind the user riding data of the other riding channel.
10. The apparatus of claim 8, the ranking unit comprising:
a processing subunit, which combines the current riding channel and other riding channels in pairs, and processes the riding channels of each pair of combinations by the following subunits:
an encryption subunit, configured to perform order-preserving encryption on the post-arrival event time stored in the user riding data in the riding channels to obtain a post-arrival event time of the ciphertext;
and the sequencing subunit determines sequencing results between the riding data of the users in the two riding channels according to the sizes of the event time after the ciphertext of the two riding channels enters the station.
11. The apparatus of claim 8, the apparatus further comprising:
the acquisition unit is used for acquiring the geographical position of the event after the arrival of the riding data of each user in the sequencing result;
and the determining unit is used for determining the site name corresponding to each user riding data based on the geographical position of the event after the arrival.
12. The apparatus of claim 11, the determining unit comprising:
the acquisition subunit acquires the site name within a preset radius of the geographical position of the event after the arrival;
a calculating subunit for calculating the distance between the geographic position of the station corresponding to the station name and the geographic position of the event after entering the station;
And the determining subunit determines the site name with the smallest distance as the site name corresponding to the user riding data of the geographical position of the event after the arrival.
13. The apparatus of claim 8, the recommendation unit comprising:
and determining the site name corresponding to the user riding data with the latest time in the sequencing result as the complement site to be recommended to the user.
14. The apparatus of claim 8, the recommendation unit comprising:
recommending site names corresponding to a preset number of user riding data with later time in the sequencing result to the user; so that the user selects one from the recommended site names as the top-up site.
15. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to the method of any of the preceding claims 1-7.
CN202310609426.6A 2020-05-09 2020-05-09 Method and device for recommending riding and repairing stations and electronic equipment Pending CN116720010A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310609426.6A CN116720010A (en) 2020-05-09 2020-05-09 Method and device for recommending riding and repairing stations and electronic equipment

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202310609426.6A CN116720010A (en) 2020-05-09 2020-05-09 Method and device for recommending riding and repairing stations and electronic equipment
CN202010390982.5A CN111291282B (en) 2020-05-09 2020-05-09 Method and device for recommending ride subsidy site and electronic equipment

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN202010390982.5A Division CN111291282B (en) 2020-05-09 2020-05-09 Method and device for recommending ride subsidy site and electronic equipment

Publications (1)

Publication Number Publication Date
CN116720010A true CN116720010A (en) 2023-09-08

Family

ID=71029576

Family Applications (2)

Application Number Title Priority Date Filing Date
CN202310609426.6A Pending CN116720010A (en) 2020-05-09 2020-05-09 Method and device for recommending riding and repairing stations and electronic equipment
CN202010390982.5A Active CN111291282B (en) 2020-05-09 2020-05-09 Method and device for recommending ride subsidy site and electronic equipment

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN202010390982.5A Active CN111291282B (en) 2020-05-09 2020-05-09 Method and device for recommending ride subsidy site and electronic equipment

Country Status (1)

Country Link
CN (2) CN116720010A (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111932229A (en) * 2020-03-13 2020-11-13 武汉小码联城科技有限公司 Subway bus code payment data processing method, device and system and electronic equipment
CN114282892B (en) * 2021-12-22 2023-05-02 成都智元汇信息技术股份有限公司 SDK (software development kit) based method, subway client and system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9536000B2 (en) * 2010-10-29 2017-01-03 Excalibur Ip, Llc Profile prediction for shared computers
CN108682054A (en) * 2018-07-27 2018-10-19 武汉市公用电子工程有限责任公司 It is a kind of that there is the vehicle-mounted consumption terminal device and method of IC card for recognizing function
CN110400177A (en) * 2019-07-26 2019-11-01 厦门卫星定位应用股份有限公司 Bus passenger trip information matching process, medium, equipment and device
CN110992037A (en) * 2020-03-03 2020-04-10 支付宝(杭州)信息技术有限公司 Risk prevention and control method, device and system based on multi-party security calculation

Also Published As

Publication number Publication date
CN111291282B (en) 2023-04-14
CN111291282A (en) 2020-06-16

Similar Documents

Publication Publication Date Title
US20200134758A1 (en) Systems and methods for secure communication
CN107341668B (en) Method and device for judging real data
CN108344417A (en) A kind of air navigation aid, navigation device method and mobile terminal
US8312104B2 (en) Interactive information dissemination and retrieval system and method for generating action items
CN110992037A (en) Risk prevention and control method, device and system based on multi-party security calculation
CN116720010A (en) Method and device for recommending riding and repairing stations and electronic equipment
CN111523968A (en) Order splicing method and equipment
CN105719173A (en) Order processing method and order processing device
CN109816330B (en) Rule checking method, device, electronic equipment and computer readable storage medium
CN104794890A (en) Method and equipment for acquiring number of vehicles capable of carrying passengers
US20120185299A1 (en) Household member number distribution estimation apparatus and household member number distribution estimation method
CN109561132B (en) Information pushing method and device, server and terminal
CN111176963A (en) Service evaluation information processing method and device
CN110288485B (en) Position-based screening method and device for auditing members
US20010019960A1 (en) Area-dependent service system and method for mobile stations
CN112129303A (en) Film viewing schedule arranging method, arranging system, storage medium and electronic equipment
CN107679383B (en) Identity verification method and device based on geographic position and touch area
WO2018152978A1 (en) Method and device for prompting change of account-bound telephone number and computer storage medium
CN111340575A (en) Resource pushing method and device and electronic equipment
JP2015075981A (en) Parking management device and parking management system
JP5738830B2 (en) Information distribution apparatus, information distribution method, and information distribution program
CN110134837A (en) A kind of approaches to IM and device
CN112362071B (en) Multi-destination route planning method, device and storage medium
GB2533904A (en) Authenticated tracking method and apparatus
JP2022003450A (en) Information processing device, information processing method, and information processing program

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