CN111291282A - Method and device for recommending ride subsidy site and electronic equipment - Google Patents

Method and device for recommending ride subsidy site and electronic equipment Download PDF

Info

Publication number
CN111291282A
CN111291282A CN202010390982.5A CN202010390982A CN111291282A CN 111291282 A CN111291282 A CN 111291282A CN 202010390982 A CN202010390982 A CN 202010390982A CN 111291282 A CN111291282 A CN 111291282A
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.)
Granted
Application number
CN202010390982.5A
Other languages
Chinese (zh)
Other versions
CN111291282B (en
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
Priority to CN202010390982.5A priority patent/CN111291282B/en
Publication of CN111291282A publication Critical patent/CN111291282A/en
Application granted granted Critical
Publication of CN111291282B publication Critical patent/CN111291282B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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—Information and communication technology [ICT] specially adapted for implementation of business processes of 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Educational Administration (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Primary Health Care (AREA)
  • Marketing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The specification provides a method and a device for recommending a ride subsidy site and electronic equipment. The method comprises the following steps: when the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station for the last time, inquiring user riding data which are stored in the current riding channel and recorded by the user taking the bus for the last time; based on a multi-party safety sorting algorithm, sorting the user riding data recorded by the last riding of the user in other riding channels and the user riding data in the current riding channel according to the time sequence; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data; and recommending a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result. The data of the user in the bus can not be out of the domain in the multi-party safe sorting process, so that the privacy of the user is protected.

Description

Method and device for recommending ride subsidy site 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 a ride subsidy site and electronic equipment.
Background
As mobile payment is applied to a riding scenario, a user may use a mobile terminal to sweep a code to ride a public transportation. The operating company and the payment company of the public transport means settle the fare of the user. Generally, the one-time bus fare of the user can be calculated according to the station scanned with codes when the user enters and leaves the station to determine the path from the starting point to the terminal point.
However, there may be some special situations (such as network abnormality) in which the outbound site is not recorded during outbound, thereby causing a problem that the fare is not normally settled although the person is already outbound.
When the user swipes the mobile phone at the next arrival, the user is prompted to manually and additionally register the last departure station, and the process is called subway additional station.
Disclosure of Invention
The embodiment of the specification provides a method and a device for recommending a vehicle taking subsidy site and electronic equipment.
According to a first aspect of embodiments herein, there is provided a method of recommending a ride subsidy site, the method comprising:
under the condition that the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station last time, user riding data which are stored in the current riding channel and recorded by the user taking a bus last time are inquired;
based on a multi-party safety sorting algorithm, sorting the user riding data recorded by the last riding of the user in other riding channels and the user riding data in the current riding channel according to a time sequence; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
and recommending a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
Optionally, the sorting, based on the multi-party safety sorting algorithm, the user riding data stored in the other riding channel according to the time sequence, where the user last riding record is recorded, and the user riding data in the current riding channel, includes:
combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
splitting event time after arrival stored in user riding data in respective riding channels into two parts;
dividing any riding channel into two parts of event time negation values after arrival;
exchanging event time after arrival of any part of the two riding channels;
summing the event time after arrival exchanged in each riding channel, and summing the summation results of the two riding channels again;
if the result of the summation is negative, arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel;
and if the result of the summation is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
Optionally, the sorting, based on the multi-party safety sorting algorithm, the user riding data stored in the other riding channel according to the time sequence, where the user last riding record is recorded, and the user riding data in the current riding channel, includes:
combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
carrying out order preserving encryption on event time after arrival in user riding data stored in respective riding channels to obtain event time after arrival of a ciphertext;
and determining a sequencing result between the riding data of the users in the two riding channels according to the magnitude of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the method further includes:
acquiring the geographical position of the event after arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to the riding data of each user based on the geographical position of the event after the arrival.
Optionally, the determining a site name corresponding to the riding data of each user based on the geographical location of the event after the arrival includes:
acquiring the site name within a preset radius of the event geographic position after the arrival;
calculating the distance between the geographical position of the station corresponding to the station name and the geographical position of the inbound event;
and determining the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
Optionally, the recommending a subsidy site to the user according to the site name corresponding to each user riding data in the ranking result includes:
and determining the site name corresponding to the latest user riding data in the sequencing result as a subsidy site and recommending the subsidy site to the user.
Optionally, the recommending a subsidy site to the user according to the site name corresponding to each user riding data in the ranking result includes:
recommending site names corresponding to the preset number of user riding data with later time in the sequencing result to the users; so that the user selects one from the recommended site names as a subsidized site.
According to a second aspect of embodiments herein, there is provided an apparatus for recommending a ride subsidy site, the apparatus comprising:
the response unit is used for inquiring user riding data of the last riding record of the user, which is stored in the current riding channel, under the condition that the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station for the last time;
the sequencing unit is used for sequencing the user riding data recorded by the user on the last riding in other riding channels and the user riding data in the current riding channel according to the time sequence based on a multi-party safety sequencing algorithm; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
and the recommending unit recommends a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
Optionally, the sorting unit includes:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the splitting subunit splits the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit splits any riding channel into two parts of event time negation values after arrival;
the switching subunit is used for switching the event time after arrival of any part of the two riding channels;
the summation subunit is used for summing the event time after arrival exchanged in each riding channel and summing the summation results of the two riding channels again;
the sequencing subunit is used for arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel if the result of the summation is negative; and if the result of the summation is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
Optionally, the sorting unit includes:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the encryption subunit is used for carrying out order-preserving encryption on the event time after arrival in the user riding data stored in the respective riding channels to obtain the event time after arrival of the ciphertext;
and the sequencing subunit determines a sequencing result between the riding data of the users in the two riding channels according to the magnitude of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the apparatus further comprises:
the acquisition unit is used for acquiring the geographical position of the event after 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 the riding data of each user based on the geographical position of the event after the arrival.
Optionally, the determining unit includes:
the acquisition subunit acquires the site names within the preset radius of the event geographic position after the arrival;
the calculating subunit calculates the distance between the geographical position of the station corresponding to the station name and the geographical position of the arrival event;
and the determining subunit determines the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
Optionally, the recommending unit includes:
and determining the site name corresponding to the latest user riding data in the sequencing result as a subsidy site and recommending the subsidy site to the user.
Optionally, the recommending unit includes:
recommending site names corresponding to the preset number of user riding data with later time in the sequencing result to the users; so that the user selects one from the recommended site names as a subsidized site.
According to a third aspect of embodiments herein, there is provided an electronic apparatus including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as any one of the above methods of recommending a ride subsidy site.
The embodiment of the specification provides a scheme for recommending ride-on sites, and the most probable outbound sites of a user during last ride are determined based on user ride data stored in each ride channel under the condition that the user ride data in a plurality of ride channels cannot be out of range through a multi-party safety sorting algorithm, so that the outbound sites are recommended to the user for the user to select the ride-on sites. Therefore, automatic site registration can be realized, and the risk of personal data leakage of the user can be avoided because the riding data of the user in each riding channel can not be out of the domain.
Drawings
Fig. 1 is a flowchart of a method for recommending a ride subsidy site according to an embodiment of the present disclosure;
FIG. 2 is a diagram of a multi-party security rank calculation process provided by an embodiment of the present specification;
fig. 3 is a schematic diagram of the real last riding path of the user restored from the riding data of the user shown in tables 1 to 6 provided in the present specification;
FIG. 4 is a schematic diagram of a subsidy site interface on a user terminal provided by an embodiment of the present disclosure;
fig. 5 is a hardware configuration diagram of an apparatus for recommending a vehicle taking subsidy site according to an embodiment of the present disclosure;
fig. 6 is a block diagram of an apparatus for recommending a vehicle taking subsidy site according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below do not represent all implementations consistent with this specification. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the specification, as detailed in the appended claims.
The terminology used in the description 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 and all possible combinations of one or more of the associated listed items. Plural in this context may refer to two or more.
It should be understood that although the terms first, second, third, etc. may be used herein 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 specification. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
As mentioned above, with the popularization of code scanning riding of the mobile terminal, the time for queuing and ticket buying is greatly saved, and the travel of people is facilitated. In order to take care of different passengers, public transport means public companies cooperate with different third-party platforms to open various riding channels capable of opening riding codes for the third-party platforms. For example, a riding applet in the payment software, a riding applet in the instant messaging software, a riding APP of a public transport service provider and the like can generate riding codes so as to realize code scanning and station entering.
However, since different riding channels are generally independent, companies of all riding channels do not disclose the riding data of the user as a core asset to the outside, and the riding data of the user as personal data of the user is related to privacy and is not convenient for being out of the domain. This leads to data islanding, giving individual users the option to create unilateral transactions (only incoming, no outgoing) to evade a ticket. These unilateral transactions can not be settled normally due to lack of a site, which may cause loss of the public transportation operation company.
Although site subsidizing can be performed when the user next enters the station, the site of the subsidized exit is completely the manual income of the user, and the user can completely select the exit site with the lowest expense as the site of the subsidized exit.
Therefore, it is desirable to provide a method for determining the last most likely departure site for a user to assist in completing a ride-on site.
In order to solve the above problems, the present specification provides a scheme for recommending a ride compensation site, which aims to restore an actual ride path of a user according to user ride data recorded when the user last rides in a multi-party ride channel, and determine a most possible last departure site of the user according to the actual ride path to help complete the ride compensation site. Therefore, the unilateral trading proportion can be reduced, and the loss of the public transport operation company is reduced.
In addition, by utilizing a multi-party safety sequencing algorithm, under the condition that the user riding data recorded when the user last rides in the riding channel of each party cannot be out of the domain, the actual riding path of the user is restored. Therefore, the data taken by the user can not be out of the domain, and the risk of personal data leakage of the user does not exist, so that the privacy of the user is guaranteed.
The public transport means can be facilities such as an entrance gate and an exit gate arranged on a subway, a bus, a city light rail, a train and the like, and can realize a public transport scene of a bus for scanning a yard.
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 corresponding to the riding channel, a server cluster, or a cloud platform constructed by the server cluster; the method may comprise the steps of:
step 210: under the condition that the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station last time, user riding data which are stored in the current riding channel and recorded by the user taking a bus last time are inquired;
step 210: based on a multi-party safety sorting algorithm, sorting the user riding data recorded by the last riding of the user in other riding channels and the user riding data in the current riding channel according to a time sequence; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
step 230: and recommending a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
The embodiment of the specification is applied between at least two riding channels. The bus taking channel used by the user when the user enters the station currently, and other bus taking channels not used by the user. When a plurality of riding channels are installed on a mobile terminal of a user, the number of current riding channels is 1, and the number of other riding channels except the current riding channel is 1 or more. That is, the current riding channel described in this embodiment is 1, and other riding channels may be 1 or multiple. Where a plurality includes 2 or more than 2. Generally speaking, the more riding channels, the more comprehensive the user riding data can be obtained, the more accurate the restored user riding path, and the more accurate the final recommended subsidy site.
In practical application, the riding data of the user is recorded and stored in a standardized data format. The composition of the user ride 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 event after arrival, and event geographic location after arrival.
The user identification refers to information which can uniquely correspond to a user and is used for determining the riding data generated by which user. The user identification may be, for example, a user account, a user ID, a user phone number, and the like. This specification is not intended to be limiting.
The arrival time refers to the time when a user scans a code to arrive at the station, and is used for determining the starting time of a one-time riding journey. The arrival time may be recorded in the form of a time stamp, or may be recorded in the form of a year, month, day, hour, minute and second. This specification is not intended to be limiting.
The event time after the arrival refers to the time when the user executes the relevant event through the channel after the group time. The post-arrival event time is typically recorded in the same manner as the aforementioned arrival time.
The event refers to various service functions provided by a channel where the event is located, such as connecting wifi in a station (e.g., wifi in a subway station), browsing news, watching videos, and using a network phone.
The practical event is combined for explanation, and after a user enters a station, the user can acquire a public wifi password in the station through a channel to connect wifi. The operation of obtaining the wifi password triggers an event, and the operation of inputting the wifi password to connect the wifi successfully triggers another event. For another example, assuming that the channel also provides news sections, the user can browse the news after entering the station, and each time the user clicks on one news, an event is triggered. In this specification, only the time of the event after the arrival and the geographical position of the event after the arrival are obtained, and what is specifically not important.
The event geographic position after the arrival refers to position data recorded when a user executes a related event 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 geographical Location may be generally referred to as LBS (Location Based Services) data. The event geographic location after the arrival can be recorded in the form of latitude and longitude coordinates.
As shown in the foregoing description, the user riding data in this specification includes two parts, one part is user riding data stored in a current riding channel, and the other part is user riding data stored in another riding channel.
The ride data of the user stored in the other ride channels is shown in the following table 1:
Figure 844034DEST_PATH_IMAGE001
the user riding data stored in the current riding channel is shown in the following table 2:
Figure 70616DEST_PATH_IMAGE002
the user riding data in the tables 1 and 2 are respectively stored in the local server corresponding to the riding channels. Since 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. Since the user riding data also includes the arrival time, the user riding data after the last arrival time can be determined as the user riding data recorded on the last riding of the user based on the latest arrival time.
Inquiring user riding data shown in the table 2 in the current riding channel; after other riding channels inquire the riding data of the user shown in the table 1; the current ride channel may safely rank tables 1 and 2 in chronological order (i.e., in post-inbound event time) based on a multi-party safety ranking algorithm. Determining the chronological sequence of the user riding data under the condition that the user riding data is out of the domain; and then restoring the last riding path of the user based on the time sequence and the station corresponding to the riding data of each user.
In this specification, the multi-party secure sorting algorithm is an algorithm for realizing sorting under the condition that data is not out of a domain. Specifically, under the condition that other riding channels do not send stored user riding data, a sequencing result between the local user riding data and the user riding data of other riding channels is obtained in the current riding channel, wherein the sequencing result is a sequencing serial number and does not relate to any user riding data.
In an embodiment, the step 220 may specifically include:
step A1: combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
step A2: splitting event time after arrival stored in user riding data in respective riding channels into two parts;
step A3: dividing any riding channel into two parts of event time negation values after arrival;
step A4: exchanging event time after arrival of any part of the two riding channels;
step A5: summing the event time after arrival exchanged in each riding channel, and summing the summation results of the two riding channels again;
step A6: if the result of the summation is negative, arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel; or if the summation result is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
Referring now to FIG. 2, a schematic diagram of a multiparty safety ranking calculation process is shown, which is described by way of example for two riding channels and reduces event time after arrival to a numerical value for ease of understanding. As shown in fig. 2, the event time after arrival in the user riding data of the first riding channel is 10; and the event time after the user enters the station in the riding data of the second riding channel is 15.
Firstly, the event time after arrival stored in the riding data of the user in each riding channel is divided into two parts. In fig. 2, the post-arrival event time 10 of the first ride channel is split into 3 and 7; the post-arrival event time 15 of the second ride channel is split into 5 and 10. Note that the event time after arrival is still stored in the bus channel and is not out of the domain, and the splitting can be completed by the respective bus channels. However, the trusted third party may also agree to perform this if negotiations are passed between the various ride channels. For example, a local executive provided by a trusted third party splits the post-inbound event time locally at each ride channel. Or the local post-inbound event time can be provided for the trusted third party to be split. The data of the user taking the bus can be prevented from being tampered by cheating of a bus taking channel through the splitting of the credible third party. Wherein the splitting may be a random splitting.
And then, dividing any riding channel into two parts of event time negation values after arrival. In fig. 2, event time after arrival 5 and event time after arrival 10 after the second riding channel is split are negated to obtain event time after arrival-5 and-10.
Then, the post-arrival event times for either portion of the two ride channels are exchanged. In fig. 2, the event time after arrival 3 split by the first bus channel is exchanged with the event time after arrival-10 split by the second bus channel.
And finally, summing the event time after arrival after exchange in the respective riding channels, and summing the summation results of the two riding channels again. In fig. 2, the post-inbound event times after the first ride channel swap include 7 and-10, and the summation result is-3; the event time after arrival after the second bus channel exchange comprises 3 and-5, and the summation result is-2. And summing the summation result-3 of the first riding channel and the summation result-2 of the second riding channel again, wherein the summation result of the summation is-5.
And since the result of the summation is negative again, the ride data of the user in the ride channel with the negated value is arranged before the ride data of the user in another ride channel. Namely, the user riding data of the second riding channel is arranged before the user riding data of the first riding channel.
It is worth mentioning that, since the post-arrival event time 15 of the second bus channel is greater than the post-arrival event time 10 of the first bus channel, it is true that the post-arrival event time 15 is before the post-arrival event time 10, and it can be seen that the above-mentioned multiparty safety ranking is correct. In addition, no matter how the split and the exchange are carried out, the final sorting result is not influenced actually, namely, the result of the multi-party safe sorting is unique.
Through the multi-party safety sequencing calculation, the user riding data exchanged among the riding channels is the event time after arrival, and the event time after arrival is only the event time after the split of the latter part. Because, even if this exchanged user ride data is leaked, complete user ride data cannot be deduced. Therefore, the multi-party safety sorting has higher data safety, and ensures that personal data of the user is not leaked.
Another multiparty secure sorting scheme is also provided in this specification, and specifically, the step 220 may include:
step B1: combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
step B2: carrying out order preserving encryption on event time after arrival in user riding data stored in respective riding channels to obtain event time after arrival of a ciphertext;
step B3: and determining a sequencing result between the riding data of the users in the two riding channels according to the magnitude 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 OPE (Order-Preserving Encryption) algorithm.
By adopting the order-preserving encrypted multi-party safe sequencing, although the riding data of the user in the riding channel can be out of range, the encrypted ciphertext riding data of the user is out of range, so that even leakage is leakage of the ciphertext, but not leakage of the plaintext riding data of the user. Therefore, the user ride data in the clear can still be considered as out-of-range. Through multi-party security sorting of order-preserving encryption, higher data security is ensured, and personal data of a user is prevented from being leaked.
After learning the multi-party secure sorting, the sorting result of the step 220 is shown in the rank fields in tables 3 and 4 below:
the ride data for the user stored in the other ride channels is shown in table 3 below:
Figure 594132DEST_PATH_IMAGE003
the user riding data stored in the current riding channel is shown in the following table 4:
Figure 400414DEST_PATH_IMAGE004
after the ranking result between the user riding data of the current riding channel and other riding channels is calculated based on the multi-party safety ranking algorithm, the site name corresponding to each user riding data also needs to be determined.
The user riding data is recorded when the user uses the service function provided by the riding channel after entering the station, and the user is not necessarily located at the station when the user riding data is recorded, and is probably a road section between the two stations. Therefore, the user riding data does not actually record information of the station name.
The registering of the site requires a site name, and therefore, the name of the site where the user may be located at that time may be determined based on the geographical location of the event after the entering of the site, which may specifically include:
acquiring the geographical position of the event after arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to the riding data of each user based on the geographical position of the event after the arrival.
In this embodiment, the name of the site near the geographic location of the event after the arrival may be queried based on information provided by the navigation map, and then determined as the name of the site where the data taken by the user is located.
In one embodiment, one post-inbound event geo-location may obtain multiple site names for the attachment. In this regard, the determining a site name corresponding to the riding data of each user based on the post-arrival event geographic location includes:
acquiring the site name within a preset radius of the event geographic position after the arrival;
calculating the distance between the geographical position of the station corresponding to the station name and the geographical position of the inbound event;
and determining the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
In this way, the station with the smallest distance is determined as the station name of the post-arrival event geographic position by calculating the distance between each station and the post-arrival event geographic position. Thus, on the basis of the above tables 3 and 4, the following tables 5 and 6 can be obtained:
the ride data for the user stored in the other ride channels is shown in table 5 below:
Figure 575044DEST_PATH_IMAGE005
the user riding data stored in the current riding channel is shown in the following table 6:
Figure 441369DEST_PATH_IMAGE006
after the station name corresponding to the riding data of each user in the sequencing result is determined, the real riding path of the user at the last time can be restored.
Based on the sorting results of the above tables 5 and 6 and the determined station names, and in combination with the schematic diagram of the vehicle travel path shown in fig. 3, the last riding path of the user can be restored: baogang Dadao- > Changgang- > Beijing Lou- > park front- > Ximen kou- > Jiangnan.
And finally, the current channel can recommend a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
In an implementation manner, the site name corresponding to the latest user riding data in the sorting result may be determined as a subsidy site and 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 a subsidized site.
Taking the above tables 5 and 6 as examples, assuming that the output is the station name of rank front 3 in reverse order, the most likely outbound station of the user is { user001 (front of park, west door, south and west) }.
Fig. 4 is a schematic diagram of a subsidized site interface on a user terminal. When a user uses the current bus channel to scan codes to enter the station, the prompt message of the left image of fig. 4 is triggered and displayed as the fact that the last bus of the user is unilateral transaction (lack of the station of leaving the station) is found. When the user clicks the 'subsidy site', triggering the embodiment of recommending the riding subsidy site to recommend the site name of the subsidy site to the user; and adjusts to the interface of the right drawing of figure 4. The interface shows the subsidy sites (in front of the park, at the west door, in the south and the west of the river) for the user to select. The user can select one as a subsidy site to complete the subsidy and settle the last riding fee.
The embodiment of the specification provides a scheme for recommending ride-on sites, and the most probable outbound sites of a user during last ride are determined based on user ride data stored in each ride channel under the condition that the user ride data in a plurality of ride channels cannot be out of range through a multi-party safety sorting algorithm, so that the outbound sites are recommended to the user for the user to select the ride-on sites. Therefore, automatic site registration can be realized, and the risk of personal data leakage of the user can be avoided because the riding data of the user in each riding channel can not be out of the domain.
Corresponding to the method embodiment for recommending the vehicle taking subsidy site, the specification also provides an embodiment of a device for recommending the vehicle taking subsidy site. The device embodiments may be implemented by software, or by hardware, or by a combination of hardware and software. The software implementation is taken as an example, and as a logical device, the device is formed by reading corresponding computer business program instructions in the nonvolatile memory into the memory for operation through the processor of the device in which the device is located. In terms of hardware, as shown in fig. 5, a hardware structure diagram of a device where a bus repair site is recommended in this specification is shown, except for 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 may also include other hardware according to the actual function of the recommended bus repair site, which is not described again.
Referring to fig. 6, a block diagram of an apparatus for recommending a vehicle pick-up site according to an embodiment of the present disclosure is shown, where the apparatus corresponds to the embodiment shown in fig. 1, and the apparatus includes:
the response unit 310 is configured to, when the current riding channel responds to the station entering request of the user and finds that the user needs to patch the last station leaving station, query user riding data, stored in the current riding channel, of the last riding record of the user;
the sorting unit 320 sorts the user riding data recorded by the last riding of the user in other riding channels and the user riding data in the current riding channel according to the time sequence based on a multi-party safety sorting algorithm; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
and the recommending unit 330 is configured to recommend a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
Optionally, the sorting unit 320 includes:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the splitting subunit splits the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit splits any riding channel into two parts of event time negation values after arrival;
the switching subunit is used for switching the event time after arrival of any part of the two riding channels;
the summation subunit is used for summing the event time after arrival exchanged in each riding channel and summing the summation results of the two riding channels again;
the sequencing subunit is used for arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel if the result of the summation is negative; and if the result of the summation is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
Optionally, the sorting unit 320 includes:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the encryption subunit is used for carrying out order-preserving encryption on the event time after arrival in the user riding data stored in the respective riding channels to obtain the event time after arrival of the ciphertext;
and the sequencing subunit determines a sequencing result between the riding data of the users in the two riding channels according to the magnitude of the event time after the ciphertext of the two riding channels enters the station.
Optionally, the apparatus further comprises:
the acquisition unit is used for acquiring the geographical position of the event after 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 the riding data of each user based on the geographical position of the event after the arrival.
Optionally, the determining unit includes:
the acquisition subunit acquires the site names within the preset radius of the event geographic position after the arrival;
the calculating subunit calculates the distance between the geographical position of the station corresponding to the station name and the geographical position of the arrival event;
and the determining subunit determines the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
Optionally, the recommending unit 330 includes:
and determining the site name corresponding to the latest user riding data in the sequencing result as a subsidy site and recommending the subsidy site to the user.
Optionally, the recommending unit 330 includes:
recommending site names corresponding to the preset number of user riding data with later time in the sequencing result to the users; so that the user selects one from the recommended site names as a subsidized site.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution in the specification. One of ordinary skill in the art can understand and implement it without inventive effort.
Fig. 6 above describes the internal functional modules and the structural schematic of the device for recommending a ride subsidy site, and the implementation subject of the device can be an electronic device, which includes:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as any one of the aforementioned embodiments of a method of recommending a ride subsidy site.
In the above embodiments of the electronic device, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor, and the aforementioned memory may be a read-only memory (ROM), a 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 the hardware and software modules of the processor.
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 embodiment of the electronic device, since it is substantially similar to the embodiment of the method, the description is simple, and for the relevant points, reference may be made to part of the description of the embodiment of the method.
Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the embodiments 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 will be understood that the present description is not limited to the precise arrangements described above and shown in the drawings, 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 subsidy site, the method comprising:
under the condition that the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station last time, user riding data which are stored in the current riding channel and recorded by the user taking a bus last time are inquired;
based on a multi-party safety sorting algorithm, sorting the user riding data recorded by the last riding of the user in other riding channels and the user riding data in the current riding channel according to a time sequence; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
and recommending a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
2. The method of claim 1, wherein the ranking of the user riding data stored in the other riding channels in the last riding record of the user and the user riding data in the current riding channel according to the multi-party safety ranking algorithm comprises:
combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
splitting event time after arrival stored in user riding data in respective riding channels into two parts;
dividing any riding channel into two parts of event time negation values after arrival;
exchanging event time after arrival of any part of the two riding channels;
summing the event time after arrival exchanged in each riding channel, and summing the summation results of the two riding channels again;
if the result of the summation is negative, arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel;
and if the result of the summation is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
3. The method of claim 1, wherein the ranking of the user riding data stored in the other riding channels in the last riding record of the user and the user riding data in the current riding channel according to the multi-party safety ranking algorithm comprises:
combining the current riding channel and other riding channels in pairs, and aiming at each riding channel combined in pairs, processing as follows:
carrying out order preserving encryption on event time after arrival in user riding data stored in respective riding channels to obtain event time after arrival of a ciphertext;
and determining a sequencing result between the riding data of the users in the two riding channels according to the magnitude of the event time after the ciphertext of the two riding channels enters the station.
4. The method of claim 1, further comprising:
acquiring the geographical position of the event after arrival of the riding data of each user in the sequencing result;
and determining the site name corresponding to the riding data of each user based on the geographical position of the event after the arrival.
5. The method of claim 4, wherein determining a site name corresponding to each user ride data based on the post-inbound event geographic location comprises:
acquiring the site name within a preset radius of the event geographic position after the arrival;
calculating the distance between the geographical position of the station corresponding to the station name and the geographical position of the inbound event;
and determining the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
6. The method according to claim 1, wherein recommending a subsidy site to the user according to the site name corresponding to each user riding data in the sequencing result comprises:
and determining the site name corresponding to the latest user riding data in the sequencing result as a subsidy site and recommending the subsidy site to the user.
7. The method according to claim 1, wherein recommending a subsidy site to the user according to the site name corresponding to each user riding data in the sequencing result comprises:
recommending site names corresponding to the preset number of user riding data with later time in the sequencing result to the users; so that the user selects one from the recommended site names as a subsidized site.
8. An apparatus for recommending a ride subsidy site, the apparatus comprising:
the response unit is used for inquiring user riding data of the last riding record of the user, which is stored in the current riding channel, under the condition that the current riding channel responds to the station entering request of the user and finds that the user needs to patch the station which is out of the station for the last time;
the sequencing unit is used for sequencing the user riding data recorded by the user on the last riding in other riding channels and the user riding data in the current riding channel according to the time sequence based on a multi-party safety sequencing algorithm; the multi-party safety ordering algorithm is used for determining an ordering result between the user riding data of the current riding channel and the user riding data of other riding channels under the condition that other riding channels do not send the stored user riding data;
and the recommending unit recommends a subsidy site to the user according to the site name corresponding to the riding data of each user in the sequencing result.
9. The apparatus of claim 8, the ordering unit, comprising:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the splitting subunit splits the post-arrival event time stored in the user riding data in the respective riding channels into two parts;
the negation subunit splits any riding channel into two parts of event time negation values after arrival;
the switching subunit is used for switching the event time after arrival of any part of the two riding channels;
the summation subunit is used for summing the event time after arrival exchanged in each riding channel and summing the summation results of the two riding channels again;
the sequencing subunit is used for arranging the ride data of the user in the ride channel with the negated value before the ride data of the user in another ride channel if the result of the summation is negative; and if the result of the summation is positive again, arranging the ride data of the user in the ride channel with the negated value behind the ride data of the user in another ride channel.
10. The apparatus of claim 8, the ordering unit, comprising:
the processing subunit combines the current riding channel and other riding channels in pairs, and processes the current riding channel and other riding channels in pairs through the following subunits according to each riding channel combined in pairs:
the encryption subunit is used for carrying out order-preserving encryption on the event time after arrival in the user riding data stored in the respective riding channels to obtain the event time after arrival of the ciphertext;
and the sequencing subunit determines a sequencing result between the riding data of the users in the two riding channels according to the magnitude 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 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 the riding data of each user based on the geographical position of the event after the arrival.
12. The apparatus of claim 11, the determination unit, comprising:
the acquisition subunit acquires the site names within the preset radius of the event geographic position after the arrival;
the calculating subunit calculates the distance between the geographical position of the station corresponding to the station name and the geographical position of the arrival event;
and the determining subunit determines the station name with the minimum distance as the station name corresponding to the user riding data of the event geographic position after the arrival.
13. The apparatus of claim 8, the recommendation unit, comprising:
and determining the site name corresponding to the latest user riding data in the sequencing result as a subsidy site and recommending the subsidy site to the user.
14. The apparatus of claim 8, the recommendation unit, comprising:
recommending site names corresponding to the preset number of user riding data with later time in the sequencing result to the users; so that the user selects one from the recommended site names as a subsidized site.
15. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as the method of any of the preceding claims 1-7.
CN202010390982.5A 2020-05-09 2020-05-09 Method and device for recommending ride subsidy site and electronic equipment Active CN111291282B (en)

Priority Applications (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

Applications Claiming Priority (1)

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

Related Child Applications (1)

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

Publications (2)

Publication Number Publication Date
CN111291282A true CN111291282A (en) 2020-06-16
CN111291282B CN111291282B (en) 2023-04-14

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 Before (1)

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

Country Status (1)

Country Link
CN (2) CN116720010A (en)

Cited By (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
CN114282892A (en) * 2021-12-22 2022-04-05 成都智元汇信息技术股份有限公司 SDK (software development kit) -based method, subway client and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120109956A1 (en) * 2010-10-29 2012-05-03 Yahoo! Inc. 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

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120109956A1 (en) * 2010-10-29 2012-05-03 Yahoo! Inc. 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

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
程超: "两个安全多方计算基础问题的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Cited By (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
CN114282892A (en) * 2021-12-22 2022-04-05 成都智元汇信息技术股份有限公司 SDK (software development kit) -based method, subway client and system

Also Published As

Publication number Publication date
CN116720010A (en) 2023-09-08
CN111291282B (en) 2023-04-14

Similar Documents

Publication Publication Date Title
US20230394585A1 (en) Automatic Claim Generation
US9185101B2 (en) User authentication based on historical user behavior
CN100365385C (en) Method and apparatus for providing location information
US20050181803A1 (en) System for combining geographic location information, database-derived affinity matches, and user control in order to permit individuals to rendezvous
CN102082881B (en) For the method and system of real-time caller position, brief introduction and trusting relationship
TW202011307A (en) Boarding billing method and apparatus
US20120060226A1 (en) Method for authorizing use of augmented reality (ar) information and apparatus
US8312104B2 (en) Interactive information dissemination and retrieval system and method for generating action items
CN111291282B (en) Method and device for recommending ride subsidy site and electronic equipment
US8837685B2 (en) Adaptive system with call center and trusted network
CN110992037A (en) Risk prevention and control method, device and system based on multi-party security calculation
EP2473967A2 (en) Geographical location authentication method for mobile voting
CA2371898A1 (en) Incident reporting system and method
CN111368221A (en) Information providing method, information acquiring method, device, server and storage medium
CN108769044B (en) Sign-in verification method and system based on reverse addresses
US20170061533A1 (en) Method and device for security assessment
US9088653B2 (en) Adaptive system with call center and trusted network
CN107705576A (en) Vehicle fake-license detection method, server and storage medium
US9794409B2 (en) Adaptive system with call center and trusted network
CN113449986A (en) Service distribution method, device, server and storage medium
US9832605B1 (en) Location based services for exigent circumstances
US20170345113A1 (en) Ride trading availability using vehicle telematics
JP5738830B2 (en) Information distribution apparatus, information distribution method, and information distribution program
JP2022026967A (en) Contribution authority application device, contribution authority application method and contribution authority application program
CN111431918A (en) Method and system for determining state label of target user based on block chain

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
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40029456

Country of ref document: HK

GR01 Patent grant
GR01 Patent grant