Abstract: A method, apparatus and computer program product for Functional Space-Time Trajectory Clustering. The method comprises receiving collections of data structures comprising location and time descriptors. The method further comprises estimating functional curves from the collections of data structures. The method further comprises reducing dimensions of the functional curves; and clustering the functional curves into clusters.

Abstract: According to some embodiments of the present invention there is provided a computerized method for visually modifying a rule. The method may comprise receiving a rule and two or more data records, the rule comprising two or more computation instructions and each one of the data records comprising one or more physical location value. The method may comprise displaying a simulation comprising visual objects, each of the visual objects showing a result of applying the rule to one of the data records, and displayed on a computerized display at a position corresponding to the physical location value of the data records. The method may comprise receiving a marking from a user of one or more of the visual objects on the computerized display. The method may comprise modifying the computation instructions to produce a modified rule, based on the markings, and sending the modified rule.

Abstract: A capability to visualize temporal aspects of serial processes is provided. A process model of a serial process that includes a plurality of events and a plurality of stages is generated. The process model represents each of one or more instances of the serial process as a series of nodes. Each node represents an event and a time at which the event occurred in an instance of the serial process. For each stage of the serial process, a time-coordinate of a first node and a time-coordinate of a second node are altered while maintaining a difference in time between the first and second nodes. A common point lies between the first and second nodes as a result of altering the time-coordinates. A visualization of the process models is presented such that, for each stage of the serial process, a plurality of line segments intersect at the common point.

Abstract: An example system includes a processor to receive temperature data from a plurality of sensors disposed at locations more sensitive to temperature change in a plurality of server racks. The processor is to also generate a statistical model comprising a continuous spatial statistical distribution of temperature values based on the temperature data. The processor is to further generate a pseudo heat map based on the statistical model.

Abstract: Automatic determination of presence-related roles. Presence data of a plurality of users in a space comprised of one or more zones is received. For each user of the plurality of users a value of a target metric in a zone is computed based on the presence data, the target metric defining a measure of user presence. A presence-related role is assigned to a user with respect to the zone, the presence-related role being comprised in a set of one or more presence-related roles describing categories of spatiotemporal occupancy relation between the user and the zone, wherein said assigning comprises applying a mapping function on the value, the mapping function maps between values of the target metric and the one or more presence-related roles, the mapping function is affected by analytics of the presence data.

Abstract: A method for the calculation of a wind turbine blade deflection is described. The method utilises a known blade modal profile in the calculation of the blade deflection, such that the a priori knowledge of the blade excitation modes can be used with a simple distance measurement to determine the blade deflection shape. The calculated blade deflection can then be used as an input to control wind turbine operation, e.g. where it is likely that the deflected blade might result in a tower strike.

Abstract: A computer-implemented method, computerized apparatus and computer program product for efficient solution of nearest object problems. A set of objects having non-point shapes representable by one or more geometric elements are obtained. For each object in the set the one or more geometric elements are sampled to obtain a set of points representing the set of objects. A Voronoi diagram is constructed for the set of points, whereby a subdivision of a space accommodating the set of objects into a plurality of cells, each cell containing a single point of the set of points and defining a region of closest neighbors of the point, is obtained. Cells containing points representing the same object are aggregated into a unified cell defining an estimated region of closest neighbors of the object.

Abstract: Automatic determination of presence-related roles. Presence data of a plurality of users in a space comprised of one or more zones is received. For each user of the plurality of users a value of a target metric in a zone is computed based on the presence data, the target metric defining a measure of user presence. A presence-related role is assigned to a user with respect to the zone, the presence-related role being comprised in a set of one or more presence-related roles describing categories of spatiotemporal occupancy relation between the user and the zone, wherein said assigning comprises applying a mapping function on the value, the mapping function maps between values of the target metric and the one or more presence-related roles, the mapping function is affected by analytics of the presence data.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: A capability to visualize temporal aspects of serial processes is provided. A process model of a serial process that includes a plurality of events and a plurality of stages is generated. The process model represents each of one or more instances of the serial process as a series of nodes. Each node represents an event and a time at which the event occurred in an instance of the serial process. For each stage of the serial process, a time-coordinate of a first node and a time-coordinate of a second node are altered while maintaining a difference in time between the first and second nodes. A common point lies between the first and second nodes as a result of altering the time-coordinates. A visualization of the process models is presented such that, for each stage of the serial process, a plurality of line segments intersect at the common point.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: Visualizations of a serial process are provided. A process model of a serial process is constructed using an underlying statististical model. The process model represents each instance of the serial process as a series of interconnected nodes, wherein (i) the serial process includes a plurality of events; (ii) each node is associated with an event and a time at which the associated event occurred in an instance of the serial process; and (iii) connectors link nodes together to form the series of interconnected nodes, the connectors representing stages of serial process. The stages are scored and categorized into various categories based, at least in part, on the process model. One or more of the categories is associated with outlier stages. A visualization of the process model is presented such that the visualization associates the stages of the instances of serial process with respective categories.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: A method, apparatus and computer program product for Functional Space-Time Trajectory Clustering. The method comprises receiving collections of data structures comprising location and time descriptors. The method further comprises estimating functional curves from the collections of data structures. The method further comprises reducing dimensions of the functional curves; and clustering the functional curves into clusters.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: A method and system for generating a map using a computer is based on data and weighted factors to minimize corresponding projection distortions. The method and system includes determining visualization goals from analyzing a set of datasets for a map using the computer. A set of visualization characteristics are calculated for each dataset based on the visualization goals using the computer. The visualization characteristics are analyzed to weight factors for each of the datasets. Each of the weighted factors is adjusted based on the relevance of each of the datasets for visualization of the map. An aggregate vector of weighted factors is calculated based on all of the datasets, and the map for visualization is generated based on the aggregate vector of weighted factors.

Abstract: A computerized clustering method. The method comprises receiving a spatial point dataset comprising a plurality of spatial points in a space, heuristically calculating, using a processor, a plurality of ?-shape based segmentations such that each of the plurality of ?-shape based segmentations defines a plurality of polygonal areas that cluster the plurality of spatial points in a plurality of clusters which collectively bounds the plurality of spatial points, presenting to an operator in each sequential iteration of a plurality of sequential iterations another of the plurality of ?-shape based segmentations, and selecting by the operator one or more of the plurality of ?-shape based segmentations.

Abstract: According to some embodiments of the present invention there is provided a computerized method for visually modifying a rule. The method may comprise receiving a rule and two or more data records, the rule comprising two or more computation instructions and each one of the data records comprising one or more physical location value. The method may comprise displaying a simulation comprising visual objects, each of the visual objects showing a result of applying the rule to one of the data records, and displayed on a computerized display at a position corresponding to the physical location value of the data records. The method may comprise receiving a marking from a user of one or more of the visual objects on the computerized display. The method may comprise modifying the computation instructions to produce a modified rule, based on the markings, and sending the modified rule.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include receiving, by a computer, signals from a multiplicity of independently operated mobile entities, and identifying, based on the received signals, a collaboration between a first given entity and a second given entity. Based on the received signals, a quality of the collaboration can be computed.