Abstract: There is provided a computer-implemented method (300) of calculating a confidence score associated with a historical location estimate of a user equipment, UE. The computer-implemented method is implemented by first software entity. The method comprises retrieving (305) a historical UE location estimate, the historical UE location estimate having been provided by a second software entity, determining (310) whether the historical UE location estimate meets one or more criteria associated with calculating a confidence score, and based on the historical UE location estimate meeting the one or more criteria, calculating (380) a confidence score associated with the historical location estimate of the UE.

Abstract: There is provided a computer-implemented method (300) of calculating a confidence score associated with a historical location estimate of a user equipment, UE. The computer-implemented method is implemented by first software entity. The method comprises retrieving (305) a historical UE location estimate, the historical UE location estimate having been provided by a second software entity, determining (310) whether the historical UE location estimate meets one or more criteria associated with calculating a confidence score, and based on the historical UE location estimate meeting the one or more criteria, calculating (380) a confidence score associated with the historical location estimate of the UE.

Abstract: There is provided a computer-implemented method (300) of calculating a confidence score associated with a historical location estimate of a user equipment, UE. The computer-implemented method is implemented by first software entity. The method comprises retrieving (305) a historical UE location estimate, the historical UE location estimate having been provided by a second software entity, determining (310) whether the historical UE location estimate meets one or more criteria associated with calculating a confidence score, and based on the historical UE location estimate meeting the one or more criteria, calculating (380) a confidence score associated with the historical location estimate of the UE.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: A computer-implemented method of planning a path for a mobile robot in the presence of a set of obstacles comprises: computing for each obstacle a probabilistic obstacle position distribution; computing at least one path-independent function as a combination of the probabilistic obstacle position distributions; and for at least one candidate path, determining an upper bound on the total probability of obstacle collision along that path, by aggregating the path-independent function based on an area defined by the candidate path and a mobile robot shape, wherein the path-independent function is independent of the candidate path.

Abstract: A method is provided for identifying an anomaly in a communications network, the communications network covering a geographical area. The method comprises defining a plurality of regions within the geographical area. A measurement of a network performance characteristic is received from a user equipment, UE, connected to the communications network. The measurement is associated with a geographical location. A region of the plurality of regions which contains the geographical location is identified, and it is determined that there is an anomaly in the communications network within the identified region.

Abstract: Disclosed are analogues of hinokitiol, methods for preparing them, and pharmaceutical compositions thereof. Also disclosed are methods for their use in treating iron-related diseases.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: The invention provides a computer-implemented method of planning a path for a mobile robot such as an autonomous vehicle in the presence of K obstacles. The method uses, for each of the K obstacles, a shape Bk and a density function pk(x) representing the probabilistic position of the obstacle. The method repeats the following steps for at least two different paths A: —choosing a path A, where A is the swept area of the robot within a given time interval; and—calculating based on the density function of each obstacle and the swept path an upper bound on the total probability of at least one collision FD between the robot and the K obstacles. This allows a number of candidate paths to be ranked for safety. By precomputing factors of the computational steps over K obstacles, the computation per path is O(N), and not O(NK). A safety threshold can be used to filter out paths below that threshold.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: A method of diagnosing faults in a utility supply network involves receiving performance data indicative of performance of the utility supply network, and receiving historical performance data indicative of a historical performance of the utility supply network and a fault associated with the historical performance data. A fault in the utility supply network is determined based on a comparison of the performance data with the historical performance data.

Abstract: A computer-implemented method of planning a path for a mobile robot in the presence of a set of obstacles comprises: computing for each obstacle a probabilistic obstacle position distribution; computing at least one path-independent function as a combination of the probabilistic obstacle position distributions; and for at least one candidate path, determining an upper bound on the total probability of obstacle collision along that path, by aggregating the path-independent function based on an area defined by the candidate path and a mobile robot shape, wherein the path-independent function is independent of the candidate path.

Abstract: A method is provided for identifying an anomaly in a communications network, the communications network covering a geographical area. The method comprises defining a plurality of regions within the geographical area. A measurement of a network performance characteristic is received from a user equipment, UE, connected to the communications network. The measurement is associated with a geographical location. A region of the plurality of regions which contains the geographical location is identified, and it is determined that there is an anomaly in the communications network within the identified region.

Abstract: A computer-implemented method of determining a priority of an incident in a utility supply involves receiving an indication of the incident in the utility supply network, receiving subjective data relating to user perception of performance of the utility supply network and determining a priority of the incident based on the subjective data. Determining the priority may also involve using objective data about the performance of the utility supply network and information about known or planned outages.

Abstract: A first aspect of the invention provides a method of fault monitoring in a utility supply network, the method comprising: receiving user queries, each user query about a performance of the network at a respective location; defining a region based on the locations specified in the received user queries; determining an estimate of a user population in the region; and according the region, based on the estimate, a priority for one or more of fault investigation and remediation.

Abstract: A method of diagnosing faults in a utility supply network involves receiving performance data indicative of performance of the utility supply network, and receiving historical performance data indicative of a historical performance of the utility supply network and a fault associated with the historical performance data. A fault in the utility supply network is determined based on a comparison of the performance data with the historical performance data.

Abstract: The invention provides a computer-implemented method of planning a path for a mobile robot such as an autonomous vehicle in the presence of K obstacles. The method uses, for each of the K obstacles, a shape Bk and a density function pk(x) representing the probabilistic position of the obstacle. The method repeats the following steps for at least two different paths A:—choosing a path A, where A is the swept area of the robot within a given time interval; and—calculating based on the density function of each obstacle and the swept path an upper bound on the total probability of at least one collision FD between the robot and the K obstacles. This allows a number of candidate paths to be ranked for safety. By precomputing factors of the computational steps over K obstacles, the computation per path is O(N), and not O(NK). A safety threshold can be used to filter out paths below that threshold.

Abstract: Disclosed are analogues of hinokitiol, methods for preparing them, and pharmaceutical compositions thereof. Also disclosed are methods for their use in treating iron-related diseases.