Abstract:
An apparatus acquires a first piece of trajectory information from among plural pieces of trajectory information, and acquires a first planar graph from among one or more planar graphs. The apparatus generates a second planar graph, based on the first planar graph and plural pieces of position information included in the first piece of trajectory information, and extracts, from among the plural pieces of trajectory information, second pieces of trajectory information indicating trajectories passing a difference portion between the first and second planar graphs. For each of candidate graphs each obtained by excluding a reduction set of edges from the second planar graph, the apparatus calculates optimality of the each candidate graph with which an addition set of trajectories indicated by the first and second pieces of trajectory information are associated, and outputs one of the candidate graphs determined based on the calculated optimality.
Abstract:
An evaluation method which is executed by a processor, the method includes: comparing values of cells between a plurality of pieces of data each including a plurality of cells divided by a plurality of columns and a plurality of records; storing, in a storage unit, information that indicates a plurality of cell sets that have been detected as sets of cells including similar character strings by the comparing; and setting, with reference to the storage unit, a score of each of a plurality of column sets formed by making each of columns of one of the plurality of pieces of data and each of columns of another one of the plurality of pieces of data as a set, based on a score for a record set of records in which a cell set, among the plurality of cell sets, which is included in the column set is included.
Abstract:
A traffic flow rate calculation method includes, by using a road network produced by representing a road system with a plurality of nodes and a plurality of edges including a stationary sensor edge in which a stationary sensor measures the number of moving bodies; obtaining the first number of observations corresponding to the number of trajectories measured by mobile sensors for each path, the each path including the at least one edge, the each of trajectories corresponding to a movement trajectory of the moving body, and the second number of observations corresponding to the number of moving bodies measured by the stationary sensor; estimating an observation rate by using the first number of observations and the second number of observations; calculating a traffic flow rate for the each path by using the estimated observation rate and the first number of observations for each path.
Abstract:
A route information processing apparatus includes: a processor configured to execute a program; and a memory configured to store the program, wherein, based on the program, the processor performs operations to: calculate maximum values corresponding to a Frechet distance between one line segment of one or more line segments between observation points included in a trajectory and each of sets of two nodes corresponding to the one line segment, the nodes being included in a route graph including linked paths which link nodes; and acquire a path corresponding to the trajectory having a smallest value among the maximum values of the one or more line segments.
Abstract:
A matching apparatus sets windows within match data, the windows each having a width larger than that in a window width condition defined in a query, and further sets windows each satisfying an event condition of a window defined in the query as temporary windows. Further, the matching apparatus checks sets of temporary windows against an interval condition and outputs events included in one or more sets of temporary windows each satisfying the interval condition, as a matching result.
Abstract:
A computer-readable storage medium storing an update program that causes a computer to execute a process includes: acquiring an automaton performing matching of data in an input stream hierarchized by tags to a keyword in a query, the automaton in which an initial state, a start state indicating a start tag symbol, an end state indicating an end tag symbol, a transition between the initial state and the start state, a transition between the initial state and the end state, and a transition from the initial state to the initial state are defined; generating a path identifying the position of a start tag based on a hierarchy in the input stream when the start tag is read from the input stream; judging whether or not the generated path meets a condition corresponding to the keyword in the query; generating, when the generated path is judged to meet a condition.
Abstract:
An information processing device includes a memory; and a processor that executes a program stored in the memory, wherein the processor executes an operation including: receiving first stream data and second stream data that each include a piece of reception data representing a set of a key and a numerical value, when detecting, from the second stream data, a piece of reception data with the same key as a key of a piece of reception data of the first stream data, obtaining a processing result by adding together numerical values of the pieces of reception data that have the same key, and storing the processing result in the memory.
Abstract:
A splitting device includes a memory and a processor configured to execute a program including a procedure. The procedure includes: setting a halt condition with a number of point data points to halt equal splitting as to a target region for equal splitting to split equally; splitting the target region for equal splitting, until the number of point data points in the target region for equal splitting is less than the halt condition, by taking the target region for equal splitting, as a region where a point data group exists; setting a region having point data of a number or more according to the halt condition obtained by performing the splitting, to the target region for equal splitting; performing the uniform splitting regarding each region group having less point data than the number according to the halt condition obtained by performing the splitting.
Abstract:
A computer-implemented method of predicting energy use for a route including inputting map data of roads included in K trips in a geographical area, predictors of rate of energy use along the roads, and energy consumption data of the K trips. The method includes dividing each of the roads in the map data for all the trips into segments of length measure λi; grouping the segments from the trips into a number N of clusters, using an algorithm to build a model predicting the weights Wj based on solving a system of equations, one per trip, assigning the predicted weight applied to the cluster in which the segment was grouped and storing a segment ID with the corresponding cluster ID or predicted rate of energy use Yi to allow prediction of energy use for a route in the geographical area incorporating one or more of the segments.
Abstract:
A data processing method includes steps of; allowing establishment of a first flag or a second flag for each of a plurality of items where corresponding values are inputted sequentially; upon detecting that a value associated with an item where the first flag is established in an Nth place is inputted and that a value associated with an item where the second flag is established in an Mth place (M is equal to or larger than N) is inputted, executing a predetermined processing to values in a range from the value that is inputted by associating with the item where the first flag is established in the Nth place to the value that is inputted by associating with the item where the second flag is established in the Mth place; and executing a processing of outputting a processed result in order from the item in the Nth place.