Abstract: A conductive sheet, a conductive strip, and an electrical connector for a vehicle are disclosed. The conductive sheet includes a conductive sheet body, the conductive sheet body is a flat ribbon structure, and the conductive sheet body satisfies the following condition: ? ? { [ 1 + ( - 0 ) / ] 0 / k ? ( ? + 8 ) ] , 50 [ 1 + ( - 0 ) / ] 0 / k ? ( ? + 8 ) ] } ? is the width of the conductive sheet body, measured in mm. ? represents the thickness of the conductive sheet body, measured in mm. represents a standard conductivity percentage of a pure copper material, and has a value of 100% IACS. 0 represents a conductivity percentage of the conductive sheet body, measured in % IACS. k is 1.07% IACS/mm2. The conductivity percentage of the conductive sheet body is 55% IACS to 80% IACS.

Abstract: A system computes a timing interval between high-capacity vehicles (HCVs) for each of a plurality of HCV corridors within a geographic region, each respective HCV corridor of the plurality of HCV corridors including a start area. For each respective HCV corridor, the system transmits, via a network communication interface, (i) first data to a first computing device associated with a first HCV, the first data indicating the start area of the respective HCV corridor, and a first start time for the first HCV, and (ii) second data to a second computing device associated with a second HCV, the second data indicating the start area of the respective HCV corridor and a second start time for the second HCV, wherein the first start time for the first HCV and the second start time for the second HCV are based on the computed timing interval for the respective HCV corridor.

Abstract: A network computer system operates to receive service requests from requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting pickup locations for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at their pickup locations, and (iv) selecting a transport provider to service both the first transport request and the second transport request.

Abstract: A network system can communicate with user and provider devices to facilitate the provision of a network-based service. The network system can identify optimal service providers to provide services requested by users. The network can utilize context data in matching service providers with users. In particular, the network system can determine, based on context data associated with a user, whether to perform pre-request matching for that user. A service provider who is pre-request matched with the user can be directed by the network system to relocate via a pre-request relocation direction. When the user submits the service request after the pre-request match, the network system can either automatically transmit an invitation to the pre-request matched service provider or can perform post-request matching to identify an optimal service provider for the user.

Abstract: A network system can communicate with user and provider devices to facilitate the provision of a network-based service. The network system can identify optimal service providers to provide services requested by users. The network can utilize context data in matching service providers with users. In particular, the network system can determine, based on context data associated with a user, whether to perform pre-request matching for that user. A service provider who is pre-request matched with the user can be directed by the network system to relocate via a pre-request relocation direction. When the user submits the service request after the pre-request match, the network system can either automatically transmit an invitation to the pre-request matched service provider or can perform post-request matching to identify an optimal service provider for the user.

Abstract: A computing system computes a timing interval between high-capacity vehicles (HCVs) for each HCV corridor within a geographic region to control rates of HCVs entering and exiting each of the HCV corridors. For each of the HCV corridors, the computing system schedules a first HCV to provide a transport service along the corridor beginning at a first starting time, transmits first schedule data for the corridor to the first HCV, schedules a second HCV to provide the transport service along the corridor beginning at a second starting time after the first starting time according to the timing interval for the corridor, and transmits second schedule data for the corridor to the second HCV.

Abstract: A system computes a timing interval between high-capacity vehicles (HCVs) for each of a plurality of HCV corridors within a geographic region, each respective HCV corridor of the plurality of HCV corridors including a start area. For each respective HCV corridor, the system transmits, via a network communication interface, (i) first data to a first computing device associated with a first HCV, the first data indicating the start area of the respective HCV corridor, and a first start time for the first HCV, and (ii) second data to a second computing device associated with a second HCV, the second data indicating the start area of the respective HCV corridor and a second start time for the second HCV, wherein the first start time for the first HCV and the second start time for the second HCV are based on the computed timing interval for the respective HCV corridor.

Abstract: A network computer system operates to receive service requests from requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting pickup locations for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at their pickup locations, and (iv) selecting a transport provider to service both the first transport request and the second transport request.

Abstract: A network computer system operates to receive service requests from multiple requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting a pickup location for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at the pickup location, and (iv) selecting a transport provider to service both the first transport request and the second transport request, based at least in part on the pickup location, a current location of the transport provider, and the estimated time interval for each of the first requester and the second requester.

