Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are incorporated by reference under 37 CFR 1.57 and made a part of this specification.
The present disclosure relates to the field of for-hire vehicles such as taxis, limousines, shuttles, buses or any other vehicle that provides shared transportation or transports one or more passengers between locations of the passengers' choice.
A for-hire vehicle (FHV) generally charges fares based on several variables. The variables may include the distance traveled, the time spend traveling, the number of passengers hiring the FHV, etc. The cost associated with each of these variables is often set by a regulatory agency that regulates the for-hire vehicles (“FHVs”) within its jurisdiction of control. Typically, the jurisdiction of control corresponds to a city or metro area, however, in some cases it may be a county, several counties, or even an entire state. Regulatory agencies may also issue licenses to operate FHVs within their jurisdiction of control. The licenses may correspond to a timeframe, such as a year, or they may permit the operation of a FHV only within a particular area within the jurisdiction of control. In some jurisdictions, medallions corresponding to the license may be issued. The medallions may be affixed to the FHV and indicate type of license associated with the FHV.
The calculation of fares for a trip in a FHV is typically done by a meter. A meter is programmed with the variables used to calculate the fare along with the values associated with those variables that the regulatory agency has determined. When a FHV is hired for a trip, the meter is typically started and then when the trip is over the meter is stopped. In most cases the fare amount is displayed in real time via a display that is part of the meter. Currently meters are separate devices that are affixed to a FHV. FHV meters are programmed by the regulatory agency regulating the FHV to which the meter is affixed.
Unfortunately, the business of operating for-hire vehicles (“FHVs”) is susceptible to fraud. As a result, regulatory agencies seal FHV meters so that no one may tamper with the meter, or the data within the meter, without detection. Once the regulatory agency sets the fare rates for the meter, the entire meter is then locked with a physical seal that prevents, or shows evidence of, tampering. Once the meter is sealed, all components that are part of the meter, such as fare displays and receipt or trip sheet printers are also sealed. The physical sealing process makes updating rates particularly difficult. If the regulatory agency wishes to change rates, an agent of the regulatory agency must break the seal on each meter in the jurisdiction, perform the necessary updates, then reseal the meter. The update process can be very labor intensive as some regulatory agencies may regulate several thousand FHV meters, each of which needs to be manually opened, updated and resealed when updated. The process can also be rather expensive. Some regulatory agencies pass the cost of opening and resealing the meter onto the FHV fleet operator. In addition, the FHV fleet operator also incurs an opportunity cost by having to remove a FHV from the fleet so that its meter can be updated.
Since updating meters is time consuming and expensive, it tends to be done as little as possible. In some cases this may lead to missed revenue opportunities. For example, in some jurisdictions, if fuel prices increase substantially above the rate base, fleet owners may be allowed to help offset the fuel price increase by requesting that the regulatory agency permit a fuel surcharge. Fuel surcharges, however, are often temporary since they may only apply when fuel prices are unusually high. Thus, implementing a surcharge often requires two modifications to the meter; one modification to include the fuel surcharge when fuel prices increase, and a second when fuel prices return to the existing rate base. Thus, since the regulatory agencies generally bear the direct cost of updating the meters, they may resist implementation of fuel surcharges because the cost of implementing the surcharge (updating the meters) is charged against the agency's budget. Further, this cost may eventually be passed on to the consumer through higher regulatory agency fees. In addition, regulatory agencies may also wish to increase fares temporarily as a result of a special event in order to take advantage of period when FHV use may be high. Since a change in fares due to a special event is limited in duration, special event surcharges suffer the same problems as fuel surcharges; the cost of updating the fare information in the meter is often higher than the extra revenue that could be generated by incorporating the surcharge.
In addition, since the entire meter is sealed by the regulatory agency, repairs to the meter require an agent to reseal the meter before it is returned to service. Often times, the portion in need of repair is not related to the aspects of the meter that are regulated, such as calculation of fares. For example, if the display screen of the meter needs to be repaired or replaced, the meter must be resealed by the regulatory agency before the meter is returned to service even though the display screen may not be the portion of the meter which is subject to fraud. Since the meter must be resealed for every repair, meters are unnecessarily expensive to repair and may out of service longer than needed.
The present disclosure focuses on systems and methods for updating the parameters of a for-hire vehicle meter without requiring physically breaking the regulatory seal of the meter and then resealing the entire meter. The present disclosure describes embodiments that would allow for repair of the non-regulated portions of the FHV meter (such as a screen display) without requiring the regulatory agency to physically reseal the meter. In addition, the present disclosure describes embodiments that may allow the non-secure portions of the FHV meters to be moved from one FHV to another without requiring the intervention of a regulatory agency.
One embodiment of the disclosure describes a for-hire vehicle meter comprising a secured, tamper-evident portion. By separating the portions of the meter under regulatory control from the portions of the meter not under regulatory control, repairs to the meter may not require resealing of the entire meter. The secured, tamper-evident portion may comprise a tamper-evident, tangible, computer-readable medium storing software instructions for receiving updated FHV operating parameters, such as fare information. The received operating parameters may be sealed by the regulatory agency using a security protocol, such as encryption. The FHV meter comprises data for decrypting the operating parameters. Once decrypted, the FHV meter may store the operating parameters and operate according to the updated parameters. The tamper-evident portion of the meter may also comprise a tampering indicator. The tamper indicator may indicate a first state when someone has tampered with the meter, such as when someone has attempted to load non-regulatory, unapproved operating parameters onto the meter. The tamper indicator may also indicate a second state when no one has tampered with the meter.
The present disclosure also describes a method for updating the operating parameters of a for-hire vehicle (“FHV”) meter or computer system, whereby a computer system for defining FHV operating parameters generates a data packet that is distributed to one or more FHV meters. The computer system may allow for the definition, maintenance, and modification of FHV parameters. The computer system may also maintain data associated with the one or more FHV meters, including data uniquely identifying the meters. The computer system may also have access to a security protocol of the FHV meters that is used by the FHV meters to decrypt data. When the operator of the computer system wishes to update the operating parameters of the FHV meters, it may generate a data packet containing the new parameters. The computer system may then secure the data packet according to the security protocol of the FHV meter. Once the data packet has been generated and secured, it may then be distributed to the FHV meter for which it is intended.
Embodiments of the disclosure will now be described with reference to the accompanying figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the disclosure. Furthermore, embodiments of the disclosure may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the embodiments of the disclosure herein described.
For-hire vehicle (FHV) parameters may include, for example, values defining fees based on time and distance traveled. In one embodiment, the FHV parameters may include a distance increment type value indicating the type of distance increment for which fares should be calculated such as, for example, meters, kilometers, or miles. FHV parameters related to defining fees based on time and distance traveled may also include a distance increment indicating the increment of the distance type to calculate fares. For example, the increment may be 0.5 of a mile, or 100 meters, or alternatively, 0.1 kilometers. The parameters may also include a fee value per distance increment, such as, for example $0.50. Several parameters may be combined to define the fees based on time and distance traveled for a particular trip taken by a FHV. For example, the distance increment type may be miles, the distance increment may be 0.125 of a mile, and the fee per distance traveled may be $0.25. Thus, if a passenger used a FHV vehicle for 0.5 miles, they maybe charged a $1.00 fare.
FHV parameters defining fees based on time and distance traveled may also include time related parameters. In one embodiment, the FHV parameter may include a time increment type, such as second or minute, that defines the type of time used to calculate time based fares. The FHV parameters may also include a time increment such as 1 second or 0.5 minutes. In one embodiment, a fee per time value may also be among the FHV parameters. For example, a fee per time value (such as $26) may be associated with a particular time increment type (such as hours) and time increment (such as 1 hour), resulting in a fee per time value of $26 per 1 hour. In one embodiment, time based parameters may be used in lieu of distance based parameters. This may occur for example in a FHV that operates based on a fixed tariff such as a limousine. In other embodiments, time based parameters may be used in conjunction with distance based parameters. In other embodiments, time based parameters may only be used during times when a FHV is hired but not moving, and distance based parameters may be used when the vehicle is moving. The FHV parameters may include, in such embodiments, a value indicating how time and distance parameters are to be used in relationship to each other. For example, in one embodiment the time-distance relationship parameter may be “distance only” or it may be “time at idle.” In other embodiments, numeric values may be used instead of string values.
In some embodiments, regulations affecting for-hire vehicles (“FHVs”) may set special fares based on a geospatial point. The special fare may affect the time and distance-traveled parameters, or it may be an additional flat fare added to the regular time and distance-traveled parameters. For example, in one embodiment, there may be a special rate based on a geospatial point corresponding to the airport. The fee may be, for example, $2.00. Thus, in such embodiments, $2.00 may be added to a fare when a passenger using the FHV is picked up at the airport. In other embodiments, the geospatial point may affect the time and distance-traveled parameters. For example, if a passenger is picked up at the airport, they may be charged a fare of $0.32 per half kilometer as opposed to $0.30 per half kilometer.
In some embodiments, the FHV parameters define variable operating cost surcharges. In some embodiments, variable operating cost surcharges may be applied by a regulatory agency to help offset an unexpected cost to the FHV operator. For example, a fuel surcharge may be added to fares in order to offset unexpected rise in fuel prices. The FHV parameters may define the surcharge as a flat surcharge (one charge per fare) or as an additional per-distance surcharge (for example, and extra $0.05 per mile). In one embodiment the FHV parameters relating to variable operating cost surcharges may indicate a surcharge type. The surcharge type may in some embodiments be a string, such as “flat” or “per-distance.”
The FHV parameters may also include a parameter indicating a surcharge for fare initiation or fare termination. A fare initiation fee may be a one time fee that is charged at the start of a fare, or trip. If, for example, the fare initiation fee is $2.35, a passenger might be charged at least $2.35 for the trip. As the trip progresses, the passenger may be charged additional time and distance-traveled fees according to other FHV parameters stored on the FHV meter.
In some embodiments, for-hire vehicle (“FHV”) parameters may be grouped together. In such embodiments, group-FHV parameters may apply to a collection of FHV parameters to indicate that they are to apply only when the conditions of the group-FHV parameters are met. For example, in some embodiments, it may be desirable to limit the application of FHV parameters to a specific period of time. In such embodiments, there may be additional group-FHV parameter indicating the start time and/or end time for the set of FHV parameters. For example, special rates may apply to weekends, holidays or special events. Accordingly, the FHV parameters may be include a start date and end date that correspond to the weekend, holiday or special event. In other embodiments, it may be desirable to define FHV parameters for mutually exclusive geospatial regions within the FHV's operating region. For example, suppose a FHV serves a north region and south region. The north region may be larger and less developed than the south region. As a result, when a FHV makes a trip from the airport into the north region, there is low likelihood that the FHV will be able to pick up another passenger in the north region to bring back to the airport. Accordingly, fare rates for the north region may be higher than for the south region where the FHV is more likely to pick up another passenger quickly. In this example, FHV parameters for the north region may be different from FHV parameters from the south region. The north region's FHV parameters may be grouped by one group-FHV parameter defining a first geospatial polygon (the north region) and the south region's FHV parameters may be grouped by a different group-FHV parameter defining a second geospatial polygon (the south region).
Returning to
In one embodiment, parameter maintenance computer system 120 may be a computer system operated by an entity responsible for the regulation of for-hire vehicles. For example, parameter maintenance computer system 120 may be operated by New York City Taxi and Limousine Commission or the Nevada Taxi Cab Authority. In another embodiment, parameter maintenance computer system 120 may be operated by a company that operates a fleet of for-hire vehicles (“FHVs”). The company may operate in a jurisdiction that allows the update of for-hire vehicles by fleet companies as opposed to a regulatory agency.
In one embodiment, the FHV parameters may be distributed over distribution network 130. Distribution network 130 may be, in some embodiments, a computer network. Depending on the embodiment, distribution network 130 may comprise one or more of any type of network, such as one or more local area networks, wide area networks, personal area networks, telephone network, and/or the Internet, which may be accessed via any available wired and/or wireless communication protocols. Thus, distribution network 130 may comprise a secure LAN through which FHV meter 100 and parameter maintenance computer system 120 may communicate, and distribution network 130 may further comprise an Internet connection through which FHV meter 100 and parameter maintenance computer system 120 communicate. Any other combination of networks, including secured and unsecured network communication links, are contemplated for use in the systems described herein.
In another embodiment, distribution network 130 may utilize manpower and non-transitory tangible computer readable media to distribute FHV parameters from parameter maintenance system 120 to FHV meter 100. For example, parameter maintenance system 120 may write the FHV parameters to a portable non-transitory computer medium such as a floppy disk, USB flash drive, memory card, portable hard drive, etc. A person may then distribute the FHV parameters to FHV meters 100, 101 and 102 by physically connecting the computer readable medium to each FHV meter in the network. Once connected, FHV meter 100 may then read the FHV parameters from the computer readable medium and configure itself accordingly.
In one embodiment, security breach messages may be sent from FHV meters 100, 101 and 102 to parameter maintenance computer system 120. In such embodiments, FHV meters 100, 101 and 102 may comprise a wireless transmitter and distribution network 130 may be a wireless network as described above. When FHV meters 100, 101 and 102 detect a security breach, they may generate a security breach message and transmit it via distribution network 130 to parameter maintenance computer system 120. In some embodiments, parameter maintenance computer system 120 may send a “kill” message to a FHV meter from which parameter computer system 120 has received a security breach message, providing an extra layer of security. In other embodiments, parameter maintenance computer system may issue a warning, such as graphical display, email alert, electronic alert, etc, upon receipt of a security breach message. Conditions triggering a security breach message are described in more detail with respect to
In one embodiment, FHV meter 100 is configured to interface with multiple devices and/or data sources, such as in the exemplary network of
In one embodiment, FHV meter 100 comprises secure tamper evident segment (“secure segment”) 205. Secure segment 205 represents the components and modules of FHV meter 100 that must be secure from tampering, or show evidence of tampering, in order to abide by the regulations and laws governing for-hire vehicles (“FHVs”). In some embodiments, secure segment 205 may be self destructing, that is, if someone tampers with secure segment 205, the components and modules of secure segment 205 will no longer operate. For example, the storage medium storing software instructions for the modules of secure segment may break, or split, if there is an attempt to remove the storage medium from FHV meter 100. In other embodiments, if someone tampers with secure segment 205, FHV meter 100 might send a signal to parameter maintenance computer system 120 containing a security breach message. In one embodiment, the degree of tampering detected may advantageously signal different levels of response. For example, if the tampering is physical or certain (for example a secure component is removed or replaced), FHV meter 100 might automatically shut down. If the tampering is only likely but not certain (for example a signal security check is invalid) then a security breach message indicating a warning signal might be triggered so that the regulatory agency or fleet owner can inspect the meter.
In some embodiments, secure segment 205 may be fixed to the FHV. In such embodiments, the portions of FHV meter 100 that are not in secure segment 205 (“unsecure portion”) may be removed from the FHV for necessary repairs. In some embodiments, the unsecure portion may be housed in one casing allowing for easy removal from the FHV for repair or updates. This may allow, for example, the driver to remove the unsecured portion from the for-hire vehicle when it is not in operation in order to prevent theft. The driver may then reconnect the unsecure portion on his next shift without requiring the oversight of a regulatory agency. In other embodiments, the individual components of the unsecure portion may be removed. In some embodiments, the unsecure portion may be the same for every FHV meter in the exemplary network configuration of
In some embodiments, secure segment 205 and the unsecure portion may be connected via a custom interface such as interface 255. The interface may comprise, in some embodiments, a unique shape or design such that only an unsecure portion and a secure segment 255 of the same make or model may be connected. For example, the unsecure portion may comprise an interface in the shape a male “T” shape and the secure segment may comprise an interface 255 of a female “T” shape.
In one embodiment, a visual indicator of tampering may be adhered to the components of secure segment 205 so that if someone tampers with secure segment 205, the indicator will be broken. The visual indicator may indicate one state when no one has tampered with secure segment 205, and another state when someone has tampered with it. For example, self destructing tape may be used to wrap the physical portions of secure segment 205 so that if they are changed or replaced the tape breaks. The tape may indicate a first state (un-torn) when no tampering with secure segment 205 has occurred. The tape may indicate a second state, (torn) when tampering has occurred. In another embodiment, secure segment 205 may be implemented via a software module. The module may monitor reads and writes to and from the modifiable data stores of secure segment 205 such as operating parameters data store 270. When an unauthorized read or write occurs to operating parameters data store 270, the module may notify another module in FHV meter, or in other embodiments, may trigger a visual indicator that can be visually inspected. For example, if FHV meter is implemented as a dedicated computer system attached to a FHV, FHV meter may have a light that is green when no unauthorized reads or writes has occurred. Upon detection of a unauthorized write, the monitoring module may command the light to change to red, indicating that the secure segment has been compromised.
In general, the word module, as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions stored on a non-transitory, tangible computer-readable medium, possibly having entry and exit points, written in a programming language, such as, for example, C, C++, C#, or Java. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules may be stored in any type of computer-readable medium, such as a memory device (e.g., random access, flash memory, and the like), an optical medium (e.g., a CD, DVD, BluRay, and the like), firmware (e.g., an EPROM), or any other storage medium. The software modules may be configured for execution by one or more CPUs in order to cause FHV meter 100 to perform particular operations.
It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
In one embodiment, FHV meter 100, includes a dedicated computer that is IBM, Macintosh or Linux/Unix compatible. In another embodiment, FHV meter 100 may be a customized computing device configured only to operate as a meter in a for-hire vehicle. In another embodiment, FHV meter 100 may be a module that is part of the internal computing system of the for-hire vehicle. FHV meter 100 may, in some embodiments, include one or more central processing units (“CPU”) 210, which may include one or more conventional or proprietary microprocessors. FHV meter 100 may further include memory 215, such as random access memory (“RAM”) for temporary storage of information and read only memory (“ROM”) for permanent storage of information, and general data store 220, such as a hard drive, diskette, or optical media storage device. In certain embodiments, general data store 220 stores data needed for the basic functioning of FHV meter. In other embodiments, general data store 220 might store historical trip information. Embodiments of general data store 220 may store data in databases, flat files, spreadsheets, or any other data structure known in the art. Typically, the modules of FHV meter 100 are in communication with one another via a standards based bus system. In different embodiments, the standards based bus system could be Peripheral Component Interconnect (PCI), Microchannel, SCSI, Industrial Standard Architecture (ISA) and Extended ISA (EISA) architectures, for example. In another embodiment, FHV meter 100 leverages computing and storage services available over the Internet (cloud computing).
In one embodiment, general data store 220 contains a data structure, or data element, that uniquely identifies the FHV meter. In some embodiments, the data element may be an integer that represents the serial number of the FHV meter. In other embodiments, the data element may be a string or a character array that is unique to the FHV meter. For example, the data element might be 12345678 or “09GTR67RXY.” In other embodiments, the unique identifier may be an object or a data structure with several elements that when combined represent a unique identifier for the FHV meter. For example, the make and model of the FHV meter, combined with the license plate number and registration state of the FHV may be used in combination to uniquely represent the FHV meter.
FHV meter 100 is generally controlled and coordinated by operating system software, such as the Windows 95, 98, NT, 2000, XP, Vista, Linux, SunOS, Solaris, PalmOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In another embodiment, FHV meter 100 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, and I/O services, and may provide a user interface, such as a graphical user interface (“GUI”) for display, among other things.
FHV meter 100 may include, in some embodiments, device calculation device 230 for calculating the distance traveled by the FHV. Device calculation device may be a separate computer system from FHV meter 100, or as in the embodiment depicted in
FHV meter 100 may include one or more commonly available I/O devices and interfaces 240, such as for example, a printer, buttons, a keyboard, a LED display, a monitor, a touchpad, a USB port, a RS 232 port and the like. In one embodiment, I/O devices and interfaces 240 include one or more display devices, such as a monitor, that allows the visual presentation of data, such as fare and operation data, to a user. In the embodiment of
In one embodiment, the FHV meter may have geospatial recognition module 250. Geospatial recognition module 250 may include a GPS receiver for receiving GPS coordinates from GPS satellites. In some embodiments, the GPS coordinates received from geospatial recognition module 250 may used to calculate fares based on FHV parameters stored in operating parameters data store 270.
Secure segment 205 of FHV meter 100 may, in some embodiments, include a private key 260. Private key 260 may be, in some embodiments, software instructions and/or data used to decrypt data. In one embodiment, private key 260 is hard-coded on firmware such as programmable read-only memory (“PROM”) and may be unique to the embodiment of FHV meter 100. In other embodiments, private key 260 may not be unique and may be the same in one or more embodiments of FHV meter 100. The PROM storing private key 260 may be self destructing if tampered with, that is, if the PROM is removed from the FHV, it will snap and self destruct. For example, epoxy may be placed over private key 260 such that it could not be removed from secure segment 205 without chipping or damaging private key 260.
In one embodiment, secure segment 205 of FHV meter may also include cipher engine module 270. Cipher engine module 270 may, in some embodiments, contain software instructions used to decipher coded or encrypted data packets containing FHV parameters. Cipher engine module 270 may use private key 260 to decrypt data packets received from distribution network 130. Cipher engine module 270 may also include software instructions for extracting FHV parameters and storing them in operating parameters data store 280. In some embodiments, cipher engine module 270 may be hard coded to firmware such as PROM. The PROM storing cipher engine module 270 may be self destructing if tampered with, that is, if the PROM is removed from the FHV, it will snap and self destruct. For example, epoxy may be placed over cipher engine module 270 such that it could not be removed from secure segment 205 without chipping or damaging it.
FHV meter 100 may also include operating parameters data store 280. Operating parameters data store 280 may, in some embodiments, store the operating parameters by which FHV meter 100 operates. For example, CPU 210 may access operating parameters data store 280 when calculating time-distance charges or determining surcharges. Operating parameters data store 280 may be, in some embodiments, a secure data store. In one embodiment, operating parameter data store 280 may only be accessed for writing by cipher engine module 270. Thus, while CPU 210 may access operating parameters data store 280 for reading FHV operating parameters, CPU 210 would not be able to perform write operations to operating parameters data store 280. Accordingly, FHV parameters cannot be changed by software instructions stored in general data store 220 or some other data store connected to FHV meter 100. This may, in some embodiments, be accomplished by only wiring the write pins of operating parameters data store 280 to the firmware containing the software instructions for cipher engine module 270. For example, operating parameters data store 280 may be a RAM chip whereby only cipher engine module 270 is connected to the write pins of the RAM. In some embodiments, operating parameter data store 280 may self destruct if someone tampers with the configuration. In other embodiments, operating parameter data store 280 may be physically connected to FHV with a tamper evident seal that indicates one state if someone tampers with operating parameter data store 280 and another state if no one has tampered with operating parameter data store 280.
FHV meter 100 may include secure memory 285 and secure CPU 290. Secure memory 285 may be a non-transitory, tangible, computer readable medium such as random access memory (“RAM”) for temporary storage of information and read only memory (“ROM”) for permanent storage of information. Secure memory 285 may store software instructions that cause secure 290 to perform the methods of the embodiments described herein. FHV meter 100 may also include, in some embodiments, transmitter 295. Transmitter 295 may be a wireless transmitter that sends messages over a network, such as distribution network 130. In one embodiment, transmitter 295 may only send signals and not receive signals from outside computer systems. In some embodiments, transmitter 295 may send signals generated by secure CPU 290 such as security breach messages, or in other embodiments, it may send data to parameter maintenance computer system 120 that parameter maintenance computer system 120 may process to detect tampering with FHV meter 100. In other embodiments, transmitter 295 may be able to receive certain security signals, such as a “kill” message sent by parameter maintenance computer system 120.
In one embodiment, the FHV meter may implement security measures to ensure that secure segment 205 remains in communication with the unsecure portions of FHV meter 100. The security measures may prevent instances of fraud where a person may attempt to replace either secure segment 205 or the unsecure portions of FHV meter 100 with a device intended to calculate fraudulent fares. In some embodiments, when the implemented security measure fails, CPU 210 or secure CPU 290 may initiate a shutdown sequence that causes FHV meter 100 to cease operating. In other embodiments, when the implemented security measure fails, CPU 210 may send a security breach message via I/O devices 240 that may be transmitted back to parameter maintenance computer system 120. In some embodiments, the transmission may be a wireless communication. In some embodiments, the security breach message may be transmitted from secure segment 205 by secure CPU 290 via transmitter 295. In other embodiments, the security breach message may be displayed on the monitor of FHV meter 100.
In one embodiment, the security measure may be implemented via a software handshake between secure CPU 290 and CPU 210. If the software handshake fails, then CPU 210 will shutdown causing FHV meter 100 to cease operation, or in other embodiments may transmit a security breach message to parameter computer system 120. The handshake starts with CPU 210 generating a key, or hash, that is stored in memory 215 and known to secure CPU 290. CPU 210 may then send the hash over to secure CPU 290. Secure CPU 290 may then increment, or otherwise modify the hash, according to an algorithm known both to CPU 210 and to secure CPU 290. Secure CPU 290 may store the incremented hash in secure memory 285 before sending it to CPU 210. Upon receipt of the incremented data, CPU 210 may then access the previously sent hash, increment it according to the algorithm, and compare the result to the data received from secure CPU 290. If the incremented data matches the result, the handshake continues whereby CPU 210 increments the data received from secure 290, stores it in memory 215, and then sends it to secure CPU 290. The process will repeat until either CPU 210 or secure CPU 290 receives a hash it was not expecting.
One example of the software handshake may be as follows: Both CPU 210 and secure CPU 290 are programmed with a handshake algorithm that increases the received hash value by 1. CPU 210 starts the handshake by generating “5”, storing “5” in memory 215 and then sending “5” to secure CPU 290. Secure CPU 290 receives “5” and determines if that is the known starting point for the handshake. Once secure CPU 290 determines that known starting point is correct, it generates “6” (5+1), stores “6” in secure memory 285 and then sends “6” to CPU 210. When CPU 210 receives “6”, it pulls the last sent hash out of memory 215, specifically, “5.” CPU 210 then applies the handshake algorithm to arrive at an expected value of “6.” Since the expected value of “6” matches the received value of “6”, CPU 210 repeats the process by generating a “7”, storing a “7” in memory 215 and then sending “7” to secure CPU 290. Secure CPU 290 receives “7” and pulls the last sent hash (“6”) out of secure memory 285, applies the algorithm (to arrive at “7”) and then compares the expected value (“7”) with the received value (“7”). If the code matches, the process repeats. If it anytime CPU 210 or secure CPU 290 do not receive the expected value, a shutdown sequence may commence rendering FHV meter 100 inoperable.
In one embodiment, instead of a software handshake, a double polling verification security measure may be employed. In this embodiment, CPU 210 may constantly poll secure CPU 290 for a first specific response. If CPU 210 ever receives a value it does not expect, it will cease operations of FHV meter 100. At the same time, secure CPU 290 may poll CPU 210 for a second specific response. If secure CPU 290 does not receive the expected response, it may also contain code that initiates a shut down sequence of FHV meter 100.
In another embodiment, an odometer check may be done as a security measure. In such embodiments, secure CPU 290 may receive data from distance calculation device 230 and secure memory 285 may store software instructions that estimates the odometer reading of the FHV to which FHV Meter 100 is attached. Also, CPU 210 may be programmed to periodically check the odometer of the vehicle to which the FHV meter is attached. In other embodiments, CPU 210 may be programmed to access odometer information from a third party computer system that maintains odometers readings of vehicles, such as Department of Motor Vehicles computer systems or CARFAX® computer systems. CPU 210 may then send the odometer value to secure CPU 290. Secure CPU 290 may then store the odometer reading in secure memory 285. In some embodiments, secure CPU 290 may then compare the odometer value received from CPU 210 with an estimated odometer value calculated from the previous odometer received from CPU 210. If the estimated odometer value varies substantially (for example, the difference is greater than 10% or 15%) from the odometer value received from CPU 210, secure CPU 290 may then initiate a shutdown sequence, or in other embodiments, send a security breach message to parameter maintenance computer system 120 via transmitter 295.
In some embodiments, data may be sent to parameter maintenance computer system 120 and it may use the data to determine if there has been tampering with secure segment 205. Parameter maintenance computer system 120 may be configured to receive data from a wireless transmitter connected to CPU 210 on the unsecure portion of the FHV meter and from transmitter 295 connected to secure CPU 290. Parameter maintenance computer system 120 may then compare the data received to data it was expecting to determine if FHV meter was subject to tampering. For example, parameter maintenance computer system 120 may receive a first predetermined numeric value or code from CPU 210 via I/O devices 240 and a second predetermined numeric value or code from secure CPU 290. Parameter maintenance computer system 120 may then compare the received values to a matched pair of expected values to determine if secure segment 205 is attached to the proper unsecure portion. For example, parameter maintenance computer system 120 may store the assignment of the unsecure portion to secure segment 205 based on the serial number CPU 210 and the serial number of secure CPU 290 as a pair of values. The pair of values indicates the assignment of unsecure portion to secure segment 205. On a periodic basis, CPU 210 may send to parameter maintenance computer system 120 a data message containing the serial number of the CPU via I/O devices 240. Secure CPU 290 may also send a message to parameter maintenance computer system 120 via transmitter 295 containing the serial number of secure CPU 290. Parameter maintenance computer system 120 may then compare the received values to the expected pair of values for the meter. If values do not match, parameter maintenance computer system 120, in one embodiment, may generate a “kill” message disabling the for-hire vehicle meter. In another embodiment, parameter maintenance computer system 120 may issue a warning message if the values do not match.
In one embodiment, parameter maintenance computer system 120 includes, for example, a server or a personal computer that is IBM, Macintosh, or Linux/Unix compatible. In another embodiment, parameter maintenance computer system 120 comprises a laptop computer, smart phone, personal digital assistant, or other computing device, for example. In one embodiment, the exemplary parameter maintenance computer system 120 includes one or more central processing units (“CPU”) 310, which may include one or more conventional or proprietary microprocessors. Parameter maintenance computer system 120 further includes a memory 315, such as random access memory (“RAM”) for temporary storage of information and a read only memory (“ROM”) for permanent storage of information, and a data store 320, such as a hard drive, diskette, or optical media storage device. In certain embodiments, data store 320 stores FHV meter data and one or more sets of FHV operating parameter data. Embodiments of data store 320 may store data in databases, flat files, spreadsheets, or any other data structure known in the art. Typically, the modules of parameter maintenance computer system 120 are in communication with one another via a standards based bus system. In different embodiments, the standards based bus system could be Peripheral Component Interconnect (PCI), Microchannel, SCSI, Industrial Standard Architecture (ISA) and Extended ISA (EISA) architectures, for example. In another embodiment, parameter maintenance computer system 120 leverages computing and storage services available over the Internet (cloud computing).
Parameter maintenance computer system 120 is generally controlled and coordinated by operating system and/or server software, such as the Windows 95, 98, NT, 2000, XP, Vista, Linux, SunOS, Solaris, PalmOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In another embodiment, parameter maintenance computer system 120 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, and I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.
The exemplary parameter maintenance computer system 120 may include one or more commonly available input/output (I/O) interfaces and devices 330, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 330 include one or more display devices, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. In the embodiment of
In the embodiment of
In one embodiment, FHV configuration module 340 may comprise software code executable by CPU 310 that handles the configuration of for-hire vehicles. In some embodiments, configuration of for-hire vehicles (“FHVs”) is done through the creation and modification of FHV operating parameters. In some embodiments, the FHV operating parameters may be defined as indicated above. In some embodiments, FHV operating parameters may be defined and modified through the use of a user interface generated by FHV configuration module 340. FHV configuration module 340 may generate a user interface and present it to a user of parameter maintenance system 120 so that the user may assign values to various FHV parameters. Once a user defines the parameters, they may be stored to data store 320 or they may be sent to data packet generation module 350.
In one embodiment, data packet generation module 350 may comprise software code executable by CPU 310 that handles the generation of data packets that may be deployed via distribution network 130 to FHV meters such as FHV meter 100. The generation of the data packet may be in a format the FHV meter can interpret. For example, the data packet may be an XML file, text file, serialized object, COM object, byte stream, or any other data format known in the art. The data packet generation module 350 may generate a data packet unique to the target FHV meter. In other embodiments, data packet generation module 350 may generate a data packet that may be used by several different FHV meters.
Next, in box 420 parameter maintenance computer system 120 generates data packets for distribution or deployment to FHV meter 100. The data packets generated by parameter maintenance computer system 120 may contain the FHV operating parameters received in box 410. In one embodiment, several FHV parameters are included in a data packet. A data packet may be, in some embodiments, the group of FHV operating parameters that are to be distributed to a particular FHV meter. In one embodiment, parameter maintenance computer system 120 may generate a different data packet for each FHV meter in distribution network 130. In other embodiments, it may generate a data packet for more than one FHV meter in the distribution network. In such embodiments, the FHV meters of distribution network 130 may share the same private key for decryption purposes.
In one embodiment, each generated data packet contains a header. The header may contain metadata used by FHV meters in distribution network 130 containing a unique identifier corresponding to the FHV meter that should read the data packet. For example, if parameter maintenance computer system 120 generates a data packet for FHV meter 123456578, the data packet might contain metadata indicating that the data packet is for FHV meter 12345678. The metadata of the header may be configured to match the unique identifier scheme of the FHV meters in distribution network 130.
In some embodiments, the data packet may be generated by parameter maintenance computer system 120 as an XML file. The root node of the XML file may correspond to metadata. For example, the root node may contain the unique identifier of the FHV meter for which the data packet was generated. The first child nodes of the root node (“second level nodes”) may correspond to one or more group-FHV operating parameters. The second level nodes may, for example, define the validity duration of a group of FHV operating parameters, or in other embodiments, geospatial validity of a group of FHV operating parameters. The child nodes of the second level nodes (“third level nodes”) may contain FHV operating parameters such as time and distance-traveled parameters, geospatial point parameters, variable operating cost surcharge parameters, fare initiation parameters or fare termination parameters. In other embodiments, the data packet may be generated as a text file, serialized object, data stream, or any other data format known in the art suitable for transferring data between computer systems. In some embodiments, the data packet may not be hierarchal, but instead defined in a flat structure with a series of name-value pairs indicating the various FHV parameters and their associated values.
In box 430, parameter maintenance computer system 120 seals and secures the data packets generated in box 420. In one embodiment, parameter maintenance computer system 120 seals and secures the data packets using an asymmetrical encryption means such as public-private key encryption. In such embodiments, parameter maintenance computer system 120 may encrypt the data packet based on a public key associated with FHV meter 100. In some embodiments, the public key of FHV meter 100 may be unique to the FHV meter. For example, FHV meter with serial number 123 may have a different public key than FHV meter with serial number 987. In other embodiments, the public key for more than one FHV meter may be the same. For example, all of the FHV meters of a particular manufacturer, or for a particular for-hire vehicle fleet operator, may share the same public key. Parameter maintenance computer system 120 may seal and secure the data packets by using a standard encryption algorithm such as for example, Data Encryption Standard (DES), Advanced Encryption Standard (ADS), Pretty Good Privacy (PGP), International Data Encryption Algorithm (IDEA), Blowfish, RCS, CAST, etc. One skilled in the art can appreciate that any encryption algorithm may be used to seal and secure the data packets generated by parameter maintenance computer system 120.
Moving to box 440, once the data packet has been sealed and secured, it may be distributed to FHV meters in distribution network 130. The distribution of packets may vary depending on the embodiment. For example, in one embodiment data packets may be transferred to a portable non-transient computer readable medium such as CD-ROM, diskette, or USB flash drive. In such an embodiment, an individual under a regulatory agency's authority supervision and control may manually load the sealed and secure data packets to each FHV meter. In some embodiments, one medium may be generated for each FHV meter. This may occur in embodiments where the FHV meter is dedicated computer system. For example, in some embodiments, a data packet may be loaded onto a plurality of USB flash drives, each of the USB flash drives corresponding to one of the FHV meters in distribution network 130. An agent of the regulatory agency may insert the USB flash drive into the USB port of the FHV meter intended to be loaded with the data packet stored on the USB flash drive. In such embodiments, the USB flash drive may act as a USB Dongle, that is, the FHV meter may only operate when the USB flash drive is inserted into the FHV meter. The agent may then seal the USB Dongle to the FHV meter using a visual indicator of tampering such as color coded self destructible tape, special plastic tie, special metal tie, or seal. The visual indicator may then act as evidence of tampering; if the visual indicator is broken, it will serve as an indication that the USB Dongle may have been tampered with.
In other embodiments, distribution of sealed and secure data packets may occur over a wireless network. In such embodiments, each FHV meter in distribution network 130 may have a wireless receiver capable of receiving a wireless network signal. Parameter maintenance computer system 120 may broadcast, on a periodic basis, data packets for various FHV meters. In some embodiments, the FHV meters may listen for all data packets broadcast by parameter maintenance computer system 120. Using the header information of the data packet, the FHV meter may then determine if the data packet should be used to update its parameters by comparing the unique identifier information of the data packet to the unique identifier information stored in general data store 220.
In other embodiments, FHV meters may run server software, such as a telnet server, socket server, or any other means of communicating over a TCP port that allows for communications with parameter maintenance computer system 120. In such embodiments, the FHV meters of distribution network 130 may be assigned a dedicated IP address. Parameter maintenance computer system 120 may store, in data store 320, the IP address, the unique identifier, and in some embodiments the public key, associated with FHV meter 100. The stored data may then be used to distribute the data packet to a specific FHV meter such as FHV meter 100. For example, parameter maintenance computer system 120 may generate a data packet and include in the header the unique identifier of FHV meter 100. After the data packet is generated, parameter maintenance computer system 120 may seal the data packet according to the public key. Then, parameter maintenance computer system 120 may use the IP address of the FHV meter to start a session with the FHV meter and open a port for communication. Parameter maintenance computer system 120 may then transfer the data packet directly to its intended target FHV meter.
In other embodiments, FHV meter 100 may pull data packets from parameter maintenance computer system 120 as opposed to parameter maintenance computer system 120 pushing data packets to FHV meter 100. For example, FHV meter 100 may, via a wireless connection, poll parameter maintenance computer system 120 on a periodic basis to determine if any data packets have been generated since the last request. The request may include, for example, the unique identifier of the FHV meter. Parameter maintenance computer system 120 may respond to the request by sending a data packet corresponding to the unique identifier of the FHV meter. In some embodiments, parameter maintenance computer system 120 may respond with a null message, or a message indicating no data packets were generated since the last request. In some embodiments, FHV meter 100 may make an update request daily, every other day, or weekly. In some embodiments, the FHV meters within distribution network 130 may be configured to make update requests at different points during an update period so that network traffic is minimized. For example, FHV meter 100 may make an update request daily at 9 AM, FHV meter 101 may make an update request daily at 10 AM, and FHV meter 102 may make an update request at daily 11 AM.
The distribution methods of sealed and secured data packets described herein with reference to box 440 are meant as examples and should not be interpreted as the sole means for distributing data packets within distribution network 130. It can be appreciated that the distribution of data between the systems of distribution network 130 may vary according to the needs and limitations of the particular embodiment and the distribution methods described herein may be tailored to satisfy the needs, and work within the limitations, of any particular distribution network.
Processing begins, in one embodiment, by validating the data packet in box 520. Validation of data packets may start, in one embodiment, by examining the metadata header of the data packet for a value representing the unique identifier of the data packet's target FHV meter. If the data packet contains a unique identifier not matching the unique identifier of FHV meter 100, processing stops and the data packet may be discarded, or deleted, from memory 215. If the data packet contains a unique identifier matching the unique identifier of FHV meter 100, FHV meter 100 may continue to validate the packet by decrypting it. In other embodiments, the data packet does not contain a metadata header, or the metadata header may not include a unique identifier. In such embodiments, the validation process may begin by FHV meter 100 attempting to decrypt the data packet. For example, cipher engine module 280 may attempt to decrypt the data packet using private key 260. Once decrypted, FHV meter 100 may attempt extract operating parameters from the data packet. If FHV meter 100 cannot extract usable operating parameters from the data packet, then the data packet fails validation. In such embodiments, the data packet may then be discarded, or deleted from RAM. In some embodiments, if the data packet fails validation, FHV meter 100 may shut down or send a message to parameter maintenance computer system 120 that it received a data packet that failed validation.
Once the packet has been validated, FHV meter 100 extracts operating parameters from the data packet in box 530 if it has not already done so during the validation step. The extraction of operating parameters depends on the embodiment. For example, if the data packet was generated as an XML file, FHV meter 100 may analyze the XML file to determine the FHV operating parameters. In other embodiments, if the data packet is a serialized object, FHV meter 100 may desterilized the object, and then extract the FHV parameters using the object's interface. In other embodiments, the data packet may be implement as a byte stream, in which case, FHV meter 100 may parse the byte stream in order to determine the operating parameters.
In box 540, once the operating parameters have been extracted, they may be stored in operating parameters data store 270. In box 550, the stored operating parameters may be accessed by CPU in order to calculate fares. The fares may be calculated based on stored time and distance-traveled parameters, geospatial point parameters, variable operating cost surcharge parameters, fare initiation parameters or fare termination parameters. The stored parameters may be used in conjunction with other modules of FHV meter 100 to calculate fares such as, for example, distance calculation device 230 or geospatial recognition module 250.
All of the methods and tasks described herein may be performed and fully automated by a computer system. The computer system may in some cases include multiple distinct computers or computing devices (e.g., physical servers, workstations, storage arrays, etc.) that communicate and interoperate over a network to perform the described functions. Each such computing devices typically includes a processor (or multiple processors) that executes program instructions or modules stored in a memory or other non-transitory computer-readable storage medium. The various functions disclosed herein may be embodied in such program instructions, although some or all of the disclosed functions may alternatively be implemented in application-specific circuitry (e.g., ASICs or FPGAs) of the computer system. Where the computer system includes multiple computing devices, these devices may, but need not, be co-located. The results of the disclosed methods and tasks may be persistently stored by transforming physical storage devices such as solid state memory chips and/or magnetic disks, into a different state.
The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. It should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.
Number | Name | Date | Kind |
---|---|---|---|
2870018 | Williams | Jan 1959 | A |
3589486 | Kelch | Jun 1971 | A |
3667307 | Kelch | Jun 1972 | A |
3675504 | Schuh | Jul 1972 | A |
3698627 | Kelch et al. | Oct 1972 | A |
3736408 | Kienzle et al. | May 1973 | A |
3764782 | Spauszus et al. | Oct 1973 | A |
3809312 | Warrick | May 1974 | A |
3860806 | Fichter et al. | Jan 1975 | A |
3860807 | Fichter et al. | Jan 1975 | A |
3931508 | Kelch | Jan 1976 | A |
3937933 | Warkentin | Feb 1976 | A |
3946213 | Kepper | Mar 1976 | A |
3953720 | Kelch | Apr 1976 | A |
4001560 | Larsen | Jan 1977 | A |
4021645 | Saufferer et al. | May 1977 | A |
4024384 | Tateishi et al. | May 1977 | A |
4039780 | Kelch et al. | Aug 1977 | A |
4045656 | Scott | Aug 1977 | A |
4056709 | Scholl et al. | Nov 1977 | A |
4081663 | Ahlberg | Mar 1978 | A |
4095737 | Schuh et al. | Jun 1978 | A |
4118775 | Boyce | Oct 1978 | A |
4160155 | Steele et al. | Jul 1979 | A |
4167040 | Heritier et al. | Nov 1979 | A |
4205388 | Steiner | May 1980 | A |
4208664 | Mattori | Jun 1980 | A |
4209688 | Kelch | Jun 1980 | A |
4212069 | Baumann | Jul 1980 | A |
4217484 | Gerst | Aug 1980 | A |
4240146 | Iles | Dec 1980 | A |
4280180 | Eckert | Jul 1981 | A |
4360875 | Behnke | Nov 1982 | A |
4389563 | Ricard | Jun 1983 | A |
4409685 | Ricard | Oct 1983 | A |
4482965 | Tateishi et al. | Nov 1984 | A |
4539644 | Adams | Sep 1985 | A |
4570228 | Ahlberg | Feb 1986 | A |
4574189 | Adams et al. | Mar 1986 | A |
4578760 | Adams et al. | Mar 1986 | A |
4580039 | Adams | Apr 1986 | A |
4658707 | Hawkins | Apr 1987 | A |
4713753 | Boebert et al. | Dec 1987 | A |
4736423 | Matyas | Apr 1988 | A |
4740900 | Adams | Apr 1988 | A |
4789774 | Koch et al. | Dec 1988 | A |
4800502 | Steward et al. | Jan 1989 | A |
4860124 | Adams | Aug 1989 | A |
4882570 | Martinez | Nov 1989 | A |
4888798 | Earnest | Dec 1989 | A |
4897874 | Lidinsky et al. | Jan 1990 | A |
4926476 | Covey | May 1990 | A |
4939652 | Steiner | Jul 1990 | A |
4965833 | McGregor et al. | Oct 1990 | A |
4998205 | Ricard | Mar 1991 | A |
5008827 | Sansone | Apr 1991 | A |
5010571 | Katznelson | Apr 1991 | A |
5043562 | Hautvast et al. | Aug 1991 | A |
5058162 | Santon et al. | Oct 1991 | A |
5121097 | van Zeggeren | Jun 1992 | A |
5123045 | Ostrovsky et al. | Jun 1992 | A |
5155747 | Huang | Oct 1992 | A |
5187646 | Koch | Feb 1993 | A |
5218638 | Matsumoto et al. | Jun 1993 | A |
5241594 | Kung | Aug 1993 | A |
5247575 | Sprague et al. | Sep 1993 | A |
5274561 | Adams et al. | Dec 1993 | A |
5297206 | Orton | Mar 1994 | A |
5303163 | Ebaugh | Apr 1994 | A |
5319613 | Adams | Jun 1994 | A |
5319705 | Halter et al. | Jun 1994 | A |
5337357 | Chou et al. | Aug 1994 | A |
5341429 | Stringer et al. | Aug 1994 | A |
5369702 | Shanton | Nov 1994 | A |
5386369 | Christiano | Jan 1995 | A |
5400403 | Fahn et al. | Mar 1995 | A |
5410598 | Shear | Apr 1995 | A |
5414772 | Naccache et al. | May 1995 | A |
5416840 | Cane et al. | May 1995 | A |
5428555 | Starkey et al. | Jun 1995 | A |
5448641 | Pintsov | Sep 1995 | A |
5454101 | Mackay et al. | Sep 1995 | A |
5490077 | Freytag | Feb 1996 | A |
5499295 | Cooper | Mar 1996 | A |
5504814 | Miyahara | Apr 1996 | A |
5509070 | Schull | Apr 1996 | A |
5511122 | Atkinson | Apr 1996 | A |
5557796 | Fehskens et al. | Sep 1996 | A |
5563946 | Cooper et al. | Oct 1996 | A |
5598470 | Cooper et al. | Jan 1997 | A |
5606508 | Thiel | Feb 1997 | A |
5615264 | Kazmierczak et al. | Mar 1997 | A |
5623136 | Schmid et al. | Apr 1997 | A |
5629856 | Ricard | May 1997 | A |
5634012 | Stefik et al. | May 1997 | A |
5646387 | Schmid et al. | Jul 1997 | A |
5646992 | Subler et al. | Jul 1997 | A |
5664948 | Dimitriadis et al. | Sep 1997 | A |
5699415 | Wagner | Dec 1997 | A |
5708709 | Rose | Jan 1998 | A |
5715164 | Liechti | Feb 1998 | A |
5742807 | Masinter | Apr 1998 | A |
5754938 | Herz et al. | May 1998 | A |
5765152 | Erickson | Jun 1998 | A |
5778348 | Manduley | Jul 1998 | A |
5801614 | Kokubu | Sep 1998 | A |
5809145 | Slik et al. | Sep 1998 | A |
5809234 | Le Van Suu | Sep 1998 | A |
5822428 | Gardner | Oct 1998 | A |
5828738 | Spaeth | Oct 1998 | A |
5842131 | Yamane | Nov 1998 | A |
5842186 | Kulik | Nov 1998 | A |
5892900 | Ginter et al. | Apr 1999 | A |
5897626 | Pomerantz | Apr 1999 | A |
5898777 | Tycksen, Jr. et al. | Apr 1999 | A |
5917434 | Murphy | Jun 1999 | A |
5920868 | Fowlow et al. | Jul 1999 | A |
5924057 | Kell | Jul 1999 | A |
5982887 | Hirotani | Nov 1999 | A |
5991402 | Jia et al. | Nov 1999 | A |
5999622 | Yasukawa et al. | Dec 1999 | A |
6028510 | Tamam et al. | Feb 2000 | A |
6060993 | Cohen | May 2000 | A |
6081204 | Lavoie | Jun 2000 | A |
6087965 | Murphy | Jul 2000 | A |
6109520 | Ricard | Aug 2000 | A |
6122591 | Pomerantz | Sep 2000 | A |
6212525 | Guha | Apr 2001 | B1 |
6225890 | Murphy | May 2001 | B1 |
6236330 | Cohen | May 2001 | B1 |
6246933 | Bague | Jun 2001 | B1 |
6249772 | Walker et al. | Jun 2001 | B1 |
6253129 | Jenkins | Jun 2001 | B1 |
6253649 | Shinjo | Jul 2001 | B1 |
6269343 | Pallakoff | Jul 2001 | B1 |
6275768 | Zobell et al. | Aug 2001 | B1 |
6330499 | Chou et al. | Dec 2001 | B1 |
6339745 | Novik | Jan 2002 | B1 |
6347739 | Tamam | Feb 2002 | B1 |
6366207 | Murphy | Apr 2002 | B1 |
6388579 | Adcox et al. | May 2002 | B1 |
6442553 | Take | Aug 2002 | B1 |
6456207 | Yen | Sep 2002 | B1 |
6466921 | Cordery | Oct 2002 | B1 |
6474552 | Ricard | Nov 2002 | B1 |
6487717 | Brunemann et al. | Nov 2002 | B1 |
6546006 | Fraser | Apr 2003 | B1 |
6565443 | Johnson | May 2003 | B1 |
6587781 | Feldman et al. | Jul 2003 | B2 |
6609103 | Kolls | Aug 2003 | B1 |
6611755 | Coffee | Aug 2003 | B1 |
6677858 | Faris | Jan 2004 | B1 |
6686834 | Tamam | Feb 2004 | B1 |
6702674 | De Bruin | Mar 2004 | B1 |
6710721 | Holowick | Mar 2004 | B1 |
6722331 | Koehler et al. | Apr 2004 | B2 |
6736317 | McDonald | May 2004 | B1 |
6754636 | Walker et al. | Jun 2004 | B1 |
6754637 | Stenz | Jun 2004 | B1 |
6756913 | Ayed | Jun 2004 | B1 |
6772331 | Hind et al. | Aug 2004 | B1 |
6773477 | Lindsay | Aug 2004 | B2 |
6782241 | Kobayashi | Aug 2004 | B2 |
6807534 | Erickson | Oct 2004 | B1 |
6812851 | Dukach et al. | Nov 2004 | B1 |
6839840 | Cooreman | Jan 2005 | B1 |
6857067 | Edelman | Feb 2005 | B2 |
6930596 | Kulesz et al. | Aug 2005 | B2 |
6931309 | Phelan et al. | Aug 2005 | B2 |
6941197 | Murakami et al. | Sep 2005 | B1 |
7010685 | Candelore | Mar 2006 | B1 |
7010697 | Byrne et al. | Mar 2006 | B2 |
7039603 | Walker et al. | May 2006 | B2 |
7085775 | Short, III et al. | Aug 2006 | B2 |
7093137 | Sato et al. | Aug 2006 | B1 |
7093282 | Hillhouse | Aug 2006 | B2 |
7100195 | Underwood | Aug 2006 | B1 |
7103583 | Baum | Sep 2006 | B1 |
7124099 | Mesaros | Oct 2006 | B2 |
7124437 | Byrne et al. | Oct 2006 | B2 |
7127411 | Ho | Oct 2006 | B2 |
7130584 | Hirvonen | Oct 2006 | B2 |
7130831 | Howard et al. | Oct 2006 | B2 |
7163459 | Tanskanen | Jan 2007 | B2 |
7181419 | Mesaros | Feb 2007 | B1 |
7188089 | Goldthwaite et al. | Mar 2007 | B2 |
7203666 | Gravell | Apr 2007 | B1 |
7236956 | Ogg | Jun 2007 | B1 |
7266695 | Nakayama | Sep 2007 | B2 |
7278031 | Best | Oct 2007 | B1 |
7378982 | Mohamed | May 2008 | B2 |
7437756 | Bleumer | Oct 2008 | B2 |
7449988 | Hata | Nov 2008 | B2 |
7472172 | Anderson et al. | Dec 2008 | B2 |
7512968 | Stephens, Jr. | Mar 2009 | B2 |
7551593 | Haller et al. | Jun 2009 | B2 |
7562818 | Bierbaum et al. | Jul 2009 | B1 |
7565529 | Beck et al. | Jul 2009 | B2 |
7567940 | Engelberg | Jul 2009 | B1 |
7577617 | Reisinger | Aug 2009 | B1 |
7598889 | Maeda et al. | Oct 2009 | B2 |
7646740 | Crolley et al. | Jan 2010 | B2 |
7647024 | Wang et al. | Jan 2010 | B2 |
7689468 | Walker et al. | Mar 2010 | B2 |
7689469 | Mesaros | Mar 2010 | B1 |
7693662 | Yamada | Apr 2010 | B2 |
7693748 | Mesaros | Apr 2010 | B1 |
7721108 | Pailles | May 2010 | B2 |
7738569 | Quinn et al. | Jun 2010 | B2 |
7739205 | Reisinger | Jun 2010 | B1 |
7743427 | Byrne et al. | Jun 2010 | B2 |
7769694 | Schwartz | Aug 2010 | B2 |
7769700 | D'Amico | Aug 2010 | B1 |
7797679 | Tysowski | Sep 2010 | B2 |
7811172 | Asher et al. | Oct 2010 | B2 |
7812711 | Brown et al. | Oct 2010 | B2 |
7813715 | McKillop et al. | Oct 2010 | B2 |
7817991 | Hinckley et al. | Oct 2010 | B2 |
7853600 | Herz et al. | Dec 2010 | B2 |
7904063 | Steelberg et al. | Mar 2011 | B1 |
7907901 | Kahn et al. | Mar 2011 | B1 |
7912020 | Khasawneh et al. | Mar 2011 | B2 |
7913297 | Wyld | Mar 2011 | B2 |
7925656 | Liu et al. | Apr 2011 | B2 |
7926056 | Lier | Apr 2011 | B2 |
7932892 | Chen et al. | Apr 2011 | B2 |
7941831 | Mandhana | May 2011 | B2 |
7983616 | Wang et al. | Jul 2011 | B2 |
8036822 | Ho | Oct 2011 | B2 |
8065718 | Grove | Nov 2011 | B2 |
8139820 | Plante et al. | Mar 2012 | B2 |
8170524 | Abbot | May 2012 | B2 |
8200624 | Clegg et al. | Jun 2012 | B2 |
8239092 | Plante et al. | Aug 2012 | B2 |
8243423 | Ranta | Aug 2012 | B2 |
8474050 | Casimere | Jun 2013 | B2 |
8489895 | Tan, Jr. | Jul 2013 | B2 |
8499356 | Byrne et al. | Jul 2013 | B2 |
8533494 | Harada | Sep 2013 | B2 |
8566651 | Liu | Oct 2013 | B2 |
8568224 | Itkis | Oct 2013 | B1 |
8630897 | Prada Gomez et al. | Jan 2014 | B1 |
9037852 | Pinkus et al. | May 2015 | B2 |
9157748 | Millspaugh | Oct 2015 | B2 |
9646326 | Goralnick | May 2017 | B2 |
10776837 | Roivainen | Sep 2020 | B2 |
10957227 | Delorean | Mar 2021 | B2 |
11238498 | Knowles et al. | Feb 2022 | B2 |
11651599 | Coimbra et al. | May 2023 | B2 |
20010042045 | Howard et al. | Nov 2001 | A1 |
20020023027 | Simonds | Feb 2002 | A1 |
20020026321 | Faris | Feb 2002 | A1 |
20020049683 | Ricard | Apr 2002 | A1 |
20020052751 | Ebata | May 2002 | A1 |
20020065836 | Sasaki | May 2002 | A1 |
20020072963 | Jonge | Jun 2002 | A1 |
20020087500 | Berkowitz et al. | Jul 2002 | A1 |
20020091473 | Gardner et al. | Jul 2002 | A1 |
20020107027 | Oneil | Aug 2002 | A1 |
20020111154 | Eldering et al. | Aug 2002 | A1 |
20020120590 | Richard | Aug 2002 | A1 |
20020136407 | Denning et al. | Sep 2002 | A1 |
20020156699 | Gray et al. | Oct 2002 | A1 |
20020164962 | Mankins et al. | Nov 2002 | A1 |
20020170962 | Besling et al. | Nov 2002 | A1 |
20020174355 | Rajasekaran et al. | Nov 2002 | A1 |
20020186144 | Meunier | Dec 2002 | A1 |
20030022719 | Donald et al. | Jan 2003 | A1 |
20030032460 | Cannon et al. | Feb 2003 | A1 |
20030034873 | Chase et al. | Feb 2003 | A1 |
20030037237 | Abgrall | Feb 2003 | A1 |
20030061080 | Ross | Mar 2003 | A1 |
20030068999 | Casali et al. | Apr 2003 | A1 |
20030079122 | Asokan | Apr 2003 | A1 |
20030084332 | Krasinski | May 2003 | A1 |
20030139941 | Matsumoto | Jul 2003 | A1 |
20030144906 | Fujimoto et al. | Jul 2003 | A1 |
20030169162 | Hyman | Sep 2003 | A1 |
20030177020 | Okamura | Sep 2003 | A1 |
20030177373 | Moyer | Sep 2003 | A1 |
20030216960 | Postrel | Nov 2003 | A1 |
20030217270 | Nakayama | Nov 2003 | A1 |
20030220835 | Barnes | Nov 2003 | A1 |
20030222134 | Boyd | Dec 2003 | A1 |
20040064415 | Abdallah et al. | Apr 2004 | A1 |
20040078118 | Binder | Apr 2004 | A1 |
20040078141 | Kittell et al. | Apr 2004 | A1 |
20040093280 | Yamaguchi | May 2004 | A1 |
20040093312 | Cordery | May 2004 | A1 |
20040112959 | Jun | Jun 2004 | A1 |
20040119589 | French et al. | Jun 2004 | A1 |
20040143378 | Vogelsang | Jul 2004 | A1 |
20040162802 | Jonas | Aug 2004 | A1 |
20040176081 | Bryham et al. | Sep 2004 | A1 |
20040177109 | Lee | Sep 2004 | A1 |
20040192351 | Duncan | Sep 2004 | A1 |
20040210757 | Kogan | Oct 2004 | A1 |
20040219933 | Faith | Nov 2004 | A1 |
20040225440 | Khatwa et al. | Nov 2004 | A1 |
20040225557 | Phelan et al. | Nov 2004 | A1 |
20040253923 | Braley et al. | Dec 2004 | A1 |
20050131597 | Raz et al. | Jun 2005 | A1 |
20050190619 | Wakiyama | Sep 2005 | A1 |
20050209970 | Shiba | Sep 2005 | A1 |
20050216134 | Katrak et al. | Sep 2005 | A1 |
20050229012 | Douceur et al. | Oct 2005 | A1 |
20060033840 | Diehl et al. | Feb 2006 | A1 |
20060034201 | Umeda et al. | Feb 2006 | A1 |
20060036501 | Shahbazi et al. | Feb 2006 | A1 |
20060069749 | Herz et al. | Mar 2006 | A1 |
20060089912 | Spagna | Apr 2006 | A1 |
20060095329 | Kim | May 2006 | A1 |
20060131401 | Do et al. | Jun 2006 | A1 |
20060135120 | Likourezos | Jun 2006 | A1 |
20060143455 | Gitzinger | Jun 2006 | A1 |
20060164257 | Giubbini | Jul 2006 | A1 |
20060168580 | Harada | Jul 2006 | A1 |
20060182055 | Coffee | Aug 2006 | A1 |
20060200430 | Kim | Sep 2006 | A1 |
20060206433 | Scoggins | Sep 2006 | A1 |
20060242058 | Torto | Oct 2006 | A1 |
20060259790 | Asokan | Nov 2006 | A1 |
20060267860 | Rinaldo et al. | Nov 2006 | A1 |
20060276960 | Adamczyk et al. | Dec 2006 | A1 |
20060282649 | Malamud et al. | Dec 2006 | A1 |
20070032195 | Kurisko et al. | Feb 2007 | A1 |
20070075874 | Shah et al. | Apr 2007 | A1 |
20070082614 | Mock | Apr 2007 | A1 |
20070109106 | Maeda et al. | May 2007 | A1 |
20070123166 | Sheynman et al. | May 2007 | A1 |
20070125843 | Byerly et al. | Jun 2007 | A1 |
20070126601 | Park | Jun 2007 | A1 |
20070179910 | Ferraro | Aug 2007 | A1 |
20070200663 | White et al. | Aug 2007 | A1 |
20070208864 | Flynn et al. | Sep 2007 | A1 |
20070213047 | Kolker | Sep 2007 | A1 |
20070226777 | Burton | Sep 2007 | A1 |
20070257813 | Vaswani | Nov 2007 | A1 |
20070257815 | Gunderson et al. | Nov 2007 | A1 |
20080018730 | Roth | Jan 2008 | A1 |
20080040210 | Hedley | Feb 2008 | A1 |
20080045234 | Reed | Feb 2008 | A1 |
20080048886 | Brown et al. | Feb 2008 | A1 |
20080057868 | Chang | Mar 2008 | A1 |
20080082397 | Dennison et al. | Apr 2008 | A1 |
20080082403 | Adegoke et al. | Apr 2008 | A1 |
20080102793 | Venkatesan et al. | May 2008 | A1 |
20080113618 | De et al. | May 2008 | A1 |
20080114707 | Steiner | May 2008 | A1 |
20080126665 | Burr et al. | May 2008 | A1 |
20080147268 | Fuller | Jun 2008 | A1 |
20080162260 | Rohan et al. | Jul 2008 | A1 |
20080166968 | Tang et al. | Jul 2008 | A1 |
20080195428 | OSullivan | Aug 2008 | A1 |
20080235517 | Ohmori | Sep 2008 | A1 |
20080235811 | Yan | Sep 2008 | A1 |
20080248748 | Sangster et al. | Oct 2008 | A1 |
20080270204 | Poykko et al. | Oct 2008 | A1 |
20080285626 | Ma et al. | Nov 2008 | A1 |
20080287062 | Claus et al. | Nov 2008 | A1 |
20080294312 | O'Connor | Nov 2008 | A1 |
20080319604 | Follmer et al. | Dec 2008 | A1 |
20080319666 | Petrov et al. | Dec 2008 | A1 |
20090009321 | McClellan et al. | Jan 2009 | A1 |
20090024419 | McClellan et al. | Jan 2009 | A1 |
20090030885 | DePasquale et al. | Jan 2009 | A1 |
20090034591 | Julian et al. | Feb 2009 | A1 |
20090061769 | Zimbric et al. | Mar 2009 | A1 |
20090079555 | Aguirre et al. | Mar 2009 | A1 |
20090083833 | Ziola et al. | Mar 2009 | A1 |
20090096573 | Graessley | Apr 2009 | A1 |
20090098855 | Fernandez et al. | Apr 2009 | A1 |
20090111378 | Sheynman et al. | Apr 2009 | A1 |
20090112723 | Gottesman et al. | Apr 2009 | A1 |
20090118002 | Lyons et al. | May 2009 | A1 |
20090156123 | Kim | Jun 2009 | A1 |
20090156241 | Staffaroni et al. | Jun 2009 | A1 |
20090157255 | Plante | Jun 2009 | A1 |
20090169006 | Zick et al. | Jul 2009 | A1 |
20090186577 | Ross et al. | Jul 2009 | A1 |
20090207014 | Ayed | Aug 2009 | A1 |
20090210343 | Griffin | Aug 2009 | A1 |
20090234745 | Ramer et al. | Sep 2009 | A1 |
20090254259 | The | Oct 2009 | A1 |
20090254270 | Yu | Oct 2009 | A1 |
20090270036 | Michaud | Oct 2009 | A1 |
20090271289 | Klinger et al. | Oct 2009 | A1 |
20090281818 | Li et al. | Nov 2009 | A1 |
20090286479 | Thoresson et al. | Nov 2009 | A1 |
20090325491 | Bell et al. | Dec 2009 | A1 |
20090326991 | Wei et al. | Dec 2009 | A1 |
20100022217 | Ketari | Jan 2010 | A1 |
20100027414 | Hamachi | Feb 2010 | A1 |
20100030582 | Rippel et al. | Feb 2010 | A1 |
20100036717 | Trest | Feb 2010 | A1 |
20100037063 | Chontos | Feb 2010 | A1 |
20100045452 | Periwal | Feb 2010 | A1 |
20100063857 | Malik | Mar 2010 | A1 |
20100077115 | Rofougaran | Mar 2010 | A1 |
20100094780 | Trzcinski | Apr 2010 | A1 |
20100125510 | Smith et al. | May 2010 | A1 |
20100167643 | Hirsch | Jul 2010 | A1 |
20100167646 | Alameh et al. | Jul 2010 | A1 |
20100194549 | Tonokawa et al. | Aug 2010 | A1 |
20100199325 | Raleigh | Aug 2010 | A1 |
20100217507 | Braunberger et al. | Aug 2010 | A1 |
20100227549 | Kozlay | Sep 2010 | A1 |
20100241857 | Okude et al. | Sep 2010 | A1 |
20100246824 | Julian et al. | Sep 2010 | A1 |
20100250060 | Maeda et al. | Sep 2010 | A1 |
20100255782 | Klemmensen | Oct 2010 | A1 |
20100259058 | Knighton et al. | Oct 2010 | A1 |
20100265034 | Cap et al. | Oct 2010 | A1 |
20100299207 | Harlev et al. | Nov 2010 | A1 |
20100299212 | Graylin et al. | Nov 2010 | A1 |
20100318578 | Treu et al. | Dec 2010 | A1 |
20100330908 | Maddern et al. | Dec 2010 | A1 |
20100332312 | Klinger et al. | Dec 2010 | A1 |
20110009107 | Guba et al. | Jan 2011 | A1 |
20110012720 | Hirschfeld | Jan 2011 | A1 |
20110022474 | Jain et al. | Jan 2011 | A1 |
20110022477 | Hatridge et al. | Jan 2011 | A1 |
20110022764 | Ohkubo et al. | Jan 2011 | A1 |
20110047062 | Kerschner et al. | Feb 2011 | A1 |
20110053552 | Kim et al. | Mar 2011 | A1 |
20110055309 | Gibor et al. | Mar 2011 | A1 |
20110057815 | King | Mar 2011 | A1 |
20110077056 | Park et al. | Mar 2011 | A1 |
20110093340 | Kramer et al. | Apr 2011 | A1 |
20110099040 | Felt et al. | Apr 2011 | A1 |
20110112770 | Kuramori | May 2011 | A1 |
20110119491 | Nocera | May 2011 | A1 |
20110124321 | Sagong et al. | May 2011 | A1 |
20110131153 | Grim et al. | Jun 2011 | A1 |
20110153453 | Ghafoor et al. | Jun 2011 | A1 |
20110153495 | Dixon et al. | Jun 2011 | A1 |
20110185435 | Chang | Jul 2011 | A1 |
20110213618 | Hodge et al. | Sep 2011 | A1 |
20110215900 | Corradino et al. | Sep 2011 | A1 |
20110307282 | Camp et al. | Dec 2011 | A1 |
20110313880 | Paul et al. | Dec 2011 | A1 |
20110320259 | Roumeliotis et al. | Dec 2011 | A1 |
20120053805 | Dantu | Mar 2012 | A1 |
20120054498 | Rickman | Mar 2012 | A1 |
20120072267 | Gutierrez et al. | Mar 2012 | A1 |
20120074927 | Ramirez | Mar 2012 | A1 |
20120109796 | Mashal et al. | May 2012 | A1 |
20120130627 | Islam et al. | May 2012 | A1 |
20120137126 | Matsuoka | May 2012 | A1 |
20120041675 | Juliver et al. | Jul 2012 | A1 |
20120172136 | House | Jul 2012 | A1 |
20120185302 | Kim et al. | Jul 2012 | A1 |
20120203441 | Higgins et al. | Aug 2012 | A1 |
20120226390 | Adams | Sep 2012 | A1 |
20120226748 | Bosworth et al. | Sep 2012 | A1 |
20120233246 | Guemez | Sep 2012 | A1 |
20120303533 | Pinkus | Nov 2012 | A1 |
20120323692 | Shutter | Dec 2012 | A1 |
20120323792 | Peterson et al. | Dec 2012 | A1 |
20120330741 | Cruz | Dec 2012 | A1 |
20130006722 | Ziomkowski | Jan 2013 | A1 |
20130013412 | Altman et al. | Jan 2013 | A1 |
20130054281 | Thakkar et al. | Feb 2013 | A1 |
20130054282 | Pinkus et al. | Feb 2013 | A1 |
20130054361 | Rakshit | Feb 2013 | A1 |
20130060721 | Pinkus et al. | Mar 2013 | A1 |
20130061044 | Pinkus et al. | Mar 2013 | A1 |
20130066688 | Pinkus et al. | Mar 2013 | A1 |
20130085817 | Pinkus | Apr 2013 | A1 |
20130104220 | Lee | Apr 2013 | A1 |
20130145459 | Furuichi | Jun 2013 | A1 |
20130166387 | Hoffberg | Jun 2013 | A1 |
20130218647 | Kroll et al. | Aug 2013 | A1 |
20130246181 | Lobsenz | Sep 2013 | A1 |
20130253999 | Pinkus et al. | Sep 2013 | A1 |
20130332075 | Wang et al. | Dec 2013 | A1 |
20140039784 | Millspaugh | Feb 2014 | A1 |
20140040016 | Amla et al. | Feb 2014 | A1 |
20140067195 | James et al. | Mar 2014 | A1 |
20140067488 | James et al. | Mar 2014 | A1 |
20140067489 | James et al. | Mar 2014 | A1 |
20140067490 | James et al. | Mar 2014 | A1 |
20140067491 | James et al. | Mar 2014 | A1 |
20140081764 | James | Mar 2014 | A1 |
20150310510 | Kelly et al. | Oct 2015 | A1 |
20150332516 | Pinkus et al. | Nov 2015 | A1 |
20160370202 | James et al. | Dec 2016 | A1 |
20160371754 | James et al. | Dec 2016 | A1 |
20160373528 | Pinkus et al. | Dec 2016 | A1 |
20160379421 | James et al. | Dec 2016 | A1 |
20170024936 | Pinkus et al. | Jan 2017 | A1 |
20170032422 | Pinkus et al. | Feb 2017 | A1 |
20190026749 | Gao | Jan 2019 | A1 |
20190035167 | Pinkus et al. | Jan 2019 | A1 |
20190043089 | Pinkus et al. | Feb 2019 | A1 |
20190213801 | Pinkus et al. | Jul 2019 | A1 |
20200035042 | Pinkus | Jan 2020 | A1 |
20200211142 | James et al. | Jul 2020 | A1 |
20220222763 | James et al. | Jul 2022 | A1 |
Number | Date | Country |
---|---|---|
2 261 370 | Aug 2000 | CA |
2938649 | Aug 2007 | CN |
201229596 | Apr 2009 | CN |
101834903 | Sep 2010 | CN |
36 36 353 | Nov 1987 | DE |
37 36 258 | May 1989 | DE |
39 22 373 | Jan 1991 | DE |
10 120 781 | May 2003 | DE |
10 2005 052 872 | Jul 2007 | DE |
20 2008 005 583 | Aug 2008 | DE |
0 261 433 | Mar 1988 | EP |
0 406 663 | Nov 1992 | EP |
0 265 708 | Jan 1993 | EP |
0 313 882 | Feb 1993 | EP |
0 600 818 | Jun 1994 | EP |
1358748 | Nov 2003 | EP |
1455487 | Sep 2004 | EP |
1887770 | Feb 2008 | EP |
1 975 899 | Oct 2008 | EP |
2 073 160 | Jun 2009 | EP |
2494909 | Mar 2013 | GB |
6-12419 | Jan 1994 | JP |
06-012419 | Jan 1994 | JP |
2002-063690 | Feb 2002 | JP |
2002312811 | Oct 2002 | JP |
2003-115061 | Apr 2003 | JP |
2004-280329 | Oct 2004 | JP |
2009145080 | Jul 2009 | JP |
2009-198418 | Sep 2009 | JP |
1995-0014892 | Dec 1995 | KR |
2003-0017805 | Mar 2003 | KR |
20060098940 | Sep 2006 | KR |
20070075874 | Jul 2007 | KR |
20080005800 | Jan 2008 | KR |
100863420 | Oct 2008 | KR |
20090047144 | May 2009 | KR |
20090081136 | Jul 2009 | KR |
2010-0120898 | Nov 2010 | KR |
20120040478 | Apr 2012 | KR |
10-2012-0050023 | May 2012 | KR |
20120050023 | May 2012 | KR |
44 193 | Feb 2005 | RU |
9952084 | Oct 1999 | WO |
WO 99052084 | Oct 1999 | WO |
0217567 | Feb 2002 | WO |
02102019 | Dec 2002 | WO |
WO 2004047046 | Jun 2004 | WO |
WO-2004047046 | Jun 2004 | WO |
2006119854 | Nov 2006 | WO |
WO 2006119854 | Nov 2006 | WO |
WO 2007118221 | Oct 2007 | WO |
2008082779 | Jul 2008 | WO |
2008157618 | Dec 2008 | WO |
WO 2009129957 | Oct 2009 | WO |
WO 2010010409 | Jan 2010 | WO |
2011038269 | Mar 2011 | WO |
2011056044 | May 2011 | WO |
2011067741 | Jun 2011 | WO |
2011085145 | Jul 2011 | WO |
WO 2012051359 | Apr 2012 | WO |
WO 2012162100 | Nov 2012 | WO |
WO 2013033468 | Mar 2013 | WO |
WO 2013033470 | Mar 2013 | WO |
2013049408 | Apr 2013 | WO |
WO 2014036330 | Mar 2014 | WO |
WO 2014036331 | Mar 2014 | WO |
WO 2014036332 | Mar 2014 | WO |
WO 2014036333 | Mar 2014 | WO |
WO 2014036335 | Mar 2014 | WO |
Entry |
---|
Arieff, Allison, “All Tomorrow's Taxis”, http://opinionator.blogs.nytimes.com/2011/01/13/all-tomorrows-taxis/?_r=0, Jan. 13, 2011, pp. 3. |
Atallah, et al., “A Survey of Anti-Tamper Technologies”, CERIAS Tech Report, Nov. 2004, Purdue University, West Lafayette, IN, pp. 12-16. |
California Public Utilities Commission, “Passenger Carriers Questions and Answers”, as captured Feb. 26, 2011 in 4 pages, http://web.archive.org/web/20110226110944/http://www.cpuc.ca.gov/PUC/transportation/FAQs/psgfaqs.htm. |
Cassias et al., “Vehicle Telematics: A Literature Review”, Technical Report, Oct. 30, 2007 http://www.catlab.sr.unh.edu/Reference/Download.pm/2691/Document.PDFAbstract:Vehicletelematicsistheuseofcomputing. |
Centrodyne, Silent 610 Electronic Taximeter, http://www.centrodyne.com/tax1page3.htm printed May 4, 2011 in 1 page. |
Centrodyne, Silent 620 Electronic Taximeter, http://www.cnetrodyne.com/tax1page4.htm printed May 4, 2011 in 1 page. |
Centrodyne, Smart Features, http://www.centrodyne.com/tax1page6.htm printed May 4, 2011 in 1 page. |
Deaton, Jamie Page, “How Taxi Meters Work”, Including Sub-Articles: 1. How Taxi Meters Work, 2. Measuring Distance and Time, 3. Common Fares, 4. Taxi Meters and Scams, 5. Lots More Information, Mar. 31, 2011, HowStuffWorks.com, http://web.archive.org/web/20110423034037/http://auto.howstuffworks.com/taxi-meter.htm in 10 pages. |
Dodge et al., “The Automatic Management of Drivers and Driving Spaces”, Geoforum, vol. 38, Issue 2, pp. 264-275, Jul. 18, 2006. |
Islam, Tofiqul “Design and Fabrication of Fare Meter of Taxicab Using Microcontroller”, Dept. of Mechanical Engineering, Bangladesh University of Engineering and Technology, Dec. 30, 2005, pp. 1-5. |
Jantarang et al., “A Low Cost Real-Time Intelligent Taximeter Sensor”, Mahanakorn University of Technology, pp. 4, Bangkok, Thailand, 2002. |
Keinzle Argo Taxi International, Taximeter Kienzle Argo 1155 Product Sheet, 2 pages, www.kati.de. |
Lexmark International v. Static Control Components, No. 03-5400, US Court of Appeals for the Sixth Cirucuit, Oct. 2004, 26 pages. |
“MTData Handbook”, Premier Cabs, Revision 1.0, Dec. 2009, © 2009 Mobile Tracking and Data Pty. Ltd., pp. 49. |
NYC Taxi & Limousine Commission, “Current Licensees”, as captured Jul. 19, 2012 in 3 pages, http://web.archive.org/web/20120719230728/http://www.nyc.gov/html/tlc/html/industry/current_licensees.shtml. |
New York City Taxi & Limousine Commission, “Passenger Information | Taxicab Rate of Fare”, as captured Aug. 4, 2011 in 3 pages, http://web.archive.org/web/20110804040339/http://www.nyc.gov/html/passenger/taxicab_rate.shtml. |
Pulsar Technology Systems, Inc., Model 2030R, Copyright 2004, 1 page, http://www.taxi-meters.cmo/2020R.htm. |
Pulsar Technology Systems, Inc., Smart Taximeters The Last and Last, Model 2030, Copyrights 2004, 1 page, http://www.taxi-meters.com/2030.htm. |
Taximeter (EM-1), Qingdao Turina Electronic Co., Ltd., Copyright 2011, 2 pages, http://www.made-in-china.com/showroom/summerlee555/product-detailJbTEAFeOvYrt/China-Taximeter-EM-1-.html. |
Taximeter (OM-1), Qingdao Turina Electronic Co., Ltd., Copyright 2011, 2 pages, http://www.made-in-china.com/showroom/summerlee555/product-detailFMAJGvbUqpRE/China-Taximeter-OM-1-.html. |
Taximeter Taxi Meter (TM-2), Qingdao Turina Electronic Co., Ltd., Copyright 2011, 2 pages, http://www.made-in-china.com/showroom/summerlee555/product-detailIqznHdiuHbYq/China-Taximeter-Taxi-Meter-TM-2-.html. |
Taximeter (TM-4), Qingdao Turina Electronic Co. Ltd., Copyright 2011, 2 pages, http://www.made-in-china.com/showroom/summerlee555/product-detailGMfEaVeHFpYA/China-Taximeter-TM-4-.html. |
Official Communication in Pakistani Application No. 317/2012, dated Apr. 11, 2013. |
International Search Report and Written Opinion in International Application No. PCT/US2012/38422, dated Aug. 17, 2012. |
International Preliminary Report on Patentability in International Application No. PCT/US2012/38422, dated Dec. 5, 2013. |
Official Communication in Australian Application No. 2012301785, dated Sep. 3, 2015. |
European Search Report in Application No. 12826978.4, dated Jun. 1, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2012/053242, dated Apr. 3, 2014. |
International Preliminary Report on Patentability in International Application No. PCT/US2012/053242, dated Apr. 17, 2014. |
Official Communication in Australian Application No. 2012301787, dated Sep. 9, 2015. |
European Search Report in Application No. 12827556.7, dated Jun. 1, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2012/053244, dated Apr. 3, 2014. |
International Preliminary Report on Patentability in International Application No. PCT/US2012/053244, dated Apr. 17, 2014. |
International Search Report and Written Opinion in International Application No. PCT/US2013/057405, dated Nov. 27, 2013. |
International Preliminary Report and Written Opinion in International Application No. PCT/US2013/057405, dated Mar. 12, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2013/057406, dated Nov. 27, 2013. |
International Preliminary Report and Written Opinion in International Application No. PCT/US2013/057406, dated Mar. 12, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2013/057407, dated Nov. 27, 2013. |
International Preliminary Report and Written Opinion in International Application No. PCT/US2013/057407, dated Mar. 12, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2013/057408, dated Nov. 27, 2013. |
International Preliminary Report and Written Opinion in International Application No. PCT/US2013/057408, dated Mar. 12, 2015. |
International Search Report and Written Opinion in International Application No. PCT/US2013/057411, dated Dec. 2, 2013. |
International Preliminary Report and Written Opinion in International Application No. PCT/US2013/057411, dated Mar. 12, 2015. |
Deaton, Jamie Page, “How Taxi Meters Work”, Title page <http://auto.howstuffworks.com/taxi-meter.htm> (<http://web.archive.org/web/20110423034037/http://auto.howstuffworks.com/taxi-meter.htm> captured on Apr. 23, 2011 using Wayback Machine) (Year: 2011). |
Deaton, Jamie Page, “How Taxi Meters Work”, Common Fares page <http://auto.howstuffworks.com/taxi-meter2.htm> (<http://web.archive.org/web/20110427093054/http://auto.howstuffworks.com/taxi-meter2.htm> captured on Apr. 27, 2011 using Wayback Machine) (Year: 2011). |
The Philadelphia Parking Authority—Taxicab and Limousine Regulations; PPA Regs. pp. 1-74, Jul. 29, 2008 (Year: 2008). |
Baker, Rosie , “London Cabs Get Digital Screen Network”, https://www.marketingweek.com/london-cabs-get-digital-screen-network/, Sep. 2011. |
Bryant, Eric D., et al., “A Survey of Anti-Tamper Technologies”, Crosstalk the Journal of Defense Software Engineering, Nov. 12-16, 2004. |
Cagalj, Mario , et al., “Key agreement in peer-to-peer wireless networks”, Proceedings of the IEEE, vol. 94, No. 2, Feb. 2006. |
Dillow, Clay , “Nevada is the First State to Pass Driverless Car Legislation, Paving the Way for Autonomous Autos”, https://www.popsci.com/cars/article/2011-06/nevada-passes-driverless-car-legislation-paving-way-autonomous-autos/, Downloaded Sep. 7, 2021, Jun. 24, 2011. |
Future Technology Devices Intl , “FTDI Chip, USB-Key Datasheet, Version 1.00”, Jul. 17, 2008. |
Gehrmann, Christian , et al., “Manual Authentication for Wireless Devices”, RSA Laboratories CryptoBytes vol. 7, No. 1 Spring 2004, 2004. |
Harris, Lee A., “Taxicab Economics: The Freedome to Contract for a Ride”, 1 Geo, J.L. & Pub. Pol'y, 2003, 195-222. |
Rawley, Evan , “Information, Knowledge, and Asset Ownership in Taxicab Fleets”, Columbia Business School Summer Conference, Jun. 2009. |
Rukhande, Smita , et al., “Implementation of GPS Enabled Car Pooling System”, International Journal of Advances in Engineering & Technology, vol. 1, Issue 5, 2011, 318-328. |
Number | Date | Country | |
---|---|---|---|
20200014757 A1 | Jan 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15073499 | Mar 2016 | US |
Child | 16384797 | US | |
Parent | 13116856 | May 2011 | US |
Child | 15073499 | US |