Vehicle information providing device
US-2017010116-A1 · Jan 12, 2017 · US
US10798219B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10798219-B2 |
| Application number | US-201615384942-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 20, 2016 |
| Priority date | Dec 22, 2015 |
| Publication date | Oct 6, 2020 |
| Grant date | Oct 6, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
There is provided a server or the like capable of improving an estimated accuracy of a user common among a plurality of clients. According to the present invention, while a unique identifier is assigned to each of clients 210 and 220 , the unique identifier is merely for identifying the client. Thus, a user of each of the clients 210 and 220 is not specified by the unique identifier, and protection of his or her privacy or personal information is ensured. Among factors of each client 210 and 220 , the plurality of factors having designated relationship thereamong are extracted. A plurality of unique identifiers respectively corresponding to the extracted factors are associated with one another and are stored in the server storage device 10.
Opening claim text (preview).
What is claimed is: 1. A server comprising: a processor; a memory comprising a program; and wherein the processor is configured to execute the program causing the server to perform a first server arithmetic process comprising assigning different unique identifiers for identifying each of a plurality of clients serving as mobile stations to each of the plurality of clients serving as mobile stations in response to a first use of a designated function or a designated application for detecting or setting a state in each of the plurality of clients, recognizing a combination of a factor relating to states set or detected in each of the plurality of clients and the unique identifier, and recognizing a first ending point state which is a target state set in a first client as an information terminal carried by a user, constituting the plurality of clients and a second ending point state serving as a state corresponding to the first ending point state detected in a second client, loaded into a vehicle moving according to a user's operation, constituting the plurality of clients, the second client being separate from the first client, as the factors which are determined whether or not having a designated relationship therebetween by a second server arithmetic process; and the second server arithmetic process comprising extracting, among the respective factors in the plurality of clients recognized by the first server arithmetic process, designated factors wherein the designated factors comprise the plurality of factors having the designated relationship thereamong, associating a plurality of unique identifiers, wherein the combination comprises the associated unique identifiers and the designated factors, storing the associated unique identifiers in the server storage device, evaluating a degree of approximation among the respective factors in the plurality of clients recognized by the first server arithmetic process, and wherein the designated relationship comprises the degree of approximation with the plurality of factors being a reference value or more, and providing, to the second client, a content or an application of an attribute of the first client which has the designated relationship with the second client. 2. The server according to claim 1 , wherein the second server arithmetic process further comprises extracting the plurality of factors with the degree of approximation being the reference value or more over a designated frequency or more as the plurality of factors having the designated relationship thereamong. 3. The server according to claim 1 , wherein the first server arithmetic process further comprises respectively recognizing a first starting point state which is a state detected in setting the first ending point state in the first client and a second starting point state which is a state, corresponding to the first starting point state and detected in the second client, as the factors which are determined whether or not having the designated relationship therebetween by the second server arithmetic process. 4. The server according to claim 3 , wherein the first server arithmetic process further comprises respectively recognizing a first starting point time corresponding to a set time of the first ending point state or a detection time of the first starting point state in the first client and a second starting point time corresponding to a detection time of the second starting point state in the second client as the factors which are determined whether or not having the designated relationship therebetween by the second server arithmetic process. 5. The server according to claim 4 , wherein the first server arithmetic process further comprises recognizing a time when a communication state with the second client in the first client has been released as a first ending point time. 6. The server according to claim 3 , wherein the first server arithmetic process further comprises recognizing a first starting point position as at least a apart of the first starting point state and a second starting point position as at least a part of the second starting point state as the factors, and the degree of approximation is defined so as to increase more continuously or intermittently as a geographic distance between the first starting point position and the second starting point position is shorter. 7. The server according to claim 1 , wherein the first server arithmetic process further comprises recognizing a first ending point time corresponding to a time when the first ending point state is implemented in the first client as the factor in the first client, and respectively recognizing a second ending point time corresponding to a detection time of the second ending point state in the second client as the factors which are determined whether or not having the designated relationship therebetween by the second server arithmetic process. 8. The server according to claim 3 , wherein the first server arithmetic process further comprises respectively recognizing a first starting point time corresponding to a set time of the first ending point state or a detection time of the first starting point state in the first client and a second ending point time corresponding to a detection time of the second ending point state in the second client as the factors, and the second server arithmetic process further comprises extracting the factor in the first client and the factor in the second client as the plurality of factors having the designation relationship therebetween when a deviation between the first starting point time and the second ending point time is in a designated range corresponding to a deviation between the first starting point state or the second starting point state and the first ending point state or the second ending point state. 9. The server according to claim 4 , wherein the first server arithmetic process further comprises recognizing a start up time of a moving body loaded with the second client as the second starting point time. 10. The server according to claim 7 , wherein the first server arithmetic process further comprises recognizing a stop operation time of the moving body loaded with the second client as the second ending point time. 11. The server according to claim 7 , wherein the first server arithmetic process further comprises recognizing a time when a communication state with the second client in the first client has been established as the first starting point time. 12. The server according to claim 8 , wherein the first server arithmetic process further comprises recognizing a time when a communication state with the second client in the first client has been released as a first ending point time. 13. The server according to claim 1 , wherein the first server arithmetic process further comprises respectively recognizing positions set or detected in the plurality of clients as the factors which are determined whether or not having the designated relationship therebetween by the second server arithmetic process. 14. The server according to claim 1 , wherein the first server arithmetic process further comprises providing, based on communication with at least one of the plurality of clients constituting a client group respectively assigned with the plurality of unique identifiers associated with one another and stored by the server storage device, an application or a content corresponding to at least one of the factor and the designated relationship to the at least one client. 15. A server client system including a server and a plurality of clients servi
from the vehicle, e.g. floating car data [FCD] · CPC title
specially adapted for the location of the user terminal · CPC title
where the complete route is transmitted to the vehicle at once · CPC title
for traffic information dissemination · CPC title
using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.