Abstract: A network system can communicate with user and provider devices to facilitate the provision of a network-based service. The network system can identify optimal service providers to provide services requested by users. The network can utilize context data in matching service providers with users. In particular, the network system can determine, based on context data associated with a user, whether to perform pre-request matching for that user. A service provider who is pre-request matched with the user can be directed by the network system to relocate via a pre-request relocation direction. When the user submits the service request after the pre-request match, the network system can either automatically transmit an invitation to the pre-request matched service provider or can perform post-request matching to identify an optimal service provider for the user.

Abstract: A network computing system that operates to enable each service provider of a plurality of service providers to select a parametric value that is determinative of a service value for a transport service that is to be provided by the service provider over a given time interval. The network computing system can match service providers to transport requests, based on determination that matched service providers satisfy each of (i) an arrival condition for the transport request of the requester, and (ii) a service value condition that is based at least in part on the selected parametric value of the matched service provider.

Abstract: A computing system computes a timing interval between high-capacity vehicles (HCVs) for each HCV corridor within a geographic region to control rates of HCVs entering and exiting each of the HCV corridors. For each of the HCV corridors, the computing system schedules a first HCV to provide a transport service along the corridor beginning at a first starting time, transmits first schedule data for the corridor to the first HCV, schedules a second HCV to provide the transport service along the corridor beginning at a second starting time after the first starting time according to the timing interval for the corridor, and transmits second schedule data for the corridor to the second HCV.

Abstract: A computing system can detect high capacity vehicles (HCVs) coming online to provide transport services. The computing system monitors transport demand for HCV corridors throughout a geographic region. Each HCV corridor comprises a plurality of possible rendezvous locations and a plurality of possible routes that can be traveled by individual HCVs through the HCV corridor, as opposed to having fixed routes with fixed stops. The computing system can determine a schedule for each HCV corridor, and monitor supply flow of HCVs traveling through each HCV corridor. Based on (i) the transport demand, (ii) the schedule, and (iii) the supply flow of the HCVs for each of the HCV corridors, the computing system can match the HCV with a specified HCV corridor, and transmit match data indicating a start zone of the matching HCV corridor to the computing device of the HCV.

Abstract: A computing system can assign a transport request to a high capacity vehicle (HCV) corridor of a plurality of HCV corridors, where the HCV corridor is associated with a plurality of possible rendezvous locations and a plurality of possible routes that can be traveled by individual HCVs. The computing system can determine, from the transport request of the requesting user, an optimal pick-up location from the plurality of possible rendezvous locations of the HCV corridor for an HCV to rendezvous with the requesting user.

Abstract: A network computer system operates to receive service requests from multiple requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting a pickup location for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at the pickup location, and (iv) selecting a transport provider to service both the first transport request and the second transport request, based at least in part on the pickup location, a current location of the transport provider, and the estimated time interval for each of the first requester and the second requester.

Abstract: A network computer system operates to receive a plurality of service requests over a given time interval, where individual service requests specify a respective target destination and a current location of a respective requester device. For each service request, the network computer system arranges a pooled transport service for the corresponding requester by selecting a service start location, and instructions for enabling the requester to travel to the service start location. The network computer system may select the service provider based on a variety of considerations, including the service start location, the current location of the corresponding service provider, and the determined time interval.

Abstract: A network computer system operates to receive a plurality of service requests over a given time interval, where individual service requests specify a respective target destination and a current location of a respective requester device. For each service request, the network computer system arranges a pooled transport service for the corresponding requester by selecting a service start location, and instructions for enabling the requester to travel to the service start location. The network computer system may select the service provider based on a variety of considerations, including the service start location, the current location of the corresponding service provider, and the determined time interval.

Abstract: A transport facilitation system can receive current location data from driver devices of drivers operating throughout a given region. The system can further receive a pick-up request from a user device of a requesting user within the given region, the pick-up request including pick-up location data. The system can determine a plurality of candidate drivers to service the pick-up request based, at least in part, on the pick-up location data and current location data of the candidate drivers. The system can predict a future location for each of the candidate drivers and select a first driver from the candidate drivers to service the pick-up request based on the predicted future locations. The system may then transmit a transport invitation to the first driver to service the pick-up request.