Abstract: Embodiments include method, systems and computer program products for identifying abandoned objects. In some embodiments, first visual media data of an object can be received from a first source. The first visual media data of the object can be processed to identify a type of the object. An identifier associated with the type of the object can be generated. The object can be identified in second visual media data received from a second source. A status of the object can be determined based at least in part on at least one abandonment factor derived from the first visual media data and the second visual media data. The identifier associated with the object and a location associated with the object can be added to a list of objects having the same status, based at least in part on the status of the object.

Abstract: Techniques for efficient retrosynthesis analysis are provided. A computer-implemented method for determining whether a target compound can be synthesized using known pathways for similar compounds includes receiving, by a processor, target compound data including a target compound. The method further includes obtaining, by the processor, a similar compound to the target compound, along with a reaction rule for synthesizing the similar compound. The method further includes applying, by the processor, the reaction rule to the target compound to generate a set of precursors. The method further includes generating, by the processor, a notification based on the set of precursors.

Abstract: Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

Abstract: Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

Abstract: Technique to determine relative relevance of pairs of nodes in a linked data graph, such as an RDF graph, including calculation of raw relevance scores (which are based upon adjacency relations between nodes after edge filtering, the incoming and outgoing degrees of nodes in the graph after the edge filtering, and the distance (or weight) values of the edge(s)) and/or “refined relevance scores,” which take into account “complementary nodes.

Abstract: Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.

Abstract: Travel planning is provided for a plurality of individuals vying for the use of shared transportation vehicles. A set of travel event requests for the plurality of individuals are accessed as are a set of travel preferences for the plurality of individuals and the travel event requests. Schedules are generated that specify the use of the shared transportation vehicles and that are based upon the set of travel event requests and a tradeoff factor that is derived from scheduling compromises relative to the set of travel preferences. Conflicts are identified, within the schedule and relative to at least one of the shared transportation vehicles, and then presented to at least two individuals. A conflict decision is received from the at least two individuals and the tradeoff factor is modified based upon the conflict decision. The schedule is updated based upon the conflict decision and the tradeoff factor as modified.

Abstract: Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.

Abstract: Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.

Abstract: Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.