The disclosed subject matter relates to transportation analytics and, more particularly, to employing mobile devices as data sources for transportation analytics.
Conventional sources of location information for mobile devices are based on a wide variety of location determination technologies, such as global positioning system (GPS) technology, triangulation, multilateration, etc. These sources of data have provided the opportunity to capture location information for a device and share it with another device, which can allow non-location enabled devices to participate, at some level, in location-centric services. In contrast to conventional systems that rely on technologies such as GPS, triangulation, multilateration, etc., the use of timed fingerprint location (TFL) technology can provide advantages over the conventional technologies. For example, GPS is well known to be energy intensive and to suffer from signal confusion in areas with interference between the satellite constellation and the GPS enabled device. Further, GPS is simply not available on many mobile devices, especially where the devices are cost sensitive. Multilateration and triangulation technologies are computationally intensive, which can result in processing time issues and a corresponding level of energy consumption.
The above-described deficiencies of conventional mobile device location data sources for transportation analytics is merely intended to provide an overview of some of problems of current technology, and are not intended to be exhaustive. Other problems with the state of the art, and corresponding benefits of some of the various non-limiting embodiments described herein, may become further apparent upon review of the following detailed description.
The presently disclosed subject matter illustrates sharing timed fingerprint location (TFL) information. Sharing can allow devices to employ TFL information from a TFL source device. As an example, a laptop without a GPS receiver can receive shared TFL information from a TFL-enabled cell phone, i.e., the TFL-enabled cell phone can be the TFL source device. Based on the shared TFL information, the laptop can determine where it is located, with some accepted level of error. This determined location, based on TFL information from a TFL source device, can enable location-centric features for the laptop. These location-centric features might not otherwise have been enabled. As a second example, a GPS enabled tablet computer can be located in a building and therefore have poor reception of GPS signals thereby limiting the ability of the tablet computer to determine its location. Shared TFL information can facilitate the laptop determining its location.
TFL information can include location information or timing information. Further, such information can be accessed from active state or idle state user equipment. As such, TFL information component can facilitate access to location information or timing information for a mobile device or user equipment (UE) in an active or idle state. TFL information can be information from systems in a timed fingerprint location wireless environment, such as a TFL component of a wireless telecommunications carrier. As a non-limiting example, UEs, including mobile devices not equipped with a GPS-type system, can be associated with TFL information, which can facilitate determining a location for a UE based on the timing information associated with the UE.
In an aspect, TFL information can include information to determine a differential value for a NodeB site pair and a bin grid frame. A centroid region (possible locations between any site pair) for an observed time value associated with any NodeB site pair (NBSP) can be calculated and is related to the determined value (in units of chip) from any pair of NodeBs. When UE time data is accessed, a value look-up can be initiated (e.g., a lookup for “DV(?,X)” as disclosed in more detail in the application incorporated herein by reference). Relevant NBSPs can be prioritized as part of the look-up. Further, the relevant pairs can be employed as an index to lookup a first primary set. As an example, time data for a UE can be accessed in relation to a locating event in a TFL wireless carrier environment. In this example, it can be determined that a NBSP, with a first reference frame, be used for primary set lookup with the computed DV(?,X) value as the index. This can for example return a set of bin grid frame locations forming a hyperbola between the NodeBs of the NBSP. A second lookup can then be performed for an additional relevant NBSP, with a second reference frame, using the same value DV(?,X), as an index into the data set. Continuing the example, the returned set for the look up with second NBSP can return a second set of bin grid frames. Thus, the UE is likely located in both sets of bin grid frames. Therefore, where the UE is likely in both sets, it is probable that the location for the UE is at an intersection of the two sets. Additional NBSPs can be included to further narrow the possible locations of the UE by providing additional intersections among relevant bin grid sets. As such, employing TFL information for location determination is demonstrably different from conventional location determination techniques or systems such as GPS, eGPS, triangulation or multilateration in wireless carrier environments, near field techniques, or proximity sensors.
Moreover, whereas TFL can be operable in a wide array of current and legacy devices without any substantial dependence on GPS technologies, a greater number of mobile devices can act as TFL source devices than would be expected for GPS-enabled devices at the current time. A greater number of data sources is generally considered desirable in facilitating access to location information. Further, where TFL information can be employed in a lookup of location data sets, TFL can be much less computationally intense than triangulation or multilateration technologies. Reduced computational load is generally desirable in UE devices. TFL can piggyback on timing signals employed in wireless telecommunications, which systems are already deployed. A reduced need to rollout of additional hardware is generally considered desirable. Additionally, by piggybacking on existing timing signals and by reducing the computational load, TFL can be associated with minimal additional energy expenditure in sharp contrast to GPS or triangulation/multilateration technologies. Reduced energy expenditure is generally related to reduced battery drain in mobile devices and is typically a highly desirable trait.
Various embodiments relate to sharing TFL information between user equipment. In one example embodiment, a system comprises a location component that receives timed fingerprint location information. The exemplary system further comprises an access component that determines a level of access to the TFL information. This level of access can be associated with a request for access to the TFL information. A TFL information interface component can facilitate access to the TFL information based on the determined level of access.
In another example embodiment, a system comprises an antenna component adapted for short-range communications. The system further comprises an information interface to facilitate communications related to sharing TFL information. A request to share TFL information can result in receiving shared TFL information. The received shared TFL information can be stored in a memory component of the exemplary system.
In a further embodiment, a method comprises receiving TFL information for a UE. The example method further comprises receiving a request to share the TFL information. Access to the TFL information can be allowed in response to the request to share the TFL information.
In another example embodiment, a method comprises generating a request to share TFL information. The request can result in a receiving a portion of the TFL information.
The subject disclosure is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the subject disclosure. It may be evident, however, that the subject disclosure may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the subject disclosure.
TFLIC 110 can be communicatively coupled with timed fingerprint location access authorization component (TFL-AAC) 120, hereinafter TFL-AAC or AAC. AAC 120 can determine a level of TFL information access based on a request for access to TFL information. A request for access to TFL information can be received by a TFL source device. The request for access to TFL information can be generated by a device seeking to access TFL information from a TFL source device. As an example, a GPS-enabled cellphone can generate a request to access TFL information from a TFL-enabled cellphone. The TFL-enabled cell phone can receive the request for access to TFL information. AAC 120, in this example, can determine that access to the TFL information of the TFL-enabled cell phone can be accessed by the GPS-enabled cell phone.
In an aspect, different levels of TFL information access can be associated with accessing different sets of TFL information, different amounts of TFL information, different types of TFL information, etc. As an example, a limited access to TFL information can be associated with accessing only a single TFL timing measurement in contrast to an unlimited access to TFL information that can be associated with accessing many TFL timing measurements. As a second example, a limited access to TFL information can be associated with accessing TFL timing measurement in contrast to an unlimited access to TFL information that can be associated with accessing location information derived from TFL measurements. As a third example, a limited access to TFL information can be associated with accessing instant TFL timing measurements in contrast to an unlimited access to TFL information that can be associated with accessing historical TFL timing measurements. It is to be noted that any other form of limiting access to TFL information falls within the scope of the present disclosure even where not explicitly recited herein for brevity and clarity.
AAC 120 can be communicatively coupled with timed fingerprint location information interface component (TFL-IIC) 130, hereinafter TFL-IIC or IIC. IIC 130 can facilitate interaction between a TFL source device and other devices. In an embodiment, IIC 130 can facilitate receiving a request for access to TFL information. As an example, IIC 130 can receive a request for TFL information at a TFL enabled cellphone from an automobile navigation system. In another embodiment, IIC 130 can provide information about a TFL source device to other devices. As an example, IIC 130 can generate a beacon indicating that a TFL source device is accepting requests for TFL information. This exemplary beacon can allow listening devices to begin requesting TFL information from the associated TFL source device by way of system 100.
In an aspect, once the request for TFL information has been processed and a level of access determined, the TFL information can be accordingly accessed. The accessed TFL information can be employed to determine a location. This determined location will inherently have some level of error. The error can be associated with the error present in the TFL information itself, error associated with computation of a location form TFL information, or error associated with presuming the determined location is similar or the same as that derived from the accessed TFL information. As an example of the later error, determining a location for TFL information from a TFL source device can simply be presuming the location of the requesting device and the TFL source device are the same. Continuing the example, where the requesting device and the TFL source device are indeed collocated, such as where a user's laptop requests TFL information from a TFL-enabled cellphone of the user, the error associated with the determined location can be minimal. In contrast, where the requesting device and the TFL source device are not collocated or are only temporarily collocated, such as where a first cell phone on a subway car requests TFL information from a TFL source device on the subway platform as the subway car is departing, can be associated with much larger errors in accuracy of a location presumed to be the same for both the requesting device and the TFL source device.
Numerous correction techniques can be applied to correct for inherent error in the location determined from the accessed TFL information. These particular techniques are beyond the scope of the subject disclosure although the use of any such correction technique falls within the present disclosure. As an example, where a requesting device is moving away from a TFL source device, this change in relative position can be determined and employed to compute a level of error or correction factor. As a second example, where a requesting device and TFL source device employ a communication technology associated with a communication range, such as using Bluetooth with a range of about 10 meters, this communication technology characteristic can be employed in determining a level of error or correction factor.
In an embodiment, user actions can be associated with interactions relative to accessing TFL information for a TFL source device. These user actions can be predetermined settings, automated settings, or can require user intervention. As an example, a device can be set to automatically seek sharing of TFL information. As a second example, a device can be set to share TFL information with predetermined sets of devices, such as sharing TFL information among all devices belonging to a single user. As a third example, a device can require specific input to shared TFL information, such as “bumping” a requesting device and TFL source device by emulating a fist-bump action between the two device.
AAC 220 can include TFL information history component 222. TFL information history component 222 can facilitate access to historic TFL information. In certain circumstances, access to historic TFL information can be shared by way of system 200. Historic TFL information, accessed by way of TFL information history component 222, can include historic timing information, historic location information, etc. One example includes accessing the TFL information of a TFL source device for the last 60 minutes, which can be shared, in a limited or unlimited manner, to allow another device to employ the shared TFL information, such as to determine, with a level of inherent error, the location of the other device over the last 60 minutes.
AAC 220 can further include decision engine component 224 that can facilitate forming determinations relating to a sharing rule. Determinations can include satisfying a sharing rule, not satisfying a sharing rule, satisfying part of a sharing rule, applying a sharing rule to a set of information, etc. A determination relating to a sharing rule can be related to TFL information or a level of access to TFL information. As a first example, where a sharing rule is satisfied when a UE owner is the same as a TFL source device owner, decision engine component 224 can determine that this rule is satisfied by comparing owner information of the TFL source device and the UE. As a further example, decision engine component 224 can apply a weighting rule to TFL information and historical TFL information, such as where a rule indicates that a weighting factor relating to accessing historical TFL information of 10× is to be applied to historical TFL information over one hour old, e.g., making access to historical information less accessible. Numerous other examples of specific sharing rules are not explicitly recited for brevity but are to be considered within the scope of the present disclosure.
In an aspect, decision engine component 224 can include rule component 226 to facilitate forming determinations related to a sharing rule. Rule component 226 can facilitate employing one or more sharing rules. These rules can include rules for determining values pertinent to sharing TFL information. As one example, determining a value for a user input, e.g., determining “bumping”, can be associated with granting a higher level of TFL information access authorization. In an embodiment, rule component 226 can be a rule engine that allows the application of logical determinations to be embodied in one or more algorithms related to sharing TFL information. As a non-limiting example, rule component 226 can generate a rule that allows unlimited access to TFL information among an enumerated set of UEs based on International Mobile Equipment Identity (IMEI) number, Media Access Control address (MAC address), etc.
IIC 230 can include a transmitter component 232 and a receiver component 234. Transmitter component 232 and receiver component 234 can facilitate sharing TFL information over a wireless interface. In an embodiment transmitter component 232 and receiver component 234 can be an antenna and associated electronics for wireless communications, such as those enumerated elsewhere herein. In another embodiment, transmitter component 232 and receiver component 234 can facilitate determining aspects of an employed wireless communications technology, such as determining a typical effective range for sharing TFL information over a Bluetooth link. The determined effective range can then be employed in determining a level of error associated with a location determination based on the shared TFL information.
IIC 330 can include a transmitter component 332 and a receiver component 334. Transmitter component 332 and receiver component 334 can facilitate sharing TFL information over a wireless interface. In an embodiment transmitter component 332 and receiver component 334 can be electronics or software for wireless communications, such as those enumerated elsewhere herein. In another embodiment, transmitter component 332 and receiver component 334 can facilitate determining aspects of an employed wireless communications technology. In an aspect, transmitter component 332 and receiver component 334 can be associated with receiving a request to share TFL information and facilitating access to shared TFL information.
IIC 330 can be communicatively coupled to short-range antenna component 336. Short-range antenna component 336 can facilitate communicating between UEs to facilitate sharing TFL information. In some embodiments, short-range antenna component 336 can be associated with predetermined transmission regions. These transmission regions can be, for example, associated with a personal area network. A personal area network can be limited to devices on or near a user and can, for example, be associated with a range of about two meters. The exemplary short-range antenna component 336 coving about two meters would facilitate sharing TFL information from a TFL source device to other devices within about two meters of the TFL source device. This can be an efficient way of sharing TFL information among location enabled and non-location enabled devices of a single person, such as sharing a location sourced from a TFL-enabled cell phone to a laptop, watch, PDA, running shoe fob, etc., of a user to enable location-centric behavior on those devices. Other ranges can be employed and are within the scope of the present disclosure despite not being explicitly recited.
Short-range antenna component 450 can be communicatively coupled to transmitter component 452 and receiver component 454. Transmitter component 452 and receiver component 454 can facilitate sharing TFL information over a wireless interface. In an embodiment transmitter component 452 and receiver component 452 can be electronics or software for wireless communications, such as those enumerated elsewhere herein. In another embodiment, transmitter component 452 and receiver component 454 can facilitate determining aspects of an employed wireless communications technology. In some embodiments, transmitter component 452 and receiver component 454 can be the same as, or similar to transmitter component 332 and receiver component 334 of system 300. In an aspect, transmitter component 452 and receiver component 454 can be associated with facilitating access to a request to share TFL information and accessing shared TFL information.
Transmitter component 452 and receiver component 454 can be communicatively coupled to TFL source device proximity component 460. TFL source device proximity component 460 can facilitate determining the proximity of a TFL source device to a component of system 400. In an embodiment, TFL source device proximity component 460 can determine the proximity of a TFL source device based on a communication technology employed in communications with a TFL source device. As an example, TFL source device proximity component 460 can determine that a TFL source device is within about 10 meters of a component of system 400 when Bluetooth technology is associated with communications to the TFL source device.
TFL source device proximity component 460 can be communicatively coupled to memory component 470. Memory component 470 can be a data store. Memory component 470 can be employed to store data related to sharing TFL information. Memory component 470 can comprise TFL based location register 472 that can store a location derived from TFL information. Memory component 470 can further comprise TFL information register 474 that can store TFL timing information that can be employed to determine a location.
UEs 582 and 583 can be other UEs within the short-range communication region 581 of UE 580. Each of UE 582 can comprise a system that is the same as, or similar to, system 400 as disclosed herein. As such, each of UE 582 and UE 583 can generate a request to share TFL information. UE 580 can comprise a system that can be the same as, or similar to, system 300. As such, UE 580 can receive a request to share TFL information. UE 580 can further determine a level of access authorization for TFL information and can facilitate access to TFL information in accordance with the determined level of access authorization. UE 582 and UE 583 can receive TFL information shared from UE 580.
In an embodiment, the range of short-range communication region 581 can be determined. Based on this determination, locations determined on the shared TFL information at UE 582 and UE 583 can be associated with an error. In other embodiments, based on this error, a correction factor can be applied to the location determined from the shared TFL information where an error is associated with the determined location.
UE 583 can be associated with a short-range communication region 584. UE 585 can be within short-range communication region 584. As such, UE 583 can act as a TFL source device to share TFL information with UE 585. In an embodiment, this type of iterative sharing of TFL information can be limited by access authorization determination factors. In other embodiments, iterative −type sharing of TFL information can be identified with additional levels of error in subsequent location determinations based on the associated iterative level of TFL sharing. In further embodiments, iterative-type TFL sharing can be prohibited. UE 586 can be outside short-range communication region 581 and short-range communication region 584. In some embodiments, UE 586 can be considered outside of range for sharing TFL information.
As an example, UE 580 can be a modern TFL-enabled cell phone. Each of UEs 582, 583, 585 and 586 can be legacy cell phones that are not capable of directly determining their locations by way of conventional technologies such as GPS, triangulation, multilateration, etc. As such, where it is desirable to enable location-centric functionality in UEs 582, 583, 585 and 586, sharing TFL information with UE 580 can also be desirable. As illustrated in exemplary system 600, UE 582 and 583 can be within range, e.g., short-range communication region 581, of 580 and can request and receive shared TFL information from TFL source device UE 580. UE 585 can request a secondary share of TFL information from UE 580 by way of UE 583 where UE 585 is within range of UE 583, e.g., short-range communication region 584, and UE 583 is within range of UE 580, e.g., short-range communication region 581. UE 586 can be beyond a short-range communication region and can thus be unable to successfully communication a request to share TFL information with the other UEs of system 600.
This example illustrates that TFL information can be shared among devices. This TFL information can be employed in location-centric functions on UEs 582, 583 and 585. Levels of error inherent in the locations of UEs 582, 583 and 585 determined from the shared TFL information can be assessed, such as by estimating the area of short range communication region 581 and/or short range communication region 584. Further, these determined errors can be compensated for. Of note, where short range communication region 581, and also short range communication region 584, are relatively small in view of a bin-grid framework granularity associated with TFL information, the error can have little to no effect on the determined location. As an example, where the bin grid array granularity is 10 meters, a short-range communication region that has a radius of five meters would likely have an error that is less than the level of granularity and, as such, a determined location would likely be within one bin grid of the location of the TFL source device. Similarly, where the short-range communication region 581, for example, is about two meters, such as for a personal area network, the determined error can be much less than the level of granularity and the shared TFL information can be presumed to allow computation of locations that do not need to be corrected. Thus, where a user's devices share TFL information to allow location-centric functionality for devices that request sharing of TFL information, the resulting location determinations can effectively be treated as correct locations.
In view of the example system(s) described above, example method(s) that can be implemented in accordance with the disclosed subject matter can be better appreciated with reference to flowcharts in
TFL information can include location information or timing information as disclosed in more detail in U.S. Ser. No. 12/712,424 filed Feb. 25, 2010, which application is hereby incorporated by reference in its entirety. Further, such information can be received from active state or idle state user equipment as disclosed in more detail in U.S. Ser. No. 12/836,471, filed Jul. 14, 2010, which application is also hereby incorporated by reference in its entirety. As such, TFL information can include location information for a UE, in an active or idle state, based on timing information. As a non-limiting example, a mobile device, including mobile devices not equipped with a GPS-type system, can be located by looking up timing information associated with the mobile device from a TFL information reference. As such, the exemplary mobile device can be located using TFL information without employing GPS-type techniques. In an aspect, TFL information can include information to determine a DV(?,X). The centroid region (possible locations between any site pair) for an observed time value associated with any NodeB site pair (NBSP) can be calculated and is related to the determined value (in units of chip) from any pair of NodeBs. When UE time data is accessed, a DV(?,X) look-up can be initiated. Relevant NBSPs can be prioritized as part of the look-up. Further, the relevant pairs can be employed as an index to lookup a first primary set. As an example, time data for a UE can be accessed in relation to a locating event in a TFL wireless carrier environment. In this example, it can be determined that a NBSP, with a first reference frame, be used for primary set lookup with the computed DV(?,X) value as the index. This can for example return a set of bin grid frames locations forming a hyperbola between the NodeBs of the NBSP. A second lookup can then be performed for an additional relevant NBSP, with a second reference frame, using the same value DV(?,X), as an index into the data set. Continuing the example, the returned set for the look up with second NBSP can return a second set of bin grid frames. Thus, the UE is likely located in both sets of bin grid frames. Therefore, where the UE is most likely in both sets, it is probable that the location for the UE is at the intersection of the two sets. Additional NBSPs can be included to further narrow the possible locations of the UE. Employing TFL information for location determination is demonstrably different from conventional location determination techniques or systems such as GPS, eGPS, triangulation or multilateration in wireless carrier environments, near field techniques, or proximity sensors.
At 620, a request for access to the TFL information can be received. In an embodiment, the request can be generated at devices seeking TFL information from TFL source devices. Receiving the request can include receiving information relating to the requesting system. Examples of information relating to the requesting system can include device identifiers, user identifiers or names, wireless carrier provider information, range information, communications technology information, intended use of shared TFL information, etc. In some embodiments, receiving a request for access to the TFL information at 620 can be based on user actions, such as “bumping”. In other embodiments, receiving the request can be automatically processed or processed based on a predetermined set of criteria being satisfied.
At 630, a level of access authorization can be determined. Determining the level of access authorization can be based on the request for information received at 620. In an aspect, this can include basing the determination on information relating to the requesting system. As an example, a level of access authorization can be determined based on user identification for a UE requesting access to shared TFL information from a TFL source device. Determinations can include satisfying a sharing rule, not satisfying a sharing rule, satisfying part of a sharing rule, applying a sharing rule to a set of information, etc. A determination relating to a sharing rule can be related to TFL information or a level of access to TFL information. At 640, a level of access to the TFL information can be allowed based on the determine level of access authorization from 630. At this point, method 600 can end.
At 720, a proximity to the TFL source device can be determined. The proximity can be employed in determining an amount of error that can be inherent in shared TFL information. Where a level of error crosses a threshold level, a determination can be made not to generate a request for sharing TFL information because the value of any shared TFL information in determining a location of a device requesting the shared TFL information in below an acceptable level due to the inherent error. As an example, where a range is greater than 100 meters, and an error may therefore greatly exceed a location with a bin grid array pitch of 20 meters, it can be determined that sharing TFL information is not sufficiently accurate enough to justify the sharing of the TFL information. However, where a proximity is close, such as for a personal area network, the error is likely to be small and a request for TFL information can be desirable.
At 730, a request for access to TFL information of the TFL source device can be generated. The request can include information about the requesting device. This information can include device identifiers, user identifiers or names, wireless carrier provider information, range information, communications technology information, intended use of shared TFL information, etc. In an embodiment, a TFL source device receiving a request, such as that generated at 730, can process the request to determine a level of access authorization. Based on this level, access to the TFL information of the TFL source device can be correspondingly adapted. At 740, TFL information of the TFL source device can be received. At this point, method 700 can end.
At 840, a probable location of the first device can be determined based on the TFL information of the TFL source device. In an embodiment, TFL calculations can be made on the shared TFL information. Whereas the TFL information can be shared between the TFL source device and the first device, the locations can also be determined to be the same. In an aspect, it can be similar to two people sitting on a bus and the first person asks the second, “Where are we?” The second person replies, “At 42nd and Park Ave.” The first person can then accept that they too are at 42nd and Park Ave.
At 850, a level of error can be associated with the location based on the determined proximity between the first device and the TFL source device. At this point, method 800 can end. Where the two devices are further apart, the error in location can increase as disclosed hereinabove. As such, even where the first device determines that the location is the same as the location of the TFL sharing device, an error can be determined and compensated for. Continuing the above example, even though the first person accepts that they too are on 42nd and Park Ave., where they are at the front of the bus and the second person is at the back of the bus, an error of the length of the bus can be presumed. Thus, the first person is the length of the bus ahead of the second person. This is a trivial error when the granularity of the locations is on the order of city blocks and therefor no correction may be made in any computations made by the first person. In a different example, the level of error can be more critical and can be compensated for.
Method 800 can allow devices to receive and employ shared TFL information. In an aspect, this can allow the location of a TFL enabled device to be employed by non-TFL enabled devices for location-centric services. Where location-centric behavior is becoming more commonplace for mobile devices, it can still be difficult to employ on non-mobile devices, such as desktop computers that generally rely on determining location by tracing an internet protocol address. A TFL-enabled cell phone can quickly share TFL information with a desktop computer to allow the desktop to determine that it is located at the same location, with an inherent level of error, as the TFL-enabled cell phone. This determination can allow the desktop computer to perform location-centric functions with location information approaching the accuracy of the sharing TFL-enabled cell phone.
In addition to receiving and processing CS-switched traffic and signaling, PS gateway node(s) 918 can authorize and authenticate PS-based data sessions with served mobile devices. Data sessions can include traffic, or content(s), exchanged with networks external to the wireless network platform 910, like wide area network(s) (WANs) 950, enterprise network(s) 970, and service network(s) 980, which can be embodied in local area network(s) (LANs), can also be interfaced with mobile network platform 910 through PS gateway node(s) 918. It is to be noted that WANs 950 and enterprise network(s) 960 can embody, at least in part, a service network(s) like IP multimedia subsystem (IMS). Based on radio technology layer(s) available in technology resource(s) 917, packet-switched gateway node(s) 918 can generate packet data protocol contexts when a data session is established; other data structures that facilitate routing of packetized data also can be generated. To that end, in an aspect, PS gateway node(s) 918 can include a tunnel interface (e.g., tunnel termination gateway (TTG) in 3GPP UMTS network(s) (not shown)) which can facilitate packetized communication with disparate wireless network(s), such as Wi-Fi networks.
In embodiment 900, wireless network platform 910 also includes serving node(s) 916 that, based upon available radio technology layer(s) within technology resource(s) 917, convey the various packetized flows of data streams received through PS gateway node(s) 918. It is to be noted that for technology resource(s) 917 that rely primarily on CS communication, server node(s) can deliver traffic without reliance on PS gateway node(s) 918; for example, server node(s) can embody at least in part a mobile switching center. As an example, in a 3GPP UMTS network, serving node(s) 916 can be embodied in serving GPRS support node(s) (SGSN).
For radio technologies that exploit packetized communication, server(s) 914 in wireless network platform 910 can execute numerous applications that can generate multiple disparate packetized data streams or flows, and manage (e.g., schedule, queue, format . . . ) such flows. Such application(s) can include add-on features to standard services (for example, provisioning, billing, customer support . . . ) provided by wireless network platform 910. Data streams (e.g., content(s) that are part of a voice call or data session) can be conveyed to PS gateway node(s) 918 for authorization/authentication and initiation of a data session, and to serving node(s) 916 for communication thereafter. In addition to application server, server(s) 914 can include utility server(s), a utility server can include a provisioning server, an operations and maintenance server, a security server that can implement at least in part a certificate authority and firewalls as well as other security mechanisms, and the like. In an aspect, security server(s) secure communication served through wireless network platform 910 to ensure network's operation and data integrity in addition to authorization and authentication procedures that CS gateway node(s) 912 and PS gateway node(s) 918 can enact. Moreover, provisioning server(s) can provision services from external network(s) like networks operated by a disparate service provider; for instance, WAN 950 or Global Positioning System (GPS) network(s) (not shown). Provisioning server(s) can also provision coverage through networks associated to wireless network platform 910 (e.g., deployed and operated by the same service provider), such as femto-cell network(s) (not shown) that enhance wireless service coverage within indoor confined spaces and offload RAN resources in order to enhance subscriber service experience within a home or business environment.
It is to be noted that server(s) 914 can include one or more processors configured to confer at least in part the functionality of macro network platform 910. To that end, the one or more processor can execute code instructions stored in memory 930, for example. It should be appreciated that server(s) 914 can include a content manager 915, which operates in substantially the same manner as described hereinbefore.
In example embodiment 900, memory 930 can store information related to operation of wireless network platform 910. Other operational information can include provisioning information of mobile devices served through wireless platform network 910, subscriber databases; application intelligence, pricing schemes, e.g., promotional rates, flat-rate programs, couponing campaigns; technical specification(s) consistent with telecommunication protocols for operation of disparate radio, or wireless, technology layers; and so forth. Memory 930 can also store information from at least one of telephony network(s) 940, WAN 950, enterprise network(s) 960, or SS7 network 970. In an aspect, memory 930 can be, for example, accessed as part of a data store component or as a remotely connected memory store.
In order to provide a context for the various aspects of the disclosed subject matter,
In the subject specification, terms such as “store,” “storage,” “data store,” data storage,” “database,” and substantially any other information storage component relevant to operation and functionality of a component, refer to “memory components,” or entities embodied in a “memory” or components comprising the memory. It will be appreciated that the memory components described herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory.
By way of illustration, and not limitation, nonvolatile memory, for example, can be included in volatile memory 1020, non-volatile memory 1022 (see below), disk storage 1024 (see below), and memory storage 1046 (see below). Further, nonvolatile memory can be included in read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM). Additionally, the disclosed memory components of systems or methods herein are intended to comprise, without being limited to comprising, these and any other suitable types of memory.
Moreover, it will be noted that the disclosed subject matter can be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, mini-computing devices, mainframe computers, as well as personal computers, hand-held computing devices (e.g., PDA, phone, watch, tablet computers, . . . ), microprocessor-based or programmable consumer or industrial electronics, and the like. The illustrated aspects can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network; however, some if not all aspects of the subject disclosure can be practiced on stand-alone computers. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
System bus 1018 can be any of several types of bus structure(s) including a memory bus or a memory controller, a peripheral bus or an external bus, and/or a local bus using any variety of available bus architectures including, but not limited to, Industrial Standard Architecture (ISA), Micro-Channel Architecture (MS A), Extended ISA (EISA), Intelligent Drive Electronics, VESA Local Bus (VLB), Peripheral Component Interconnect (PCI), Card Bus, Universal Serial Bus (USB), Advanced Graphics Port (AGP), Personal Computer Memory Card International Association bus (PCMCIA), Firewire (IEEE 1194), and Small Computer Systems Interface (SCSI).
System memory 1016 includes volatile memory 1020 and nonvolatile memory 1022. A basic input/output system (BIOS), containing routines to transfer information between elements within computer 1012, such as during start-up, can be stored in nonvolatile memory 1022. By way of illustration, and not limitation, nonvolatile memory 1022 can include ROM, PROM, EPROM, EEPROM, or flash memory. Volatile memory 1020 includes RAM, which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as SRAM, dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct Rambus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM).
Computer 1012 also includes removable/non-removable, volatile/non-volatile computer storage media.
Computing devices can include a variety of media, which can include computer-readable storage media or communications media, which two terms are used herein differently from one another as follows.
Computer-readable storage media can be any available storage media that can be accessed by the computer and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer-readable storage media can be implemented in connection with any method or technology for storage of information such as computer-readable instructions, program modules, structured data, or unstructured data. Computer-readable storage media can include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or other tangible and/or non-transitory media which can be used to store desired information. Computer-readable storage media can be accessed by one or more local or remote computing devices, e.g., via access requests, queries or other data retrieval protocols, for a variety of operations with respect to the information stored by the medium.
Communications media can embody computer-readable instructions, data structures, program modules, or other structured or unstructured data in a data signal such as a modulated data signal, e.g., a carrier wave or other transport mechanism, and includes any information delivery or transport media. The term “modulated data signal” or signals refers to a signal that has one or more of its characteristics set or changed in such a manner as to encode information in one or more signals. By way of example, and not limitation, communication media include wired media, such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media.
It can be noted that
A user can enter commands or information into computer 1012 through input device(s) 1036. Input devices 1036 include, but are not limited to, a pointing device such as a mouse, trackball, stylus, touch pad, keyboard, microphone, joystick, game pad, satellite dish, scanner, TV tuner card, digital camera, digital video camera, web camera, cell phone, smartphone, tablet computer, etc. These and other input devices connect to processing unit 1014 through system bus 1018 by way of interface port(s) 1038. Interface port(s) 1038 include, for example, a serial port, a parallel port, a game port, a universal serial bus (USB), an infrared port, a Bluetooth port, an IP port, or a logical port associated with a wireless service, etc. Output device(s) 1040 use some of the same type of ports as input device(s) 1036.
Thus, for example, a USB port can be used to provide input to computer 1012 and to output information from computer 1012 to an output device 1040. Output adapter 1042 is provided to illustrate that there are some output devices 1040 like monitors, speakers, and printers, among other output devices 1040, which use special adapters. Output adapters 1042 include, by way of illustration and not limitation, video and sound cards that provide means of connection between output device 1040 and system bus 1018. It should be noted that other devices and/or systems of devices provide both input and output capabilities such as remote computer(s) 1044.
Computer 1012 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1044. Remote computer(s) 1044 can be a personal computer, a server, a router, a network PC, a workstation, a microprocessor based appliance, a peer device, or other common network node and the like, and can include many or all of the elements described relative to computer 1012.
For purposes of brevity, only a memory storage device 1046 is illustrated with remote computer(s) 1044. Remote computer(s) 1044 can be logically connected to computer 1012 through a network interface 1048 and then physically connected by way of communication connection 1050. Network interface 1048 encompasses wire and/or wireless communication networks such as local-area networks (LAN) and wide-area networks (WAN). LAN technologies include Fiber Distributed Data Interface (FDDI), Copper Distributed Data Interface (CDDI), Ethernet, Token Ring and the like. WAN technologies include, but are not limited to, point-to-point links, circuit switching networks like Integrated Services Digital Networks (ISDN) and variations thereon, packet switching networks, and Digital Subscriber Lines (DSL). As noted below, wireless technologies may be used in addition to or in place of the foregoing.
Communication connection(s) 1050 refer(s) to hardware/software employed to connect network interface 1048 to bus 1018. While communication connection 1050 is shown for illustrative clarity inside computer 1012, it can also be external to computer 1012. The hardware/software for connection to network interface 1048 can include, for example, internal and external technologies such as modems, including regular telephone grade modems, cable modems and DSL modems, ISDN adapters, and Ethernet cards.
The above description of illustrated embodiments of the subject disclosure, including what is described in the Abstract, is not intended to be exhaustive or to limit the disclosed embodiments to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various modifications are possible that are considered within the scope of such embodiments and examples, as those skilled in the relevant art can recognize.
In this regard, while the disclosed subject matter has been described in connection with various embodiments and corresponding figures, where applicable, it is to be understood that other similar embodiments can be used or modifications and additions can be made to the described embodiments for performing the same, similar, alternative, or substitute function of the disclosed subject matter without deviating therefrom. Therefore, the disclosed subject matter should not be limited to any single embodiment described herein, but rather should be construed in breadth and scope in accordance with the appended claims below.
As it employed in the subject specification, the term “processor” can refer to substantially any computing processing unit or device comprising, but not limited to comprising, single-core processors; single-processors with software multithread execution capability; multi-core processors; multi-core processors with software multithread execution capability; multi-core processors with hardware multithread technology; parallel platforms; and parallel platforms with distributed shared memory. Additionally, a processor can refer to an integrated circuit, an application specific integrated circuit (ASIC), a digital signal processor (DSP), a field programmable gate array (FPGA), a programmable logic controller (PLC), a complex programmable logic device (CPLD), a discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. Processors can exploit nano-scale architectures such as, but not limited to, molecular and quantum-dot based transistors, switches, and gates, in order to optimize space usage or enhance performance of user equipment. A processor may also be implemented as a combination of computing processing units.
As used in this application, the terms “component,” “system,” “platform,” “layer,” “selector,” “interface,” and the like are intended to refer to a computer-related entity or an entity related to an operational apparatus with one or more specific functionalities, wherein the entity can be either hardware, a combination of hardware and software, software, or software in execution. As an example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration and not limitation, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate via local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems via the signal). As another example, a component can be an apparatus with specific functionality provided by mechanical parts operated by electric or electronic circuitry, which can be operated by a software or firmware application executed by a processor, wherein the processor can be internal or external to the apparatus and executes at least a part of the software or firmware application. As yet another example, a component can be an apparatus that provides specific functionality through electronic components without mechanical parts, the electronic components can include a processor therein to execute software or firmware that confers at least in part the functionality of the electronic components.
In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then “X employs A or B” is satisfied under any of the foregoing instances. Moreover, articles “a” and “an” as used in the subject specification and annexed drawings should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form.
Moreover, terms like “user equipment (UE),” “mobile station,” “mobile,” subscriber station,” “subscriber equipment,” “access terminal,” “terminal,” “handset,” and similar terminology, refer to a wireless device utilized by a subscriber or user of a wireless communication service to receive or convey data, control, voice, video, sound, gaming, or substantially any data-stream or signaling-stream. The foregoing terms are utilized interchangeably in the subject specification and related drawings. Likewise, the terms “access point (AP),” “base station,” “Node B,” “evolved Node B (eNode B),” “home Node B (HNB),” “home access point (HAP),” and the like, are utilized interchangeably in the subject application, and refer to a wireless network component or appliance that serves and receives data, control, voice, video, sound, gaming, or substantially any data-stream or signaling-stream to and from a set of subscriber stations or provider enabled devices. Data and signaling streams can include packetized or frame-based flows.
Additionally, the term “core-network”, “core”, “core carrier network”, or similar terms can refer to components of a telecommunications network that provide some or all of aggregation, authentication, call control and switching, charging, service invocation, or gateways. Aggregation can refer to the highest level of aggregation in a service provider network wherein the next level in the hierarchy under the core nodes can be the distribution networks and then the edge networks. UEs do not normally connect directly to the core networks of a large service provider but can be routed to the core by way of a switch or radio area network. Authentication can refer to determinations regarding whether the user requesting a service from the telecom network is authorized to do so within this network or not. Call control and switching can refer determinations related to the future course of a call stream across carrier equipment based on the call signal processing. Charging can be related to the collation and processing of charging data generated by various network nodes. Two common types of charging mechanisms found in present day networks can be prepaid charging and postpaid charging. Service invocation can occur based on some explicit action (e.g. call transfer) or implicitly (e.g., call waiting). It is to be noted that service “execution” may or may not be a core network functionality as third party network/nodes may take part in actual service execution. A gateway can be present in the core network to access other networks. Gateway functionality can be dependent on the type of the interface with another network.
Furthermore, the terms “user,” “subscriber,” “customer,” “consumer,” “prosumer,” “agent,” and the like are employed interchangeably throughout the subject specification, unless context warrants particular distinction(s) among the terms. It should be appreciated that such terms can refer to human entities or automated components (e.g., supported through artificial intelligence, as through a capacity to make inferences based on complex mathematical formalisms), that can provide simulated vision, sound recognition and so forth.
Aspects, features, or advantages of the subject matter can be exploited in substantially any, or any, wired, broadcast, wireless telecommunication, radio technology or network, or combinations thereof. Non-limiting examples of such technologies or networks include Geocast technology; broadcast technologies (e.g., sub-Hz, ELF, VLF, LF, MF, HF, VHF, UHF, SHF, THz broadcasts, etc.); Ethernet; X.25; powerline-type networking (e.g., PowerLine AV Ethernet, etc.); femto-cell technology; Wi-Fi; Zigbee, other 802.XX wireless technologies, Worldwide Interoperability for Microwave Access (WiMAX); Enhanced General Packet Radio Service (Enhanced GPRS); Third Generation Partnership Project (3GPP or 3G) Long Term Evolution (LTE); 3GPP Universal Mobile Telecommunications System (UMTS) or 3GPP UMTS; Third Generation Partnership Project 2 (3GPP2) Ultra Mobile Broadband (UMB); High Speed Packet Access (HSPA); High Speed Downlink Packet Access (HSDPA); High Speed Uplink Packet Access (HSUPA); GSM Enhanced Data Rates for GSM Evolution (EDGE) Radio Access Network (RAN) or GERAN; UMTS Terrestrial Radio Access Network (UTRAN); or LTE Advanced.
What has been described above includes examples of systems and methods illustrative of the disclosed subject matter. It is, of course, not possible to describe every combination of components or methodologies here. One of ordinary skill in the art may recognize that many further combinations and permutations of the claimed subject matter are possible. Furthermore, to the extent that the terms “includes,” “has,” “possesses,” and the like are used in the detailed description, claims, appendices and drawings such terms are intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.
This application is a continuation of, and claims priority to each of, U.S. patent application Ser. No. 14/636,097, filed Mar. 2, 2015, and entitled “SHARING TIMED FINGERPRINT LOCATION INFORMATION,” which is a continuation of, and claims priority to, U.S. patent application Ser. No. 13/284,497, filed Oct. 28, 2011, now issued as U.S. Pat. No. 9,008,684, and entitled “SHARING TIMED FINGERPRINT LOCATION INFORMATION,” which applications are hereby incorporated by reference herein in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
4718081 | Brenig | Jan 1988 | A |
5515062 | Maine et al. | May 1996 | A |
5724660 | Kauser et al. | Mar 1998 | A |
5732354 | MacDonald | Mar 1998 | A |
5732383 | Foladare et al. | Mar 1998 | A |
5831545 | Murray et al. | Nov 1998 | A |
5844521 | Stephens et al. | Dec 1998 | A |
5982324 | Watters et al. | Nov 1999 | A |
6018312 | Haworth et al. | Jan 2000 | A |
6026301 | Satarasinghe | Feb 2000 | A |
6058260 | Brockel et al. | May 2000 | A |
6108532 | Matsuda et al. | Aug 2000 | A |
6108556 | Ito | Aug 2000 | A |
6125125 | Narasimha et al. | Sep 2000 | A |
6148219 | Engelbrecht et al. | Nov 2000 | A |
6216002 | Holmring | Apr 2001 | B1 |
6230018 | Watters et al. | May 2001 | B1 |
6256577 | Graunke | Jul 2001 | B1 |
6263190 | Mamori et al. | Jul 2001 | B1 |
6292665 | Hildebrand et al. | Sep 2001 | B1 |
6298233 | Souissi et al. | Oct 2001 | B1 |
6307503 | Liu et al. | Oct 2001 | B1 |
6311078 | Hardouin et al. | Oct 2001 | B1 |
6317686 | Ran | Nov 2001 | B1 |
6321092 | Fitch et al. | Nov 2001 | B1 |
6330459 | Chrichton et al. | Dec 2001 | B1 |
6351235 | Stilp | Feb 2002 | B1 |
6353778 | Brown et al. | Mar 2002 | B1 |
6397074 | Pihl et al. | May 2002 | B1 |
6405047 | Moon | Jun 2002 | B1 |
6407703 | Minter et al. | Jun 2002 | B1 |
6429815 | Soliman | Aug 2002 | B1 |
6434396 | Rune | Aug 2002 | B1 |
6449486 | Rao | Sep 2002 | B1 |
6453168 | McCrady et al. | Sep 2002 | B1 |
6493539 | Falco et al. | Dec 2002 | B1 |
6515623 | Johnson | Feb 2003 | B2 |
6522296 | Holt | Feb 2003 | B2 |
6526335 | Treyz et al. | Feb 2003 | B1 |
6552682 | Fan | Apr 2003 | B1 |
6560532 | Cayford | May 2003 | B2 |
6560567 | Yechuri et al. | May 2003 | B1 |
6594576 | Fan et al. | Jul 2003 | B2 |
6604083 | Bailey et al. | Aug 2003 | B1 |
6668226 | Sutanto et al. | Dec 2003 | B2 |
6690292 | Meadows et al. | Feb 2004 | B1 |
6744383 | Alfred et al. | Jun 2004 | B1 |
6744740 | Chen | Jun 2004 | B2 |
6757545 | Nowak et al. | Jun 2004 | B2 |
6801782 | McCrady et al. | Oct 2004 | B2 |
6801855 | Walters et al. | Oct 2004 | B1 |
6816782 | Walters et al. | Nov 2004 | B1 |
6850761 | Pallonen | Feb 2005 | B2 |
6892054 | Belcher et al. | May 2005 | B2 |
6915123 | Daudelin et al. | Jul 2005 | B1 |
6933100 | Igawa et al. | Aug 2005 | B2 |
6933860 | Gehman et al. | Aug 2005 | B1 |
7058710 | McCall et al. | Jun 2006 | B2 |
7065349 | Nath et al. | Jun 2006 | B2 |
7098805 | Meadows et al. | Aug 2006 | B2 |
7113793 | Veerasamy et al. | Sep 2006 | B2 |
7149534 | Bloebaum et al. | Dec 2006 | B2 |
7181218 | Ovesjo et al. | Feb 2007 | B2 |
7203752 | Rice et al. | Apr 2007 | B2 |
7277049 | Korneluk et al. | Oct 2007 | B2 |
7289039 | Kato et al. | Oct 2007 | B2 |
7346359 | Damarla et al. | Mar 2008 | B2 |
7359719 | Duffett-Smith et al. | Apr 2008 | B1 |
7366492 | Ganesh | Apr 2008 | B1 |
7375649 | Gueziec | May 2008 | B2 |
7420464 | Fitzgerald et al. | Sep 2008 | B2 |
7432829 | Poltorak | Oct 2008 | B2 |
7436794 | Takahashi et al. | Oct 2008 | B2 |
7463143 | Forr et al. | Dec 2008 | B2 |
7508321 | Gueziec et al. | Mar 2009 | B2 |
7664492 | Lee et al. | Feb 2010 | B1 |
7696922 | Nicholson et al. | Apr 2010 | B2 |
7697917 | Camp et al. | Apr 2010 | B2 |
7706964 | Horvitz et al. | Apr 2010 | B2 |
7744740 | Diehl | Jun 2010 | B2 |
7747258 | Farmer et al. | Jun 2010 | B2 |
7761225 | Vaughn | Jul 2010 | B2 |
7831380 | Chapman et al. | Nov 2010 | B2 |
7848880 | Cheung | Dec 2010 | B2 |
7890299 | Fok et al. | Feb 2011 | B2 |
7917156 | Sheynblat et al. | Mar 2011 | B2 |
7945271 | Barnes et al. | May 2011 | B1 |
7958001 | Abbadessa et al. | Jun 2011 | B2 |
7962162 | McNair | Jun 2011 | B2 |
7962280 | Kindo et al. | Jun 2011 | B2 |
7994981 | Farrokhi et al. | Aug 2011 | B1 |
7996020 | Chhabra | Aug 2011 | B1 |
8000726 | Altman et al. | Aug 2011 | B2 |
8005050 | Scheinert et al. | Aug 2011 | B2 |
8010164 | Sennett et al. | Aug 2011 | B1 |
8036822 | Ho et al. | Oct 2011 | B2 |
8050690 | Neeraj | Nov 2011 | B2 |
8054802 | Burgess et al. | Nov 2011 | B2 |
8065185 | Foladare et al. | Nov 2011 | B2 |
8098152 | Zhang et al. | Jan 2012 | B2 |
8121604 | Schwinghammer | Feb 2012 | B1 |
8126479 | Morrison | Feb 2012 | B2 |
8140079 | Olson | Mar 2012 | B2 |
8193984 | Ward et al. | Jun 2012 | B2 |
8194589 | Wynn et al. | Jun 2012 | B2 |
8195175 | Govindan et al. | Jun 2012 | B2 |
8224349 | Meredith et al. | Jul 2012 | B2 |
8253559 | Howard et al. | Aug 2012 | B2 |
8254959 | Fix et al. | Aug 2012 | B2 |
8264956 | Ramankutty et al. | Sep 2012 | B2 |
8270933 | Riemer et al. | Sep 2012 | B2 |
8280438 | Barbera et al. | Oct 2012 | B2 |
8295854 | Osann et al. | Oct 2012 | B2 |
8300663 | Chion et al. | Oct 2012 | B2 |
8307030 | Hu | Nov 2012 | B1 |
8326682 | Redford et al. | Dec 2012 | B2 |
8355364 | Vargantwar et al. | Jan 2013 | B1 |
8355865 | Wagner et al. | Jan 2013 | B2 |
8417264 | Whitney et al. | Apr 2013 | B1 |
8469274 | Tseng et al. | Jun 2013 | B2 |
8548494 | Agarwal et al. | Oct 2013 | B2 |
8572198 | Jhanji | Oct 2013 | B2 |
8594700 | Nabbefeld | Nov 2013 | B2 |
8611919 | Barnes | Dec 2013 | B2 |
8612410 | Meredith et al. | Dec 2013 | B2 |
8666388 | Catovic et al. | Mar 2014 | B2 |
8666390 | Meredith et al. | Mar 2014 | B2 |
8761799 | Meredith et al. | Jun 2014 | B2 |
8897805 | Fix et al. | Nov 2014 | B2 |
8909247 | Tipton et al. | Dec 2014 | B2 |
8923134 | Meredith et al. | Dec 2014 | B2 |
9008684 | Tipton et al. | Apr 2015 | B2 |
9008698 | Meredith et al. | Apr 2015 | B2 |
9232399 | Tipton et al. | Jan 2016 | B2 |
20010047242 | Ohta | Nov 2001 | A1 |
20020059266 | I'anson et al. | May 2002 | A1 |
20020069312 | Jones | Jun 2002 | A1 |
20020077116 | Havinis et al. | Jun 2002 | A1 |
20020172223 | Stilp et al. | Nov 2002 | A1 |
20030040323 | Pihl et al. | Feb 2003 | A1 |
20030092448 | Forstrom et al. | May 2003 | A1 |
20030095065 | Ericson et al. | May 2003 | A1 |
20030097330 | Hillmer et al. | May 2003 | A1 |
20030115228 | Horvitz et al. | Jun 2003 | A1 |
20030115260 | Edge | Jun 2003 | A1 |
20030125046 | Riley et al. | Jul 2003 | A1 |
20030158924 | DeLegge | Aug 2003 | A1 |
20030222819 | Karr et al. | Dec 2003 | A1 |
20030225508 | Petzold et al. | Dec 2003 | A9 |
20040024639 | Goldman et al. | Feb 2004 | A1 |
20040067759 | Spirito et al. | Apr 2004 | A1 |
20040082338 | Norrgard et al. | Apr 2004 | A1 |
20040127191 | Matsunaga | Jul 2004 | A1 |
20040131036 | Walsh | Jul 2004 | A1 |
20040155814 | Bascobert | Aug 2004 | A1 |
20040172190 | Tsunehara et al. | Sep 2004 | A1 |
20040219930 | Lin | Nov 2004 | A1 |
20040224698 | Yi et al. | Nov 2004 | A1 |
20040267410 | Duri et al. | Dec 2004 | A1 |
20040267561 | Meshkin et al. | Dec 2004 | A1 |
20050007993 | Chambers et al. | Jan 2005 | A1 |
20050039056 | Bagga et al. | Feb 2005 | A1 |
20050053099 | Spear et al. | Mar 2005 | A1 |
20050136911 | Csapo et al. | Jun 2005 | A1 |
20050239410 | Rochester | Oct 2005 | A1 |
20050272445 | Zellner et al. | Dec 2005 | A1 |
20050276385 | McCormick et al. | Dec 2005 | A1 |
20060030333 | Ward et al. | Feb 2006 | A1 |
20060046744 | Dublish et al. | Mar 2006 | A1 |
20060075131 | Douglas et al. | Apr 2006 | A1 |
20060089153 | Sheynblat | Apr 2006 | A1 |
20060200303 | Fuentes et al. | Sep 2006 | A1 |
20060240839 | Chen et al. | Oct 2006 | A1 |
20060240841 | Bhattacharya | Oct 2006 | A1 |
20060267841 | Lee et al. | Nov 2006 | A1 |
20060270419 | Crowley et al. | Nov 2006 | A1 |
20060282660 | Varghese et al. | Dec 2006 | A1 |
20070001873 | Ishikawa et al. | Jan 2007 | A1 |
20070049286 | Kim et al. | Mar 2007 | A1 |
20070060130 | Gogic et al. | Mar 2007 | A1 |
20070088818 | Roberts et al. | Apr 2007 | A1 |
20070121560 | Edge | May 2007 | A1 |
20070149214 | Walsh et al. | Jun 2007 | A1 |
20070176749 | Boyd | Aug 2007 | A1 |
20070213074 | Fitch et al. | Sep 2007 | A1 |
20070217375 | Zampiello et al. | Sep 2007 | A1 |
20070217379 | Fujiwara et al. | Sep 2007 | A1 |
20070293157 | Haartsen et al. | Dec 2007 | A1 |
20070298807 | Yarkosky | Dec 2007 | A1 |
20080004789 | Horvitz et al. | Jan 2008 | A1 |
20080010365 | Schneider | Jan 2008 | A1 |
20080032705 | Patel et al. | Feb 2008 | A1 |
20080039114 | Phatak et al. | Feb 2008 | A1 |
20080056193 | Bourlas et al. | Mar 2008 | A1 |
20080070593 | Altman et al. | Mar 2008 | A1 |
20080071466 | Downs et al. | Mar 2008 | A1 |
20080076450 | Nanda et al. | Mar 2008 | A1 |
20080096566 | Brunner et al. | Apr 2008 | A1 |
20080127354 | Carpenter et al. | May 2008 | A1 |
20080133730 | Park et al. | Jun 2008 | A1 |
20080186234 | Alles et al. | Aug 2008 | A1 |
20080192682 | Matsumoto et al. | Aug 2008 | A1 |
20080274750 | Carlson et al. | Nov 2008 | A1 |
20080299995 | Spain | Dec 2008 | A1 |
20080305832 | Greenberg | Dec 2008 | A1 |
20080311923 | Petrovic et al. | Dec 2008 | A1 |
20090017823 | Sachs et al. | Jan 2009 | A1 |
20090024546 | Ficcaglia et al. | Jan 2009 | A1 |
20090028082 | Wynn et al. | Jan 2009 | A1 |
20090052330 | Matsunaga et al. | Feb 2009 | A1 |
20090079622 | Seshadri et al. | Mar 2009 | A1 |
20090104917 | Rached et al. | Apr 2009 | A1 |
20090117907 | Wigren et al. | May 2009 | A1 |
20090125380 | Otto et al. | May 2009 | A1 |
20090131073 | Carlson et al. | May 2009 | A1 |
20090177382 | Alles et al. | Jul 2009 | A1 |
20090181695 | Wirola et al. | Jul 2009 | A1 |
20090227265 | Kang et al. | Sep 2009 | A1 |
20090234876 | Schigel et al. | Sep 2009 | A1 |
20090260055 | Parmar | Oct 2009 | A1 |
20090280828 | Wang et al. | Nov 2009 | A1 |
20090286510 | Huber et al. | Nov 2009 | A1 |
20090287922 | Herwono et al. | Nov 2009 | A1 |
20090299788 | Huber et al. | Dec 2009 | A1 |
20090310501 | Catovic et al. | Dec 2009 | A1 |
20090312005 | Mukundan et al. | Dec 2009 | A1 |
20090327134 | Carlson et al. | Dec 2009 | A1 |
20100004997 | Mehta et al. | Jan 2010 | A1 |
20100020776 | Youssef et al. | Jan 2010 | A1 |
20100054237 | Han et al. | Mar 2010 | A1 |
20100056179 | Gaenger et al. | Mar 2010 | A1 |
20100058442 | Costa et al. | Mar 2010 | A1 |
20100081389 | Lawrow et al. | Apr 2010 | A1 |
20100094758 | Chamberlain et al. | Apr 2010 | A1 |
20100100732 | Hatakeyama et al. | Apr 2010 | A1 |
20100113035 | Eskicioglu et al. | May 2010 | A1 |
20100120447 | Anderson et al. | May 2010 | A1 |
20100122314 | Zhang et al. | May 2010 | A1 |
20100124886 | Fordham et al. | May 2010 | A1 |
20100124931 | Eskicioglu et al. | May 2010 | A1 |
20100135178 | Aggarwal et al. | Jun 2010 | A1 |
20100144368 | Sullivan | Jun 2010 | A1 |
20100159951 | Shkedi et al. | Jun 2010 | A1 |
20100163632 | Tseng | Jul 2010 | A1 |
20100172259 | Aggarwal et al. | Jul 2010 | A1 |
20100180039 | Oh et al. | Jul 2010 | A1 |
20100189236 | MacDonald et al. | Jul 2010 | A1 |
20100190509 | Davis et al. | Jul 2010 | A1 |
20100195566 | Krishnamurthy et al. | Aug 2010 | A1 |
20100203903 | Dingler et al. | Aug 2010 | A1 |
20100207470 | Kim et al. | Aug 2010 | A1 |
20100220665 | Govindan et al. | Sep 2010 | A1 |
20100222075 | Miura | Sep 2010 | A1 |
20100227589 | Cook et al. | Sep 2010 | A1 |
20100250542 | Fujimaki | Sep 2010 | A1 |
20100262449 | Monteforte et al. | Oct 2010 | A1 |
20100273504 | Bull et al. | Oct 2010 | A1 |
20100291907 | MacNaughtan et al. | Nov 2010 | A1 |
20100296467 | Pelletier et al. | Nov 2010 | A1 |
20100299060 | Snavely et al. | Nov 2010 | A1 |
20100311437 | Palanki et al. | Dec 2010 | A1 |
20100313157 | Carlsson et al. | Dec 2010 | A1 |
20100323723 | Gerstenberger et al. | Dec 2010 | A1 |
20100331013 | Zhang | Dec 2010 | A1 |
20110009068 | Miura | Jan 2011 | A1 |
20110010085 | Tanaka et al. | Jan 2011 | A1 |
20110023129 | Vernal | Jan 2011 | A1 |
20110026475 | Lee et al. | Feb 2011 | A1 |
20110026495 | Lee et al. | Feb 2011 | A1 |
20110039593 | Lee et al. | Feb 2011 | A1 |
20110053609 | Grogan et al. | Mar 2011 | A1 |
20110060808 | Martin et al. | Mar 2011 | A1 |
20110065450 | Kazmi | Mar 2011 | A1 |
20110069668 | Chion et al. | Mar 2011 | A1 |
20110072034 | Sly | Mar 2011 | A1 |
20110076975 | Kim et al. | Mar 2011 | A1 |
20110077030 | Wigren et al. | Mar 2011 | A1 |
20110077032 | Correale et al. | Mar 2011 | A1 |
20110099047 | Weiss et al. | Apr 2011 | A1 |
20110106416 | Scofield et al. | May 2011 | A1 |
20110130135 | Trigui | Jun 2011 | A1 |
20110151839 | Bolon et al. | Jun 2011 | A1 |
20110161261 | Wu et al. | Jun 2011 | A1 |
20110164596 | Montemurro et al. | Jul 2011 | A1 |
20110171912 | Beck et al. | Jul 2011 | A1 |
20110172905 | Schroder et al. | Jul 2011 | A1 |
20110205964 | Fix et al. | Aug 2011 | A1 |
20110207470 | Meredith et al. | Aug 2011 | A1 |
20110210843 | Kummetz et al. | Sep 2011 | A1 |
20110210849 | Howard et al. | Sep 2011 | A1 |
20110244879 | Siomina et al. | Oct 2011 | A1 |
20110256874 | Hayama et al. | Oct 2011 | A1 |
20110271331 | Adams | Nov 2011 | A1 |
20110287801 | Levin et al. | Nov 2011 | A1 |
20110296169 | Palmer | Dec 2011 | A1 |
20110319098 | Potorny et al. | Dec 2011 | A1 |
20120016902 | Ranjan et al. | Jan 2012 | A1 |
20120025976 | Richey et al. | Feb 2012 | A1 |
20120028650 | Cooper et al. | Feb 2012 | A1 |
20120030083 | Newman et al. | Feb 2012 | A1 |
20120032855 | Reede et al. | Feb 2012 | A1 |
20120052883 | Austin et al. | Mar 2012 | A1 |
20120052884 | Bogatin | Mar 2012 | A1 |
20120062415 | Hwang et al. | Mar 2012 | A1 |
20120087338 | Brandt et al. | Apr 2012 | A1 |
20120099621 | Karlsson et al. | Apr 2012 | A1 |
20120139782 | Gutt et al. | Jun 2012 | A1 |
20120144452 | Dyor et al. | Jun 2012 | A1 |
20120144457 | Counterman | Jun 2012 | A1 |
20120158289 | Brush et al. | Jun 2012 | A1 |
20120182180 | Wolf et al. | Jul 2012 | A1 |
20120182874 | Siomina et al. | Jul 2012 | A1 |
20120185309 | Kakarla et al. | Jul 2012 | A1 |
20120214509 | Levin et al. | Aug 2012 | A1 |
20120287911 | Takano et al. | Nov 2012 | A1 |
20120302254 | Charbit et al. | Nov 2012 | A1 |
20120317500 | Kosseifi et al. | Dec 2012 | A1 |
20120323703 | Hillier et al. | Dec 2012 | A1 |
20120327869 | Wang et al. | Dec 2012 | A1 |
20130007058 | Meredith et al. | Jan 2013 | A1 |
20130023237 | Meredith et al. | Jan 2013 | A1 |
20130023247 | Bolon et al. | Jan 2013 | A1 |
20130023274 | Meredith et al. | Jan 2013 | A1 |
20130023281 | Meredith et al. | Jan 2013 | A1 |
20130053057 | Cansino et al. | Feb 2013 | A1 |
20130066748 | Long | Mar 2013 | A1 |
20130095861 | Li et al. | Apr 2013 | A1 |
20130096966 | Barnes | Apr 2013 | A1 |
20130109407 | Tipton et al. | May 2013 | A1 |
20130114464 | Tarraf et al. | May 2013 | A1 |
20130137464 | Kramer et al. | May 2013 | A1 |
20130226451 | O'Neill et al. | Aug 2013 | A1 |
20130281111 | Syrjarinne et al. | Oct 2013 | A1 |
20130324149 | Fix et al. | Dec 2013 | A1 |
20130337824 | Meredith et al. | Dec 2013 | A1 |
20140062782 | Abraham | Mar 2014 | A1 |
20140106779 | Arslan et al. | Apr 2014 | A1 |
20140122220 | Bradley et al. | May 2014 | A1 |
20140171060 | Cook et al. | Jun 2014 | A1 |
20140278744 | Lo Faro et al. | Sep 2014 | A1 |
20140295881 | Werner et al. | Oct 2014 | A1 |
Number | Date | Country |
---|---|---|
0856746 | Aug 1998 | EP |
1145526 | Oct 2001 | EP |
2004069609 | Mar 2004 | JP |
2005091303 | Apr 2005 | JP |
2007328050 | Dec 2007 | JP |
WO2006031035 | Mar 2006 | WO |
Entry |
---|
Office Action dated Mar. 11, 2016 for US. Appl. No. 14/743,076, 86 pages. |
Notice of Allowance dated Mar. 16, 2016 for U.S. Appl. No. 14/520,287, 23 pages. |
Office Action dated Mar. 18, 2016 for US. Appl. No. 13/447,072, 37 pages. |
Office Action dated Apr. 5, 2016 for U.S. Appl. No. 13/188,136, 33 pages. |
Office Action dated Apr. 13, 2016 for U.S. Appl. No. 14/877,915, 76 pages. |
Office Action dated May 17, 2016 for U.S. Appl. No. 15/074,622, 18 pages. |
Office Action dated Jun. 10, 2016 for U.S. Appl. No. 14/548,901, 33 pages. |
Office Action dated Jun. 22, 2016 for U.S. Appl. No. 14/970,533, 84 pages. |
Office Action dated Jun. 28, 2016 for U.S. Appl. No. 15/132,220, 17 pages. |
Notice of Allowance dated Jul. 19, 2016 for U.S. Appl. No. 14/952,609, 99 pages. |
Office Action dated Aug. 24, 2016 for U.S. Appl. No. 14/676,066, 107 pages. |
Office Action dated Aug. 25, 2016 for U.S. Appl. No. 13/447,072, 38 pages. |
Office Action dated Apr. 8, 2014 for U.S. Appl. No. 13/175,199, 52 pages. |
Office Action dated Apr. 23, 2014 for U.S. Appl. No. 13/291,917, 29 pages. |
Office Action dated Apr. 22, 2014 for U.S. Appl. No. 13/447,069, 51 pages. |
Office Action dated Sep. 20, 2012 for U.S. Appl. No. 12/870,254, 29 pages. |
Office Action dated May 14, 2014 for U.S. Appl. No. 13/660,689, 62pages. |
Office Action dated May 9, 2014 for U.S. Appl. No. 13/188,136, 33 pages. |
Squires, “Practical Physics”, Cambridge University Press, p. 12, 1986, 3 pages. |
Represent (2000). In Collins English dictionary. Retrieved on May 9, 2014 from http://search.credoreference.com/content/entry/hcengdict/represent/0, 2 pages. |
Represent. (2001). In Chambers 21 st century dictionary. Retrieved on May 9, 2014 from http://search.credoreference.com/content/entry/chambdict/represent/O. |
Represent. (2011). In the american heritage dictionary of the english language. Retrieved on May 9, 2014 from http://search.credoreference.com/content/entry/hmdictenglang/represent/0. |
Office Action dated May 20, 2014 for U.S. Appl. No. 13/551,369, 29 pages. |
Office Action dated May 30, 2014 for U.S. Appl. No. 13/277,595, 49 pages. |
Office Action dated Jun. 3, 2014 for U.S. Appl. No. 13/523,770, 53 pages. |
Office Action dated Jun. 6, 2014 for U.S. Appl. No. 13/447,072, 25 pages. |
Office Action dated Apr. 3, 2014 for U.S. Appl. No. 13/188,295, 37 pages. |
Office Action dated Jun. 18, 2014 for U.S. Appl. No. 13/305,276, 26 Pages. |
Office Action dated Jun. 26, 2014 for U.S. Appl. No. 13/557,425, 24 pages. |
Office Action dated Jun. 30, 2014 for U.S. Appl. No. 13/305,267, 44 pages. |
Office Action dated Jul. 22, 2014 for U.S. Appl. No. 12/958,146, 38 pages. |
Notice of Allowance dated Jul. 22, 2014 for U.S. Appl. No. 13/525,065, 82 Pages. |
Notice of Allowance dated Jul. 7, 2014 for U.S. Appl. No. 13/188,295, 51 pages. |
Notice of Allowance dated Jul. 22, 2014 for U.S. Appl. No. 13/188,300, 49 Pages. |
Office Action dated Aug. 8, 2014 for U.S. Appl. No. 13/284,497, 48 pages. |
Office Action mailed Nov. 30, 2015 for U.S. Appl. No. 13/447,072, 45 pages. |
Office Action mailed Dec. 18, 2015 for U.S. Appl. No. 14/548,901, 35 pages. |
Office Action mailed Dec. 31, 2015 for U.S. Appl. No. 14/952,609, 32 pages. |
Office Action mailed Dec. 1, 2015 for U.S. Appl. No. 13/526,988, 43 pages. |
Office Action dated Jan. 11, 2016 for U.S. Appl. No. 13/175,199, 29 pages. |
Office Action dated Sep. 30, 2016 for U.S. Appl. No. 14/957,525, 72 pages. |
Notice of Allowance mailed Oct. 7, 2016 for U.S. Appl. No. 14/548,901, 45 pages. |
Office Action dated Oct. 12, 2016 for U.S. Appl. No. 14/877,915, 34 pages. |
Notice of Allowance mailed Nov. 16, 2016 for U.S. Appl. No. 15/186,410, 80 pages. |
Office Action dated Dec. 28, 2016 for U.S. Appl. No. 13/447,072, 34 pages. |
Notice of Allowance mailed Aug. 12, 2013, for U.S. Appl. No. 13/174,541, 40 pages. |
Office Action dated Aug. 2, 2013, for U.S. Appl. No. 13/188,295, 26 pages. |
Office Action dated Aug. 2, 2013, for U.S. Appl. No. 13/188,300, 38 pages. |
Office Action dated Jun. 20, 2013, for U.S. Appl. No. 13/219,911, 61 pages. |
Office Action dated Jul. 17, 2013, for U.S. Appl. No. 13/188,345, 27 pages. |
Office Action dated Jun. 20, 2013, for U.S. Appl. No. 13/291,917, 52 pages. |
Office Action dated May 31, 2013, for U.S. Appl. No. 13/523,770, 40 pages. |
Office Action dated Sep. 19, 2013, for U.S. Appl. No. 13/927,020, 30 pages. |
Office Action dated Oct. 2, 2013 for U.S. Appl. No. 12/958,146, 31 pages. |
Office Action dated Sep. 26, 2013 for U.S. Appl. No. 13/284,456, 58 pages. |
RouteFinder 3.00 for ArGIS Documentation, 2007, Routeware and Higher Mapping Solutions, 71 pages, downloaded from http://www.routeware.dk/download/routefinder—arcgis.pdf. |
MySociety (Web page), “More travel-time maps and their uses”, 2007, downloaded from http://www.mySociety.org/2007/more-travel-maps/, 10 pages total (including a single page Examiner's attachment showing the operation of the interactive travel-time map). |
Wayback machine archive from Jan. 21, 2009 of the mySociety Web page, “More travel-time maps and their uses”, downloaded from http://web.archive.org/web/20090121193615/http://www.mysociety.org/2007/more-travel-maps/, 11 pages. |
Street, Nicholas, “TimeContours: Using isochrone visualisation to describe transport network travel cost”, Final Report, Jun. 14, 2006, Department of Computing Imperial College London, 97 pages. Downloaded from http://www.doc.ic.ac.uk/teaching/projects/Distinguished06/nicholasstreet.pdf. |
Office Action dated Nov. 5, 2013 for U.S. Appl. No. 13/188,136, 47 pages. |
Office Action dated Sep. 18, 2013, for U.S. Appl. No. 13/284,497, 30 pages. |
Office Action dated Aug. 22, 2013, for U.S. Appl. No. 13/277,595, 36 pages. |
Office Action dated Oct. 21, 2013, for U.S. Appl. No. 13/523,770, 24 pages. |
Office Action dated Nov. 5, 2013 for U.S. Appl. No. 13/188,345, 30 pages. |
Office Action dated Dec. 11, 2013, for U.S. Appl. No. 13/188,295, 52 pages. |
Office Action dated Dec. 24, 2013, for U.S. Appl. No. 13/188,300, 44 pages. |
Office Action dated Dec. 11, 2013, for U.S. Appl. No. 13/291,917, 34 pages. |
Office Action dated Jan. 15, 2014 for U.S. Appl. No. 13/219,911, 38 pages. |
Office Action dated Jan. 28, 2014, for U.S. Appl. No. 12/958,146, 24 pages. |
Notice of Allowance dated Feb. 14, 2014 for U.S. Appl. No. 13/284,456, 30 pages. |
Office Action dated Feb. 24, 2014, for U.S. Appl. No. 13/927,020, 18 pages. |
Office Action dated May 21, 2013 for U.S. Appl. No. 13/305,276, 28 pages. |
Office Action dated Oct. 24, 2012 for U.S. Appl. No. 13/305,276, 37 pages. |
“Locate your friends in real time with Google Latitude.” http://googlemobile.blogspot.com/2009/02/locate-your-friends-in-real-time-with.html. Last accessed Mar. 8, 2012, 23 pages. |
“Location sharing and updating.” http://support.google.com/mobile/bin/answer.py?hl=en&answer=136647. Last accessed Mar. 8, 2012, 3 pages. |
“Privacy Settings.” http://support.google.com/mobile/bin/answer.py?hl=en&answer=136650, Last accessed Mar. 8, 2012, 1 page. |
Office Action dated Nov. 25, 2013 for U.S. Appl. No. 13/447,069, 40 pages. |
Office Action dated May 9, 2013 for U.S. Appl. No. 13/447,069, 33 pages. |
Tsai, et al, “Location-Sharing Technologies: Privacy Risks and Controls.” Feb. 2010. Retrieved on May 10, 2013, 26 pages. |
Li et al, “Sharing Location in Online Social Networks”. IEEE Network, Sep./Oct. 2010; 0890-8044/10/$25.00 (c)2010 IEEE. Retrieved on May 10, 2013, 6 pages. |
Tsai, et al, “Who's Viewed You? The Impact of Feedback in a Mobile Location-Sharing Application”. CHI 2009—Security and Privacy, Apr. 9, 2009—Boston, MA, USA. Retrieved on May 10, 2013, 10 pages. |
Pettersen, et al., “Automatic antenna tilt control for capacity enhancement in UMTS FDD.” Retrieved on Mar. 25, 2012, 5 pages. |
Islam, et al., “Self-Optimization of Antenna Tilt and Pilot Power for Dedicated Channels.” Retrieved on Mar. 25, 2012, 8 pages. |
Bigham, et al., “Tilting and Beam-shaping for Traffic Load Balancing in WCDMA Network.” Retrieved on Mar. 25, 2012, 4 pages. |
3GPP TS 25.215 V6.4.0 (Sep. 2005) Physical Layer Measurements. |
3GPP TS 25.431 V6.9.0 (Mar. 2006) RRC protocol for the UE-UTRAN radio interface. |
3GPP TS 25.413 V6.9.0 (Mar. 2006) UTRAN lu interface RANAP signalling. |
Calabrese, et al., “Real-Time Urban Monitoring Using Cell Phones: A Case Study in Rome”. IEEE Transactions on Intelligent Transportation Systems, 12 pages. (http://senseable.mit.edu/papers/pdf/2010—Calabrese—et—al—Rome—TITS.pdf). Retrieved on Sep. 29, 2012, 11 pages. |
Smith, et al., “Airsage Overview”, (http://mikeontraffic.typepad.com/files/raleigh-winter-2011-presentation-v-11-final.pdf) Retrieved on Sep. 29, 2012, 39 pages. |
Office Action dated Feb. 5, 2014 for U.S. Appl. No. 13/526,988, 56 pages. |
Marko Silventoinen, Timo Rantalainen, “Mobile Station Locating in GSM” Helsinki, Finland, Last accessed on Nov. 15, 2011, 7 pages. |
Office Action dated Dec. 30, 2013 for U.S. Appl. No. 13/305,267, 10 pages. |
Office Action dated Mar. 25, 2014 for U.S. Appl. No. 13/488,144, 60 Pages. |
Interview Summary dated Feb. 3, 2014 for U.S. Appl. No. 13/188,136, 10 pages. |
Rabinowitz, et al., A new positioning system using television synchronization signals, IEEE Transactions on Broadcasting, vol. 51(1), p. 51-61, Mar. 2005. |
Notice of Allowance dated Aug. 21, 2014 for U.S. Appl. No. 13/447,069, 78 pages. |
Office Action dated Aug. 28, 2014 for U.S. Appl. No. 13/526,988, 83 pages. |
Office Action dated Sep. 22, 2014 for U.S. Appl. No. 13/175,199, 62 pages. |
Office Action dated Oct. 17, 2014 for U.S. Appl. No. 13/204,535, 47 pages. |
Office Action dated Oct. 20, 2014 for U.S. Appl. No. 13/494,959, 64 pages. |
Office Action dated Oct. 22, 2014 for U.S. Appl. No. 13/557,425, 59 pages. |
office Action dated Aug. 11, 2014 for U.S. Appl. No. 14/279,176, 22 pages. |
Office Action dated Nov. 14, 2014 for U.S. Appl. No. 13/277,595, 74 pages. |
Notice of Allowance dated Nov. 20, 2014 for U.S. Appl. No. 13/866,909, 27 pages. |
Notice of Allowance dated Dec. 9, 2014 for U.S. Appl. No. 12/958,146, 48 pages. |
Office Action dated Dec. 11, 2014 for U.S. Appl. No. 13/447,072, 28 pages. |
Office Action dated Dec. 1, 2014 for U.S. Appl. No. 13/495,756, 76 pages. |
Office Action dated Jan. 7, 2015 for U.S. Appl. No. 13/557,425, 30 pages. |
Notice of Allowance mailed Jan. 21, 2015 for U.S. Appl. No. 13/495,391, 98 pages. |
Notice of Allowance mailed Feb. 6, 2015 for U.S. Appl. No. 13/204,535, 20 pages. |
Office Action dated Feb. 13, 2015 for U.S. Appl. No. 14/516,286, 62 pages. |
Girardin, et al., “Digital footprinting: Uncovering tourists with user generated content.” Pervasive Computing, IEEE 7.4, Oct.-Nov. 2008. 8 pages. |
Steinfield, “The development of location based services in mobile commerce.” ELife after the Dot Com Bust. PhysicaVerlagHD, 2004. 15 pages. |
Sevtsuk, et al., “Does urban mobility have a daily routine? Learning from the aggregate data of mobile networks.” Journal of Urban Technology, vol. 17, No. 1, Apr. 2010: 20 pages. |
Buhalis, et al., “Information communication technology revolutionizing tourism.” Tourism Recreation Research, vol. 30, No. 3, 2005. 10 pages. |
Ratti, et al. “Mobile Landscapes: using location data from cell phones for urban analysis.” Environment and Planning B: Planning and Design, vol. 33, 2006, 23 pages. |
Office Action dated Sep. 14, 2015 for U.S. Appl. No. 13/557,425, 32 pages. |
Office Action dated Apr. 16, 2015 for U.S. Appl. No. 14/521,431, 82 Pages. |
Notice of Allowance dated Mar. 19, 2015 for U.S. Appl. No. 13/494,959, 41 Pages. |
Notice of Allowance dated Mar. 26, 2015 for U.S. Appl. No. 14/276,688, 75 pages. |
Office Action dated May 1, 2015 for U.S. Appl. No. 13/557,425, 33 pages. |
Office Action dated May 14, 2015 for U.S. Appl. No. 14/530,605, 72 pages. |
Office Action dated Jun. 1, 2015 for U.S. Appl. No. 13/447,072, 38 pages. |
Office Action dated Jun. 2, 2015 for U.S. Appl. No. 14/516,286, 20 pages. |
Office Action dated May 20, 2015 for U.S. Appl. No. 13/526,988, 52 pages. |
Office Action dated Jun. 9, 2015 for U.S. Appl. No. 13/495,756, 35 pages. |
Notice of Allowance dated Jul. 8, 2015 for U.S. Appl. No. 14/548,901, 125 pages. |
Buford, et al, “Location Privacy Enforcement in a Location-Based Services Platform,” IEEE, 2009, 5 pages. |
Phillips, Jr., et al., “Information Sharing and Security in Dynamic Coalitions,” ACM, 2002, pp. 87-96, 10 pages. |
Moniruzzaman, et al., “A Study of Privacy Policy Enforcement in Access Control Models”, Proceedings of 13th International Conference on Computer and Information Technology IEEE, 2010, pp. 352-357, 6 pages. |
Office Action dated Jul. 22, 2015 for U.S. Appl. No. 13/188,136, 31 Pages. |
“CELL—DCH”, in Inacon Glossary, published online at [http://www.inacon.de/glossary/CELL—DCH.php] retrieved on Jul. 22, 2015, 1 page. |
Office Action dated Sep. 17, 2015 for U.S. Appl. No. 13/495,756, 23 Pages. |
Office Action dated Sep. 18, 2015 for U.S. Appl. No. 14/641,247, 69 Pages. |
Notice of Allowance dated Aug. 27, 2015 for U.S. Appl. No. 14/521,431, 39 Pages. |
Office Action dated Nov. 16, 2015 for U.S. Appl. No. 13/188,136, 31 pages. |
“Error”, The American Heritage(R) Dictionary of the English Language, 2011, Houghton Mifflin Company, Boston, MA, 2 pages. Retrieved from [http://search.credoreference.com/contentientry/hmdictenglang/error/O] on Nov. 16, 2015. |
Office Action dated Nov. 23, 2015 for U.S. Appl. No. 14/520,287, 80 pages. |
Office Action dated Nov. 16, 2015 for U.S. Appl. No. 14/566,657, 87 pages. |
3rd Generation Partnership Project, Technical Specification, “Group GSM/Edge Radio Access Network, Radio subsystem synchronization (Release 8)”, 3GPP TS 45.010 V8.0.0 (May 2008), last viewed Jul. 1, 2009, 30 pages. |
3rd Generation Partnership Project, Technical Specification, “Group Radio Access Network, UTRAN luh interface Home Node B Application Part (HNBAP) signalling (Release 8)”, 3GPP TS 25.469 V8.0.0 (Dec. 2008), last viewed Jul. 1, 2009, 56 pages. |
Sullivan, Mark. “Signs and Wonders: Is AT&T Stepping Up Its Game?” PC World, Dec. 10, 2009, 1 page. |
ETSI TS 125 215 V6.4.0 (Sep. 2005). Universal Mobile Telecommunications System (UMTS), Physical layer, Measurements (FDD), 3GPP TS 25.215 version 6.4.0 Release 6). Last accessed Jun. 18, 2010, 20 pages. |
ETSI TS 125 331 V6.9.0 (Mar. 2006). Universal Mobile Telecommunications System (UMTS), Radio Resource Control (RRC) protocol specification, (3GPP TS 25.331 version 6.9.0 Release 6). Last accessed Jun. 18, 2010, 1211 pages. |
New Devices Aim to Disable Cell Phones While Driving. FOXNews.com, Jan. 18, 2009. http://www.foxnews.com/printer—friendly—story/0,3566,480585,00.html. Last accessed Nov. 24, 2010, 2 pages. |
Cortes, et al. “Support-Vector Networks”, Machine Learning, 20, 1995. http://www.springerlink.com/content/k238jx04hm87j80g/fulltext.pdf. Last accessed Dec. 24, 2010, 25 pages. |
ACM Website, Press release of Mar. 17, 2009. http://www.acm.org/press-room/news-releases/pdfs/awards-08-groupa1.pdf. Last accessed Dec. 24, 2010, 3 pages. |
“Boser, et al. A training algorithm for optimal margin classifiers. In D. Haussler, editor, 5th Annual ACM Workshop on COLT, pp. 144-152, Pittsburgh, PA, 1992. ACM Press.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.121.3818. Last accessed Dec. 24, 2010, 9 pages.” |
“Hsu, et al. A Practical Guide to Support Vector Classification. Department of Computer Science National Taiwan University, Last updated: Apr. 15, 2010.http://www.csie.ntu.edu.tw/˜cjlin/papers/guide/guide.pdf. Last accessed Dec. 24, 2010, 16 pages.” |
“Drucker, et al. Support Vector Regression Machines.http://scholar.google.com/scholar?q=%22Support+Vector+Regression+Machines.%22. Last accessed Dec. 24, 2010, 7 pages.” |
Suykens, et al., “Least squares support vector machine classifiers”, Neural Processing Letters, vol. 9, No. 3, Jun. 1999, pp. 293-300. |
Ferris, et al (2002). “Interior-point methods for massive support vector machines”. SIAM Journal on Optimization 13: 783-804. doi:10.1137/S1052623400374379. |
Meyer, et al. “The support vector machine under test.” Neurocomputing 55(1-2): 169-186, 2003. |
International Search Report for PCT Application No. US2011/026122, dated Sep. 10, 2011, 11 pages. |
International Search Report for PCT Application No. US2011/026120, dated Sep. 9, 2011 13 pages. |
Charitanetra et al. “Mobile positioning location using E-OTD method for GSM network” Research and Development, 2003. Proceedings Student Conference on Putrajaya, Malaysia Aug. 25-26, 2003, pp. 319-324. |
“Location Labs Powers Location-based Fraud Detection”, All Points Blog, http://webcache.googleusercontent.com/search?hl=en&rtz=1R2GFRE—enUS398&q=cache:trsMn9Sin6wJ:http://apb.directionsmag.com/entry/location-labs-powers-location-based-fraud-detection/162802+http%3A//apb.directionsmag.com/entry/location-labs-powers-location-based-...1&ct=clnk, Oct. 12, 2010. |
“Location Based Fraud Detection”, Finsphere Corporation, 2008-2010. |
Fleishman. Using the Personal Hotspot on your AT & T iPhone. Published online Mar. 15, 2011. http://www.macworld.com/article/158556/2011/03/personal—hotspot—att . . . , 4 pages. |
Fleischfresser. Never Stop at a Red-Light Again. Published online Aug. 30, 2011. http://www.smartplanet.com/blog/..., 2 pages. |
Cellphone Networks and the Future of Traffic. Published online Mar. 2, 2011. http://m.wired.com/autopia/2011/03/cell-phone-networks-and-the-future-...15 pages. |
Intelligent Transportation System. Published online http://en.wikipedia.org/wiki/Intelligent—transportation—system, retrieved on Aug. 15, 2011, 7 pages. |
Koukoumidis Emmanouil, Peh Li-Shiuan, Martonosi Margaret, SignalGuru: Leveraging Mobile Phones for Collaborative Traffic Signal Schedule Advisory, MobiSys'11, Jun. 28-Jul. 1, 2011, Bethesda, Maryland, USA. 14 pages. |
Bitcarrier Technology. Published online at http://www.bitcarrier.com/technology, retreived on Aug. 15, 2011, 1 page. |
Hao Peng, Ban Xuegang(Jeff). Estimating Vehicle Position in a Queue at Signalized Intersections Using Simple Travel Times from Mobile Sensors, retrieved Nov. 18, 2011 6 pages. |
Ban Xuegang(Jeff), Gruteser Marco. Mobile Sensor as Traffic Probes: Addressing Transportation Modeling and Privacy Protection in an Integrated Framework. Dated Jan. 10, 2010. 17 pages. |
Office Action dated Dec. 28, 2011 for U.S. Appl. No. 12/836,471, 34 pages. |
Office Action dated Feb. 23, 2012 for U.S. Appl. No. 12/967,747, 31 pages. |
Office Action dated Dec. 15, 2011 for U.S. Appl. No. 12/712,424, 34 pages. |
Office Action dated Apr. 13, 2012 for U.S. Appl. No. 12/416,853, 36 pages. |
Office Action dated Oct. 2, 2012 for U.S. Appl. No. 13/554,285, 19 pages. |
Office Action dated Aug. 30, 2012 for U.S. Appl. No. 12/958,146, 40 pages. |
MobileLutions Introduces MobiLoc-A Breakthrough Technology to Control Texting in the Mobile Workplace. Press release Oct. 10, 2010 by MobileLutions. 2 pages. |
DriveAssist Frequently Ask question by Aegis Mobility, Wayback archive Jul. 12, 2010, 2 pages. |
Office Action dated Jul. 30, 2012 for U.S. Appl. No. 12/967,747, 28 pages. |
Office Action dated Jul. 17, 2012 for U.S. Appl. No. 13/220,083, 57 pages. |
Office Action dated Sep. 11, 2012 for U.S. Appl. No. 13/188,345, 44 pages. |
Office Action dated Oct. 15, 2012 for U.S. Appl. No. 13/523,778, 21 pages. |
Office Action dated Dec. 20, 2012 for U.S. Appl. No. 12/958,146, 23 pages. |
Office Action dated Dec. 28, 2012 for U.S. Appl. No. 13/188,295, 37 pages. |
Office Action dated 01-03-13 for US Application No. 13/188,300, 36 pages. |
Office Action dated Nov. 8, 2012 for U.S. Appl. No. 13/204,535, 30 pages. |
Office Action dated Jan. 25, 2013, for U.S. Appl. No. 13/554,285, 20 pgs. |
Office Action dated Mar. 19, 2013, for U.S. Appl. No. 13/174,541, 46 pgs. |
Office Action dated Feb. 13, 2013, for U.S. Appl. No. 13/220,083, 48 pgs. |
Office Action dated Feb. 22, 2013, for U.S. Appl. No. 13/188,345, 45 pgs. |
Office Action dated Mar. 15, 2013, for U.S. Appl. No. 13/204,535, 18 pgs. |
Office Action dated Mar. 19, 2013, for U.S. Appl. No. 13/284,497, 46 pgs. |
Office Action dated Apr. 19, 2013, for U.S. Appl. No. 13/277,595, 58 pages. |
Office Action dated Jan. 13, 2017 for U.S. Appl. No. 14/601,800, 95 pages. |
Office Action dated Jan. 26, 2017 for U.S. Appl. No. 14/877,915, 20 pages. |
Office Action dated Feb. 14, 2017 for U.S. Appl. No. 14/641,242, 120 pages. |
Office Action dated Feb. 15, 2017 for U.S. Appl. No. 15/191,877, 104 pages. |
Office Action dated Feb. 27, 2017 for U.S. Appl. No. 15/132,220, 91 pages. |
Notice of Allowance dated Apr. 10, 2017 for U.S. Appl. No. 14/676,066, 33 pages. |
Number | Date | Country | |
---|---|---|---|
20160014608 A1 | Jan 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14636097 | Mar 2015 | US |
Child | 14864833 | US | |
Parent | 13284497 | Oct 2011 | US |
Child | 14636097 | US |