CN108738037B - Identification method and device - Google Patents
Identification method and device Download PDFInfo
- Publication number
- CN108738037B CN108738037B CN201710249527.1A CN201710249527A CN108738037B CN 108738037 B CN108738037 B CN 108738037B CN 201710249527 A CN201710249527 A CN 201710249527A CN 108738037 B CN108738037 B CN 108738037B
- Authority
- CN
- China
- Prior art keywords
- switching
- switching matrix
- preset
- user
- matrix
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/08—Reselecting an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides an identification method and an identification device, wherein the method comprises the following steps: acquiring switching information of a first user and switching information of a second user according to a preset period, and acquiring a preset switching point set, wherein the switching information is related information of switching a user from a source cell to a target cell, the preset switching point set comprises at least one preset switching point, and a road section corresponding to the preset switching point is only provided with one track; establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix; thereby improving the accuracy of identifying the user of the same vehicle.
Description
Technical Field
The present invention relates to the field of electronic communications technologies, and in particular, to an identification method and an identification apparatus.
Background
With the continuous development of communication technology, a large number of base stations are deployed along the track of each road section, so that users on high-speed moving trains (common trains, motor cars, high-speed rails and the like) can surf the internet by using mobile data; in the process of high-speed movement of the train, the terminal of the user can be switched from one cell to be connected with another cell, so that whether any two users are users of the same train number can be determined according to the cell to which the user is switched.
In the prior art, two users who are switched at the same switching point and have a time difference smaller than a certain threshold (for example, 15 seconds) are determined as the same-vehicle users; the same switching point means that the source cells to be switched are the same and the target cells to be switched are the same. The scheme can process normal users switched on the train, but for abnormal conditions such as midway getting off of the user and then getting on the next train or similar test users, the turning back condition occurs, or one train just enters the station and the other train just exits; because the switching points of two users belonging to different train numbers are the same, the identification method in the prior art can regard the users belonging to different train numbers as the users of the same train.
Disclosure of Invention
The technical problem to be solved by the embodiment of the invention is to provide an identification method to solve the problem of low accuracy rate of identifying the same-vehicle user in the prior art.
Correspondingly, the embodiment of the invention also provides an identification device, which is used for ensuring the realization and the application of the method.
In order to solve the above problems, the present invention discloses an identification method, which specifically includes: acquiring switching information of a first user and switching information of a second user according to a preset period, and acquiring a preset switching point set, wherein the switching information is related information of switching a user from a source cell to a target cell, the preset switching point set comprises at least one preset switching point, and a road section corresponding to the preset switching point is only provided with one track; establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; and identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix.
Optionally, the switching information includes a switching point and a corresponding switching time, and the step of establishing the first switching matrix of the first user according to the switching information of the first user and a preset switching point set includes: dividing a preset period into N time periods according to a preset time interval, and determining the number M of preset switching points in a preset switching point set, wherein N and M are positive integers greater than 0; creating a first switching matrix, wherein the first switching matrix is a matrix of M × N or a matrix of N × M; searching the corresponding switching times of each preset switching point in each time period from the switching information of the first user; and updating the first switching matrix by adopting the switching times according to the preset switching point and the time period.
Optionally, if the first switching matrix is an M × N matrix, performing sliding window processing on the first switching matrix to obtain a third switching matrix, including: creating a third switching matrix of M x N; sequentially carrying out sliding window processing on each line of the first switching matrix according to a preset step length; updating the third switching matrix by using elements after sliding window processing in the first switching matrix according to the preset switching points and the time periods; if the first switching matrix is an N x M matrix, performing sliding window processing on the first switching matrix to obtain a third switching matrix, wherein the step of performing sliding window processing on the first switching matrix comprises the following steps: creating a third switching matrix of N x M; sequentially carrying out sliding window processing on each column of the first switching matrix according to a preset step length; and updating the third switching matrix by adopting the elements after the sliding window processing in the first switching matrix according to the preset switching points and the time periods.
Optionally, before the step of identifying whether the first user and the second user are co-located users according to the third switching matrix and the fourth switching matrix, the method further includes: setting elements of the third switching matrix that are not 0 to 1, and setting elements of the fourth switching matrix that are not 0 to 1.
Optionally, the step of identifying whether the first user and the second user are the same-vehicle user according to the third switching matrix and the fourth switching matrix includes: multiplying the third switching matrix by the transpose of the fourth switching matrix to obtain a fifth switching matrix; calculating the number of elements which are not 0 on the diagonal of the fifth switching matrix; determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number; wherein the set value is the number of rows in the matrix other than 0 or the number of columns other than 0.
Optionally, the step of determining whether the first user and the second user are the same-vehicle user according to the set value of the first switching matrix, the set value of the second switching matrix, and the number includes: determining the minimum value of the number of rows not being 0 in the first switching matrix and the number of rows not being 0 in the second switching matrix, or determining the minimum value of the number of columns not being 0 in the first switching matrix and the number of columns not being 0 in the second switching matrix; if the ratio of the minimum value to the number is not less than the threshold value, determining that the first user and the second user are the same-vehicle users; and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
Optionally, the method further comprises: searching all preset cells on a preset line in advance, wherein the preset cell only has one track on a corresponding road section; sequentially determining two adjacent preset cells in the same direction of the line as a pair of source cells and a pair of target cells respectively, and determining each pair of the source cells and the target cells as preset switching points; and generating the preset switching point set by adopting each preset switching point.
The invention also provides an identification device, which specifically comprises: the system comprises an acquisition module and a processing module, wherein the acquisition module is used for acquiring switching information of a first user and switching information of a second user according to a preset period and acquiring a preset switching point set, the switching information is related information for switching a user from a source cell to a target cell, the preset switching point set comprises at least one preset switching point, and a road section corresponding to the preset switching point only has one track; the establishing module is used for establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; the processing module is used for performing sliding window processing on the first switching matrix to obtain a third switching matrix and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; and the identification module is used for identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix.
Optionally, the establishing module is specifically configured to divide a preset cycle into N time segments according to a preset time interval, and determine the number M of preset switching points in a preset switching point set, where N and M are positive integers greater than 0; creating a first switching matrix, wherein the first switching matrix is a matrix of M × N or a matrix of N × M; searching the corresponding switching times of each preset switching point in each time period from the switching information of the first user; and updating the first switching matrix by adopting the switching times according to the preset switching point and the time period.
Optionally, the processing module is specifically configured to create an M × N third switching matrix if the first switching matrix is an M × N matrix; sequentially carrying out sliding window processing on each line of the first switching matrix according to a preset step length; updating the third switching matrix by using elements after sliding window processing in the first switching matrix according to the preset switching points and the time periods; if the first switching matrix is an N-M matrix, creating an N-M third switching matrix; sequentially carrying out sliding window processing on each column of the first switching matrix according to a preset step length; and updating the third switching matrix by adopting the elements after the sliding window processing in the first switching matrix according to the preset switching points and the time periods.
Optionally, the method further comprises: a setting module, configured to set an element in the third switching matrix that is not 0 to 1, and set an element in the fourth switching matrix that is not 0 to 1.
Optionally, the identification module comprises:
the multiplication submodule is used for multiplying the third switching matrix and the transpose of the fourth switching matrix to obtain a fifth switching matrix;
a calculation submodule for calculating the number of elements on the diagonal of the fifth switching matrix that are not 0;
the determining submodule is used for determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number; wherein the set value is the number of rows in the matrix other than 0 or the number of columns other than 0.
Optionally, the determining sub-module is specifically configured to determine a minimum value between a number of rows in the first switching matrix that is not 0 and a number of rows in the second switching matrix that is not 0, or determine a minimum value between a number of columns in the first switching matrix that is not 0 and a number of columns in the second switching matrix that is not 0; if the ratio of the minimum value to the number is not less than the threshold value, determining that the first user and the second user are the same-vehicle users; and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
Optionally, the method further comprises: the system comprises a preset module, a control module and a control module, wherein the preset module is used for searching all preset cells on a preset line in advance, and the section corresponding to the preset cell is only provided with one track; sequentially determining two adjacent preset cells in the same direction of the line as a pair of source cells and a pair of target cells respectively, and determining each pair of the source cells and the target cells as preset switching points; and generating the preset switching point set by adopting each preset switching point.
Compared with the prior art, the embodiment of the invention has the following advantages:
the embodiment of the invention provides an identification method, which comprises the steps of obtaining switching information of a first user and switching information of a second user according to a preset period, and obtaining a preset switching point set, wherein the preset switching point set comprises at least one preset switching point; then, establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; and identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix. Because the road section corresponding to the preset switching point is only provided with one track, the condition that different vehicles have the same switching point is avoided; therefore, the third switching matrix and the fourth switching matrix are obtained according to the preset switching point set, and when the first user and the second user are identified to be the same-vehicle users, the users of two different vehicles cannot be identified to be the same-vehicle users, so that the accuracy of identifying the same-vehicle users is improved.
Drawings
FIG. 1 is a flow chart of the steps of an embodiment of an identification method of the present invention;
FIG. 2 is a flow chart of steps of another identification method embodiment of the present invention;
FIG. 3 is a block diagram of an embodiment of an identification device of the present invention;
fig. 4 is a block diagram of another embodiment of the identification device of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
One of the core concepts of the embodiment of the invention is that a switching matrix corresponding to a user is generated according to a preset switching point set and switching information of the user; the preset switching point set comprises preset switching points, and because only one track is arranged on a road section corresponding to the preset switching points in the preset switching point set, the condition that the switching points of two users of different vehicles are the same is avoided, and therefore whether the two users are the same vehicle user or not is identified according to a matrix processed by sliding windows of the two users; the users of two different vehicles can not be identified as the same-vehicle user, and the accuracy of the same-vehicle user identification is greatly improved.
Referring to fig. 1, a flowchart illustrating steps of an embodiment of an identification method of the present invention is shown, which may specifically include the following steps:
The identification method provided by the embodiment of the invention is applied to identification of the same-vehicle user; the user on the same train refers to a user with the same train number, and the train comprises various types of trains, such as a common train, a motor train, an inter-city train, a high-speed rail and the like. When a user on the train uses a mobile network to surf the internet in the running process of the train, the mobile terminal corresponding to the user is sequentially switched from one cell along the train to another cell; wherein one base station corresponds to at least one cell. Accordingly, the base station may record corresponding handover information for each user, where the handover information is related information for the user to handover from the source cell to the target cell, such as an identifier of the source cell, an identifier of the target cell, a handover time, and the like. The cell where the user is currently located is determined as a source cell, and another cell to be accessed is determined as a target cell. One of the important ideas of the embodiment of the invention is that a user in the same vehicle is identified according to a switching point of the user, wherein the switching point comprises a pair of a source cell and a target cell; therefore, the base station can identify the co-vehicle user by acquiring the switching information of the user. Specifically, in order to reduce the subsequent calculation amount of the switching matrix, after determining that the first user and the second user are users on the train in the running process of the train, the base station may obtain switching information of the first user and switching information of the second user according to a preset period, and obtain a preset switching point set; namely, the identification of the same-train user is performed once in each preset period, wherein the first user and the second user can be any user on the train. The driving routes and the driving time corresponding to different vehicle numbers are different, and the preset period can be set according to different vehicle numbers. The preset switching point set consists of preset switching points, a road section corresponding to the preset switching points is provided with only one track, and each preset switching point consists of a pair of source cells and a target cell; therefore, the situation that the switching points corresponding to the users of two different train numbers are the same does not occur. The preset switching point set can be set for one route, or can be set for a plurality of routes.
After the switching information of the user is obtained, a switching matrix corresponding to the user can be established according to the switching information, and then the user in the same vehicle is identified through processing the switching matrix. Specifically, a corresponding first switching matrix may be established for a first user according to switching information of the first user and preset switching point information. And meanwhile, establishing a corresponding second switching matrix for the second user according to the switching information of the second user and the preset switching information. In the embodiment of the present invention, the number of rows of the first switching matrix is equal to the number of rows of the second switching matrix, and the number of columns of the first switching matrix is equal to the number of columns of the second switching matrix; determining the number of rows of the first switching matrix according to the number of the preset switching points, and determining the number of columns of the first switching matrix according to the preset period; the number of rows of the first switching matrix can also be determined according to the preset period, and the number of columns of the first switching matrix can be determined according to the number of the preset switching points.
And 103, performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix.
And step 104, identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix.
In order to improve the accuracy of the user identification of the same vehicle, the embodiment of the invention can perform sliding window processing on the first switching matrix to obtain a third switching matrix; and meanwhile, performing sliding window processing on the second switching matrix to obtain a fourth switching matrix. The number of rows of the third switching matrix is equal to the number of rows of the fourth switching matrix, and the number of columns of the third switching matrix is equal to the number of columns of the fourth switching matrix. In an embodiment of the present invention, the first switching matrix and the second switching matrix may be respectively sliding-window processed by using a preset matrix, where the preset matrix may be a row vector, for example, a ═ 1, 1, 1, or a column vector, for example, a ═ 1, 1, 1 ^ T; the number of elements of the preset matrix and the numerical value of the elements can be set according to actual conditions. After the third switching matrix and the fourth switching matrix are determined, whether the first user and the second user are the same-vehicle user can be identified according to the third switching matrix and the fourth switching matrix. In an application of the present invention, a correlation between the third switching matrix and the fourth switching matrix may be calculated, and then a correlation between the first user and the second user is determined according to the correlation, so as to determine whether the first user and the second user are the same-vehicle user according to the correlation. If the first user and the second user are the same vehicle user, the first user and the second user can be added to the same group; if the first user and the second user are not the same-vehicle users, respectively searching the same-vehicle users of the first user and the same-vehicle users of the second user according to the steps, and accordingly respectively adding the first user and the second user to the corresponding groups; facilitating subsequent other operations based on the same-vehicle users, such as determining the passenger flow volume of the vehicle according to the number of the same-vehicle users, and the like. In addition, if the user a and the user B are co-located users, and the user C and the user B are co-located users, it is determined that the user C and the user a are co-located users.
The embodiment of the invention provides an identification method, which comprises the steps of obtaining switching information of a first user and switching information of a second user according to a preset period, and obtaining a preset switching point set, wherein the preset switching point set comprises at least one preset switching point; then, establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; and identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix. Because the road section corresponding to the preset switching point is only provided with one track, the condition that different vehicles have the same switching point is avoided; therefore, the third switching matrix and the fourth switching matrix are obtained according to the preset switching point set, and when the first user and the second user are identified to be the same-vehicle users, the users of two different vehicles cannot be identified to be the same-vehicle users, so that the accuracy of identifying the same-vehicle users is improved.
In another embodiment of the present invention, the steps of creating the preset switching point set, establishing the first switching matrix and the second switching matrix, the method of sliding window processing, and the specific steps of identifying the co-vehicle user according to the third switching matrix and the fourth switching matrix are described in detail.
Referring to FIG. 2, a flow chart of steps of another identification method embodiment of the present invention is shown; the method specifically comprises the following steps:
And 203, generating the preset switching point set by adopting each preset switching point.
In an embodiment of the invention, at least one line is included from an originating station to a destination station, such as: one line from Beijing to Shanghai is a high-speed rail line, one line is a common train line, and each line can comprise a plurality of road sections; wherein, the number of the tracks corresponding to each road section is at least one. Each line is correspondingly provided with a large number of base stations, namely each line is correspondingly provided with a large number of cells; when a certain road segment includes a plurality of tracks, signals of a part of cells corresponding to the road segment cover the plurality of tracks. When a plurality of trains in the same direction pass through at the same time, the corresponding switching points of the users on the plurality of trains are the same, and the switching time difference is small; in order to avoid such an abnormal situation, the embodiment of the present invention may pre-search cells having only one track in all signal covered road segments on the preset line, and determine these cells as preset cells; the preset line is a line needing to identify the same-vehicle user, and if the same-vehicle user wants to identify the high-speed rail from Beijing to Guangzhou, the preset line is the high-speed rail line from Beijing to Guangzhou. In general, when a user is handed over from a source cell to a target cell, the source cell and the target cell are adjacent; if the source cell and the target cell are not adjacent to each other, the user is switched to be abnormal; if A is adjacent to B, B is adjacent to C, and A is separated from C by B; therefore, when a user switches from a to C, it is determined that the user belongs to an abnormal switching. Therefore, two adjacent preset cells in the same direction of the line can be respectively determined as a pair of a source cell and a target cell, and one preset cell can be a source cell or a target cell; for example, the predetermined cells in the direction of beijing to guangzhou include A, B, C, D, E, F, G, H; the source and target cell pairs on the line are a-B, B-C, C-D, D-E, E-F, F-G, G-H. And then determining a pair of the source cell and the target cell as a preset switching point, and generating a preset switching point set by adopting each preset switching point. In one embodiment of the present invention, a corresponding preset switching point set may be set for one direction of one line; the same preset switching point set can also be set for two directions of one route; the same preset switching point set can also be set for a plurality of lines. Preferably, in order to reduce the number of rows and columns of the first switching matrix and the second switching matrix, a corresponding preset switching point set is set for one direction of one line.
Step 204, obtaining switching information of the first user and switching information of the second user according to a preset period, and obtaining a preset switching point set.
When the co-vehicle user is identified, the switching information of the first user and the switching information of the second user can be obtained according to a preset period, and a preset switching point set generated in advance is obtained; the preset switching point set is composed of at least one preset switching point. Preferably, in order to reduce the number of elements in the first switching matrix and the second switching matrix and improve the efficiency of identifying the co-vehicle user, the preset period is not too long, for example, the running time of the high-speed rail is 5 hours, and the preset period may be set to 1 hour.
Step 205, establishing a first switching matrix of the first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of the second user according to the switching information of the second user and the preset switching point set.
After the switching information and the preset switching point set are obtained, a corresponding first switching matrix can be generated for the first user and a corresponding second switching matrix can be generated for the second user respectively. Taking the generation of the first user as an example, the step of specifically generating the first switching matrix is described below, which specifically includes sub-steps S51-S54:
substep S51, dividing the preset period into N time segments according to a preset time interval, and determining the number M of preset switching points in the preset switching point set.
Sub-step S52, creating a first switching matrix, said first switching matrix being a matrix of M × N, or a matrix of N × M.
And a substep S53, searching the switching times of each preset switching point in each time period from the switching information of the first user.
And a substep S54 of updating the first switching matrix by using the switching times according to the preset switching point and the time period.
In the embodiment of the invention, the number of rows and columns of the first switching matrix is related to the preset period and the number of preset switching points; before creating the first switching matrix, dividing a preset period into N time periods according to a preset time interval, and determining the number M of preset switching points in a preset switching point set, where the preset time interval may be set according to an actual situation, for example, if a high-speed rail needs 15 seconds to reach a coverage area of another cell from one cell, the preset time interval may be set to 5 seconds. Also for example, if a normal train needs 30 seconds to reach the coverage area of another cell from one cell, the preset time interval is set to 10 seconds. Then, according to the time period N and the number M of the preset switching points, a first switching matrix is established; in an embodiment of the present invention, the first switching matrix may be an N × M matrix, or an M × N matrix. The first switching matrix initially created may be an empty matrix, or may be a matrix in which each element is an arbitrary value, which is not limited in the present invention. The embodiment of the invention adopts the switching times of the first user at each preset switching point to update the initially established first switching matrix; specifically, a preset switching point can be searched from the switching information of the first user, and the switching time corresponding to the preset switching point is searched; and determining the switching times corresponding to the preset switching points according to the current time, the preset period and the preset time interval. Wherein, in the switching information of the first user, all the preset switching points may not be found; the number of the preset switching points which are not found in the switching information of the first user is determined to be 0. The embodiment of the invention can represent the row of the first switching matrix by the time period, and the preset switching point represents the column of the first switching matrix; or representing the columns of the first switching matrix by adopting time periods, and representing the rows of the first switching matrix by presetting switching points; the switching times can be updated to the corresponding positions in the first switching matrix according to the preset switching points and the time periods; each element of the first switching matrix represents a number of switching times for a certain time period of a certain switching point. The arrangement sequence of each row and each column of the first switching matrix can be determined according to a preset switching point sequence and a time period sequence in a preset switching point set.
The generation manner of the second switching matrix is similar to that of the first switching matrix, and is not described herein again.
And step 206, performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix.
After the first switching matrix and the second switching matrix are generated, the sliding window processing may be performed on the first switching matrix and the second switching matrix, and the following steps of the sliding window processing are described by taking the first switching matrix as an example. The meaning of the row representation of the first switching matrix is different, and the corresponding sliding window processing methods are different; when each row of the first switching matrix represents the switching times of each time segment of a preset switching point, namely the first switching matrix is a matrix of M × N, performing substep S611; when each row of the first switching matrix represents the switching times of each preset switching point in a time period, that is, the first switching matrix is an N × M matrix, the sub-step S621 is performed.
In the sub-step S611, if the first switching matrix is an M × N matrix, an M × N third switching matrix is created.
And a substep S612, sequentially performing sliding window processing on each row of the first switching matrix according to a preset step length.
And a substep S613 of updating the third switching matrix by using the elements after the sliding window processing in the first switching matrix according to the preset switching point and the time period.
If the first switching matrix is an M N matrix, then an M N third switching matrix can be created; the positions of the elements of the third switching matrix and the first switching matrix are in one-to-one correspondence. Then, performing sliding window processing on the elements in the first switching matrix to obtain elements subjected to sliding window processing; so as to be dependent on the preset switching point and time period. And updating the third switching matrix by using the elements after the sliding window processing in the first switching matrix. Specifically, when performing the sliding window processing, the sliding window processing may be performed on each row of the first switching matrix line by line according to a preset step length. Wherein, the preset step length can be set as 1 according to the actual situation.
And a substep S621, if the first switching matrix is an N × M matrix, creating an N × M third switching matrix.
And a sub-step S622 of sequentially performing sliding window processing on each column of the first switching matrix according to a preset step size.
And a substep S623 of updating the third switching matrix by using the elements after the sliding window processing in the first switching matrix according to the preset switching point and the time period.
And if the first switching matrix is an N-M matrix, creating an N-M third switching matrix. The updating of the third switching matrix of N × M is similar to the above steps, and is not described herein again.
Similarly, the generation method of the fourth switching matrix is similar to the generation method of the third switching matrix, and is not described herein again.
Before the third switching matrix and the fourth switching matrix are calculated, setting elements which are not 0 in the third switching matrix as 1, and setting elements which are not 0 in the fourth switching matrix as 1; therefore, subsequent calculation is facilitated, and the efficiency of identifying the same-vehicle user is improved. Then, according to the third switching matrix and the fourth switching matrix, whether the first user and the second user are the same-vehicle user is judged, and the specific steps are as follows:
and step 208, multiplying the third switching matrix by the transpose of the fourth switching matrix to obtain a fifth switching matrix.
And 209, calculating the number of elements which are not 0 on the diagonal line of the fifth switching matrix.
And step 210, determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number.
According to the embodiment of the invention, whether the first user and the second user are the same-vehicle users can be determined by calculating the correlation between the third switching matrix and the fourth switching matrix; specifically, the step of obtaining the correlation is to multiply the third switching matrix and the fourth switching matrix to obtain a fifth switching matrix. If the third switching matrix and the fourth switching matrix are both M × N matrixes, the fifth matrix is an M × M square matrix; and if the third matrix and the fourth switching matrix are both N-M matrixes, the fifth matrix is an N-N square matrix. The number of elements on the diagonal of the fifth matrix other than 0 is then calculated, where the elements with the same row and column designation are referred to as diagonal elements of the matrix such as the first row, first column, the fifth row, fifth column, etc. And determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number. And the number of rows or columns of which the elements in the set value matrix are not 0. The method comprises the following specific steps:
substep S101 determines the minimum value between the number of rows in the first switching matrix that is not 0 and the number of rows in the second switching matrix that is not 0, or determines the minimum value between the number of columns in the first switching matrix that is not 0 and the number of columns in the second switching matrix that is not 0.
And a substep S102, if the ratio of the minimum value to the number is not less than a threshold value, determining that the first user and the second user are the same-vehicle users.
And a substep S103, if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
Determining the minimum value of the number of rows in the first switching matrix which are not 0 and the number of rows in the second switching matrix which are not 0, or determining the minimum value of the number of columns in the first switching matrix which are not 0 and the number of columns in the second switching matrix which are not 0. Then, the ratio of the number to the minimum value is calculated, and if the ratio of the minimum value to the number is not smaller than a threshold value, the first user and the second user are determined to be the same-vehicle users; and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user. Wherein, the threshold value can be set as 0.8 according to actual conditions. For example, the number of rows of the first switching matrix that is not 0 is 4, the number of rows of the second switching matrix that is not 0 is 3, the number of elements on the diagonal of the fifth switching matrix that are not 0 is 2, and if the threshold is 0.8; the first user and the second user are the same vehicle user.
The method and the device are implemented to set the corresponding preset switching point set for each line in advance, so that the number of the first switching matrix and the second switching matrix is reduced, and the efficiency of identifying the same user for each time is improved; when the first switching matrix and the second switching matrix are subjected to sliding window processing, the sliding window processing is performed row by row or column by column, so that the subsequent calculation of the third switching matrix and the fourth switching matrix is facilitated, and the calculation efficiency is improved; setting elements which are not 0 in the third switching matrix to be 1, and setting elements which are not 0 in the fourth switching matrix to be 1; because the elements in the third switching matrix and the fourth switching matrix are composed of 0 and 1, the calculation amount of transposition multiplication of the third switching matrix and the fourth switching matrix is greatly reduced, and the efficiency of identifying the same-vehicle user is further improved.
It should be noted that, for simplicity of description, the method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the illustrated order of acts, as some steps may occur in other orders or concurrently in accordance with the embodiments of the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.
Referring to fig. 3, a block diagram of a structure of an embodiment of an identification apparatus of the present invention is shown, which may specifically include the following modules: an acquisition module 301, a creation module 302, a processing module 303 and an identification module 304, wherein,
an obtaining module 301, configured to obtain switching information of a first user and switching information of a second user according to a preset period, and obtain a preset switching point set, where the switching information is related information for a user to switch from a source cell to a target cell, the preset switching point set includes at least one preset switching point, and a road segment corresponding to the preset switching point has only one track;
an establishing module 302, configured to establish a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establish a second switching matrix of a second user according to the switching information of the second user and the preset switching point set;
the processing module 303 is configured to perform sliding window processing on the first switching matrix to obtain a third switching matrix, and perform sliding window processing on the second switching matrix to obtain a fourth switching matrix;
an identifying module 304, configured to identify whether the first user and the second user are co-located users according to the third switching matrix and the fourth switching matrix.
In another embodiment of the present invention, the apparatus further comprises: a setup block 305 and a preset block 306, wherein,
a setting module 305, configured to set an element in the third switching matrix that is not 0 to 1, and set an element in the fourth switching matrix that is not 0 to 1.
The system comprises a preset module 306, a route searching module and a route searching module, wherein the preset module 306 is used for searching all preset cells on a preset route in advance, and the section corresponding to the preset cell is only provided with one track; sequentially determining two adjacent preset cells in the same direction of the line as a pair of source cells and a pair of target cells respectively, and determining each pair of the source cells and the target cells as preset switching points; and generating the preset switching point set by adopting each preset switching point.
In one embodiment of the present invention, the identification module 304 includes: a multiplication submodule 3041, a calculation submodule 3042, and a determination submodule 3043, wherein,
a multiplication submodule 3041, configured to multiply the third switching matrix by the transpose of the fourth switching matrix, so as to obtain a fifth switching matrix;
a calculation submodule 3042 for calculating the number of elements on the diagonal of the fifth switching matrix that are not 0;
a determining submodule 3043, configured to determine whether the first user and the second user are the same-vehicle users according to the set value of the first switching matrix, the set value of the second switching matrix, and the number; wherein the set value is the number of rows in the matrix other than 0 or the number of columns other than 0.
In another embodiment of the present invention, the determining submodule 3043 is specifically configured to determine a minimum value between a number of rows in the first switching matrix that is not 0 and a number of rows in the second switching matrix that is not 0, or determine a minimum value between a number of columns in the first switching matrix that is not 0 and a number of columns in the second switching matrix that is not 0; if the ratio of the minimum value to the number is not less than the threshold value, determining that the first user and the second user are the same-vehicle users; and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
The establishing module 302 is specifically configured to divide a preset period into N time periods according to a preset time interval, and determine the number M of preset switching points in a preset switching point set, where N and M are positive integers greater than 0; creating a first switching matrix, wherein the first switching matrix is a matrix of M × N or a matrix of N × M; searching the corresponding switching times of each preset switching point in each time period from the switching information of the first user; and updating the first switching matrix by adopting the switching times according to the preset switching point and the time period.
The processing module 303 is specifically configured to create an M × N third switching matrix if the first switching matrix is an M × N matrix; sequentially carrying out sliding window processing on each line of the first switching matrix according to a preset step length; updating the third switching matrix by using elements after sliding window processing in the first switching matrix according to the preset switching points and the time periods; if the first switching matrix is an N-M matrix, creating an N-M third switching matrix; sequentially carrying out sliding window processing on each column of the first switching matrix according to a preset step length; and updating the third switching matrix by adopting the elements after the sliding window processing in the first switching matrix according to the preset switching points and the time periods.
The embodiment of the invention provides an identification method, which comprises the steps of obtaining switching information of a first user and switching information of a second user according to a preset period, and obtaining a preset switching point set, wherein the preset switching point set comprises at least one preset switching point; then, establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix; and identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix. Because the road section corresponding to the preset switching point is only provided with one track, the condition that different vehicles have the same switching point is avoided; therefore, the third switching matrix and the fourth switching matrix are obtained according to the preset switching point set, and when the first user and the second user are identified to be the same-vehicle users, the users of two different vehicles cannot be identified to be the same-vehicle users, so that the accuracy of identifying the same-vehicle users is improved.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The above detailed description of the identification method and the identification apparatus provided by the present invention, and the specific examples applied herein have been provided to explain the principles and embodiments of the present invention, and the above descriptions of the embodiments are only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (12)
1. An identification method, comprising:
acquiring switching information of a first user and switching information of a second user according to a preset period, and acquiring a preset switching point set, wherein the switching information is related information of switching a user from a source cell to a target cell, the preset switching point set comprises at least one preset switching point, and a road section corresponding to the preset switching point is only provided with one track;
establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; wherein the number of rows of the first switching matrix is equal to the number of rows of the second switching matrix, and the number of columns of the first switching matrix is equal to the number of columns of the second switching matrix;
performing sliding window processing on the first switching matrix to obtain a third switching matrix, and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix;
identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix;
the step of identifying whether the first user and the second user are the same-vehicle user or not according to the third switching matrix and the fourth switching matrix comprises the following steps:
multiplying the third switching matrix by the transpose of the fourth switching matrix to obtain a fifth switching matrix;
calculating the number of elements which are not 0 on the diagonal of the fifth switching matrix;
determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number;
wherein the set value is the number of rows in the matrix other than 0 or the number of columns other than 0.
2. The method of claim 1, wherein the handover information comprises handover points and corresponding handover times, and the step of establishing the first handover matrix for the first user according to the handover information of the first user and a preset handover point set comprises:
dividing a preset period into N time periods according to a preset time interval, and determining the number M of preset switching points in a preset switching point set, wherein N and M are positive integers greater than 0;
creating a first switching matrix, wherein the first switching matrix is a matrix of M × N or a matrix of N × M;
searching the corresponding switching times of each preset switching point in each time period from the switching information of the first user;
and updating the first switching matrix by adopting the switching times according to the preset switching point and the time period.
3. The method of claim 2,
if the first switching matrix is an M x N matrix, performing sliding window processing on the first switching matrix to obtain a third switching matrix, wherein the step of performing sliding window processing on the first switching matrix comprises the following steps:
creating a third switching matrix of M x N;
sequentially carrying out sliding window processing on each line of the first switching matrix according to a preset step length;
updating the third switching matrix by using elements after sliding window processing in the first switching matrix according to the preset switching points and the time periods;
if the first switching matrix is an N x M matrix, performing sliding window processing on the first switching matrix to obtain a third switching matrix, wherein the step of performing sliding window processing on the first switching matrix comprises the following steps:
creating a third switching matrix of N x M;
sequentially carrying out sliding window processing on each column of the first switching matrix according to a preset step length;
and updating the third switching matrix by adopting the elements after the sliding window processing in the first switching matrix according to the preset switching points and the time periods.
4. The method of claim 1, further comprising, prior to the step of identifying whether the first user and the second user are co-located users based on the third switching matrix and the fourth switching matrix:
setting elements of the third switching matrix that are not 0 to 1, and setting elements of the fourth switching matrix that are not 0 to 1.
5. The method of claim 1, wherein the step of determining whether the first user and the second user are co-located users based on the set values of the first switching matrix, the set values of the second switching matrix, and the number comprises:
determining the minimum value of the number of rows not being 0 in the first switching matrix and the number of rows not being 0 in the second switching matrix, or determining the minimum value of the number of columns not being 0 in the first switching matrix and the number of columns not being 0 in the second switching matrix;
if the ratio of the minimum value to the number is not less than the threshold value, determining that the first user and the second user are the same-vehicle users;
and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
6. The method of claim 1, further comprising:
searching all preset cells on a preset line in advance, wherein the preset cell only has one track on a corresponding road section;
sequentially determining two adjacent preset cells in the same direction of the line as a pair of source cells and a pair of target cells respectively, and determining each pair of the source cells and the target cells as preset switching points;
and generating the preset switching point set by adopting each preset switching point.
7. An identification device, comprising:
the system comprises an acquisition module and a processing module, wherein the acquisition module is used for acquiring switching information of a first user and switching information of a second user according to a preset period and acquiring a preset switching point set, the switching information is related information for switching a user from a source cell to a target cell, the preset switching point set comprises at least one preset switching point, and a road section corresponding to the preset switching point only has one track;
the establishing module is used for establishing a first switching matrix of a first user according to the switching information of the first user and a preset switching point set, and establishing a second switching matrix of a second user according to the switching information of the second user and the preset switching point set; wherein the number of rows of the first switching matrix is equal to the number of rows of the second switching matrix, and the number of columns of the first switching matrix is equal to the number of columns of the second switching matrix;
the processing module is used for performing sliding window processing on the first switching matrix to obtain a third switching matrix and performing sliding window processing on the second switching matrix to obtain a fourth switching matrix;
the identification module is used for identifying whether the first user and the second user are the same-vehicle users or not according to the third switching matrix and the fourth switching matrix;
wherein the identification module comprises:
the multiplication submodule is used for multiplying the third switching matrix and the transpose of the fourth switching matrix to obtain a fifth switching matrix;
a calculation submodule for calculating the number of elements on the diagonal of the fifth switching matrix that are not 0;
the determining submodule is used for determining whether the first user and the second user are the same-vehicle users or not according to the set value of the first switching matrix, the set value of the second switching matrix and the number; wherein the set value is the number of rows in the matrix other than 0 or the number of columns other than 0.
8. The apparatus of claim 7,
the establishing module is specifically configured to divide a preset period into N time periods according to a preset time interval, and determine the number M of preset switching points in a preset switching point set, where N and M are positive integers greater than 0; creating a first switching matrix, wherein the first switching matrix is a matrix of M × N or a matrix of N × M; searching the corresponding switching times of each preset switching point in each time period from the switching information of the first user; and updating the first switching matrix by adopting the switching times according to the preset switching point and the time period.
9. The apparatus of claim 8,
the processing module is specifically configured to create an M × N third switching matrix if the first switching matrix is an M × N matrix; sequentially carrying out sliding window processing on each line of the first switching matrix according to a preset step length; updating the third switching matrix by using elements after sliding window processing in the first switching matrix according to the preset switching points and the time periods; if the first switching matrix is an N-M matrix, creating an N-M third switching matrix; sequentially carrying out sliding window processing on each column of the first switching matrix according to a preset step length; and updating the third switching matrix by adopting the elements after the sliding window processing in the first switching matrix according to the preset switching points and the time periods.
10. The apparatus of claim 7, further comprising:
a setting module, configured to set an element in the third switching matrix that is not 0 to 1, and set an element in the fourth switching matrix that is not 0 to 1.
11. The apparatus of claim 7,
the determining submodule is specifically configured to determine a minimum value between a row number that is not 0 in the first switching matrix and a row number that is not 0 in the second switching matrix, or determine a minimum value between a column number that is not 0 in the first switching matrix and a column number that is not 0 in the second switching matrix; if the ratio of the minimum value to the number is not less than the threshold value, determining that the first user and the second user are the same-vehicle users; and if the ratio of the minimum value to the number is smaller than a threshold value, determining that the first user and the second user are not the same vehicle user.
12. The apparatus of claim 7, further comprising:
the system comprises a preset module, a control module and a control module, wherein the preset module is used for searching all preset cells on a preset line in advance, and the section corresponding to the preset cell is only provided with one track; sequentially determining two adjacent preset cells in the same direction of the line as a pair of source cells and a pair of target cells respectively, and determining each pair of the source cells and the target cells as preset switching points; and generating the preset switching point set by adopting each preset switching point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710249527.1A CN108738037B (en) | 2017-04-17 | 2017-04-17 | Identification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710249527.1A CN108738037B (en) | 2017-04-17 | 2017-04-17 | Identification method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108738037A CN108738037A (en) | 2018-11-02 |
| CN108738037B true CN108738037B (en) | 2021-07-30 |
Family
ID=63924929
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710249527.1A Active CN108738037B (en) | 2017-04-17 | 2017-04-17 | Identification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108738037B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327854B (en) * | 2018-11-15 | 2022-05-31 | 中国联合网络通信集团有限公司 | Track user identification method and device |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3964616B2 (en) * | 2000-11-10 | 2007-08-22 | 株式会社エヌ・ティ・ティ・ドコモ | Incoming request transmission apparatus, incoming request transmission method, and mobile communication network |
| US8089947B2 (en) * | 2007-08-31 | 2012-01-03 | Intel Corporation | Spatial reuse in directional antenna systems |
| WO2014054170A1 (en) * | 2012-10-05 | 2014-04-10 | 三菱電機株式会社 | Automotive wireless communication apparatus and wireless device |
| CN103531036B (en) * | 2012-12-17 | 2015-06-03 | Tcl康钛汽车信息服务（深圳）有限公司 | Method and system for actively searching drivers with similar driving route |
| CN103241268B (en) * | 2013-05-07 | 2015-06-03 | 东南大学 | Subway departure time optimizing method for reducing transfer time of tunnel transfer stations |
| US9979789B2 (en) * | 2013-07-27 | 2018-05-22 | Michael Lu | Open wireless architecture (OWA) unified airborne and terrestrial communications architecture |
| CN104270461B (en) * | 2014-10-20 | 2017-05-10 | 常熟理工学院 | Car network implementation method |
| US9558848B2 (en) * | 2014-11-04 | 2017-01-31 | Microsoft Technology Licensing, Llc | Testing storage device power circuitry |
| CN105096634B (en) * | 2015-07-10 | 2017-11-24 | 合肥工业大学 | A kind of intelligent barrier system for being suitable for highway |
| CN105188027A (en) * | 2015-08-12 | 2015-12-23 | 小米科技有限责任公司 | Nearby user searching method and device |
| CN106488478B (en) * | 2015-09-01 | 2020-09-01 | 大唐电信科技产业控股有限公司 | Vehicle terminal, road side equipment and communication method thereof |
| CN105584502B (en) * | 2016-02-02 | 2021-08-17 | 潘艳 | Urban traffic system and method |
| CN106332196B (en) * | 2016-08-26 | 2020-01-24 | 新华三技术有限公司 | Data communication method and device |
| CN106533525A (en) * | 2016-11-30 | 2017-03-22 | 北京全路通信信号研究设计院集团有限公司 | Rail transit broadband mobile communication system and method |
-
2017
- 2017-04-17 CN CN201710249527.1A patent/CN108738037B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN108738037A (en) | 2018-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102840864B (en) | A kind of method and apparatus being realized location navigation by Quick Response Code | |
| CN112307978B (en) | Target detection method and device, electronic equipment and readable storage medium | |
| CN105096639A (en) | Method, device and system used for predicting bus arrival time | |
| CN107545763A (en) | A kind of vehicle positioning method, terminal, server and system | |
| CN108738037B (en) | Identification method and device | |
| CN104915855B (en) | The predictor method and device of order competition for orders rate | |
| Greengard | Automotive systems get smarter | |
| CN104613974A (en) | Navigation time acquisition method and system, navigation method and device | |
| DE69925297D1 (en) | METHOD FOR CELL RE-SELECTION IN A CELLULAR NETWORK, AND CORRESPONDING NETWORK PART AND SUBSCRIBER DEVICE | |
| CN111310828A (en) | Target detection model fine-tuning method and device for ADAS scene | |
| CN108877276B (en) | Method and device for rapidly predicting bus running time and computer terminal | |
| CN110556014B (en) | Intelligent bus dispatching platform system | |
| CN108260149B (en) | Method and device for determining position of high-speed rail UE | |
| CN111565362A (en) | Voice reminding method, shared vehicle and computer readable storage medium | |
| CN105429144A (en) | Information processing method and information processing device for emergency repairing of distribution network | |
| CN115359662B (en) | Lane congestion prediction method and device | |
| CN115218912B (en) | Navigation duration prediction method, navigation duration prediction device, vehicle and navigation duration prediction equipment | |
| CN108536542A (en) | Position monitoring method and device | |
| CN105183766A (en) | Method and system for eliminating historical route redundant points of maps | |
| CN106604328A (en) | MECC area switching method and system thereof | |
| CN101976262A (en) | Station integration method and equipment | |
| CN110444038B (en) | Bus scheduling method based on big data | |
| CN103900585A (en) | Interest point planning method and apparatus | |
| CN113642807B (en) | Population mobility prediction method and related device | |
| CN103902691B (en) | System and method for utilizing Internet to quickly inquire traveling time |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |