Abstract: Computer-implemented methods, systems and computer program products for facilitating operationally customized access to smart vehicles are provided. Aspects include receiving request to access a smart vehicle. Aspects also include receiving vehicle operation constraints associated with the smart vehicle using a processor. Aspects also include generating a vehicle policy based at least in part on the request to access the smart vehicle and the vehicle operation constraints using the processor. The vehicle policy includes rules for operation of the smart vehicle. Aspects also include transmitting the vehicle policy to the smart vehicle. Aspects also include moderating the operation of the smart vehicle based on at least in part the vehicle policy.

Abstract: An example operation may include one or more of generating a proposal to perform a ledger operation at a first node, informing one or more second nodes of the proposal, receiving a decision on consensus among the first node and the one or more second nodes for the proposal, and performing the ledger operation at the first node when there is consensus, wherein the ledger operation changes a state database of a ledger of the first node and wherein the state database corresponds to a blockchain stored in the ledger.

Abstract: An example operation may include one or more of receiving a request to execute a cross-chain transaction, identifying disparate locations of two or more different blockchains that have stored therein data for the cross-chain transaction, retrieving data from data blocks of the two or more different blockchains, respectively, based on the identified disparate locations, executing the cross-chain transaction which takes the retrieved data from the two or more different blockchains as inputs to generate a cross-chain result, and storing the cross-chain result via a data block of a distributed ledger.

Abstract: An example operation may include one or more of storing, via a master chain, partition information that links together storage across a plurality of blockchains, receiving a request to execute a blockchain transaction from a client, determining whether the blockchain transaction is associated with data stored on one blockchain or data stored separately on different blockchains based on the partition information stored on the master chain, and, in response to a determination that the blockchain transaction is associated with data stored separately on different blockchains, identifying, via the master chain, a location of each blockchain from among the different blockchains and transmitting the locations to a system configured to perform the blockchain transaction.

Abstract: An example operation may include one or more of generating a proposal to perform a ledger operation at a first node, informing one or more second nodes of the proposal, receiving a decision on consensus among the first node and the one or more second nodes for the proposal, and performing the ledger operation at the first node when there is consensus, wherein the ledger operation changes a state database of a ledger of the first node and wherein the state database corresponds to a blockchain stored in the ledger.

Abstract: Computer-implemented methods, systems and computer program products for facilitating operationally customized access to smart vehicles are provided. Aspects include receiving request to access a smart vehicle. Aspects also include receiving vehicle operation constraints associated with the smart vehicle using a processor. Aspects also include generating a vehicle policy based at least in part on the request to access the smart vehicle and the vehicle operation constraints using the processor. The vehicle policy includes rules for operation of the smart vehicle. Aspects also include transmitting the vehicle policy to the smart vehicle. Aspects also include moderating the operation of the smart vehicle based on at least in part the vehicle policy.

Abstract: An example operation may include one or more of storing, via a master chain, partition information that links together storage across a plurality of blockchains, receiving a request to execute a blockchain transaction from a client, determining whether the blockchain transaction is associated with data stored on one blockchain or data stored separately on different blockchains based on the partition information stored on the master chain, and, in response to a determination that the blockchain transaction is associated with data stored separately on different blockchains, identifying, via the master chain, a location of each blockchain from among the different blockchains and transmitting the locations to a system configured to perform the blockchain transaction.

Abstract: An example operation may include one or more of receiving a request to execute a cross-chain transaction, identifying disparate locations of two or more different blockchains that have stored therein data for the cross-chain transaction, retrieving data from data blocks of the two or more different blockchains, respectively, based on the identified disparate locations, executing the cross-chain transaction which takes the retrieved data from the two or more different blockchains as inputs to generate a cross-chain result, and storing the cross-chain result via a data block of a distributed ledger.

Abstract: A method for reviewing digital publications includes receiving a digital publication while it is being composed. Potential audiences are identified for the digital publication. Information is received from feeds and social media content. A context is modeled for each potential audience based on the received information. The digital publication is analyzed for each potential audience, using the modeled context, by matching content of the digital publication candidate to popular culture references and news information of the corresponding modeled context. Sentiment analysis is performed on the matched content to determine when the digital publication candidate represents a reputational risk to the user for at least one of the potential audiences. A segment of the digital publication candidate corresponding to the matched content is highlighted when it is determined that the reputational risk exists.

Abstract: Jumbo query plans are generated by applying at least one sharing technique and combining at least two of the pattern queries. Costs of the jumbo query plans may then be estimated and used to search for an optimal query plan. The optimal query plan may then be executed on an input data stream to generate an output data stream.

Abstract: A route planner for a transportation network is disclosed. The route planner generates k suggested routes based on a user query using a diversified k shortest routes technique. The diversified k shortest routes techniques analyzes a transportation graph and suggests k routes to the user. The diversified k shortest routes can provide a user with options to take the next best route if they miss the optimal one. These options also include other preferences, such as less number of transfers, as long as they are reasonable in terms of total travel time. The suggested routes take into account travel calendars, as well as location-to-location queries which require geocoding and reverse geocoding capabilities. Transfers between different types of transportation services such as train and bus are also supported.

Abstract: A computer-implemented technology for planning routes is described herein. In accordance with one aspect, travel data of commuters of a transportation network are provided. Continuous distributions of travel time and waiting time are generated from the travel data. The continuous distributions of travel time and waiting time are associated to a transportation graph of the transportation network. The transportation graph includes nodes corresponding to stops of the transportation network and edges interconnecting the nodes. Travel time and waiting time are associated as costs of the edges in the transportation graph. In response to receiving input parameters, expected costs of candidate routes in the transportation graph are determined in accordance with a modified multi criteria shortest path technique. The modified multi criteria shortest path technique invokes a subroutine to retrieve accurate costs of routes based at least on the costs of the edges in the transportation graph.

Abstract: Disclosed herein are technologies for facilitating optimization of pattern queries. In accordance with one aspect, jumbo query plans are generated by applying at least one sharing technique and combining at least two of the pattern queries. Costs of the jumbo query plans may then be estimated and used to search for an optimal query plan. The optimal query plan may then be executed on an input data stream to generate an output data stream.

Abstract: A route planner for a transportation network is disclosed. The route planner generates k suggested routes based on a user query using a diversified k shortest routes technique. The diversified k shortest routes techniques analyzes a transportation graph and suggests k routes to the user. The diversified k shortest routes can provide a user with options to take the next best route if they miss the optimal one. These options also include other preferences, such as less number of transfers, as long as they are reasonable in terms of total travel time. The suggested routes take into account travel calendars, as well as location-to-location queries which require geocoding and reverse geocoding capabilities. Transfers between different types of transportation services such as train and bus are also supported.

Abstract: A computer-implemented technology for planning routes is described herein. In accordance with one aspect, travel data of commuters of a transportation network are provided. Continuous distributions of travel time and waiting time are generated from the travel data. The continuous distributions of travel time and waiting time are associated to a transportation graph of the transportation network. The transportation graph includes nodes corresponding to stops of the transportation network and edges interconnecting the nodes. Travel time and waiting time are associated as costs of the edges in the transportation graph. In response to receiving input parameters, expected costs of candidate routes in the transportation graph are determined in accordance with a modified multi criteria shortest path technique. The modified multi criteria shortest path technique invokes a subroutine to retrieve accurate costs of routes based at least on the costs of the edges in the transportation graph.