Abstract: Example embodiments relate to providing visual analytics of temporal-spatial relationships. In example embodiments, power meters may be located at regions within a building for collecting power consumption data at regular intervals. The power consumption data can be recursively processed to generate a pixel calendar tree by using a power meter hierarchy to subdivide the pixel calendar tree into tree portions according to a proportion of the power consumption data attributed to each of power meter nodes, where the tree portions are arranged in the pixel calendar tree according to an importance of the proportion; generating pixel cells in the pixel calendar tree that each represent a day in the power consumption data; and generating cell borders that each surround one of the pixel cells. At this stage, a pixel calendar display of a physical infrastructure of the building that includes the pixel cells and the cell borders can be generated.

Abstract: Attributes in data records are identified. Episodes corresponding to the respective attributes include respective data records. The episodes are scored, where scoring of a particular one of the episodes is based on relative time densities between successive data records of the particular episode. A visualization of at least some of the episodes to provide an alert of time-dense episodes.

Abstract: Example embodiments relate to providing visual analytics of spatial time series data. In example embodiments, sensors may be located at regions within a building for collecting sensor data at regular time intervals. A sensor hierarchy can be generated including sensor nodes that are hierarchically arranged according to a physical infrastructure of the building, where each of the sensor nodes corresponds to a sensor. Sensor data can be obtained from the sensors, and a pixel calendar tree can be generated based on the sensor data and the sensor hierarchy, where the pixel calendar tree is recursively subdivided into tree portions according to a proportion of the sensor data attributable to each of the sensors. The pixel calendar tree can be displayed, where each of the tree portions includes time series sensor data of a corresponding region that is generated based on the sensor data.

Abstract: Methods, systems, and computer program products are provided for generating application-aware data partitioning to support parallel computing. A label for a user defined data partitioning (UDP) key is generated by a labeling process to configure data partitions of original data. The UDP is labeled by the labeling process to include at least one key property excluded from the original data. The data partitions are evenly distributed to co-locate and balance the data partitions and corresponding computations performed by computational servers. A data record of the data partitions is retrieved by performing an all-node parallel search of the computational servers using the UDP key.

Abstract: To coordinate tasks executed by a plurality of threads that each includes plural task sections, a call of a mark primitive to mark a first point after a first of the plural task sections is provided. Also, a call of a second primitive is provided to indicate that a second of the plural task sections is not allowed to begin until after the plurality of threads have each reached the first point.

Abstract: An event occurring in a particular geographic region is identified based on disseminated information containing public commentary in the particular geographic region. Attributes that are related to the event are identified, and sentiment words relating to the identified event are extracted from the disseminated information, where the extracted sentiment words are in a local language of the particular geographic region. A sentiment trend visualization is generated that depicts a trend of sentiments of at least a particular one of the identified attributes, wherein the sentiments are based on the sentiment words for at least the particular attribute.

Abstract: A scatter plot that represents plural periodic time intervals is animated as new data points are received, where the animating includes performing real-time backward rewriting. The real-time backward rewriting includes overlaying a subset of previously written data points with the new data points, and painting a remainder of previously written data points outside the subset in the scatter plot, where painting the remainder of previously written data points is performed without shifting pixels corresponding to the remainder. A divider structure is drawn in the scatter plot to indicate a position in the scatter plot between a current time point and a previous time point.

Abstract: Multi-stream analytics is disclosed. An example method of multi-stream analytics with a query engine includes punctuating unbounded streaming data into data chunks, each of the data chunks representing a bounded data set in the unbounded streaming data. The method also includes processing one of the data chunks. The method also includes rewinding a query instance for processing another of the data chunks.

Abstract: A region is selected in a visualization that displays cells representing respective events, the cells being depicted in the visualization according to a first group of attributes of the events, where the region corresponds to a subset of the events. In response to detecting a first type of input provided with respect to the region, a semantic zoom-in visualization of the region is generated, the semantic zoom-in visualization depicting the cells representing the events of the subset at an enlarged scale and according to the first group of attributes and at a higher resolution to show further information relating to the events of the subset. In response to detecting a second type of input provided with respect to the region, a semantic drill-down visualization of the region is generated, the semantic drill-down visualization visualizing the events of the subset at an enlarged scale and according to a second group of attributes having at least one attribute that differs from the attributes of the first group.

Abstract: According to an example, a catalog of scripts may be managed. Management of the catalog of scripts may include the addition of a script description into the catalog of scripts. In one example, the script description may be directly added to the catalog of scripts. In another example, the script description may be added through generation of a merged query of scripts.

Abstract: A technique for resending messages can include determining if a particular message with a first unique identifier has been received by a recipient task among a number of potential recipient tasks in a distributed streaming system, notifying the number of potential recipient tasks to ignore the particular message with the first unique identifier, and resending the particular message with a second unique identifier.

Abstract: The present invention relates to devices and methods that coordinate an external conversation process between entities with an internal workflow of one of the entities. More particularly, it relates to devices and methods that are compliant with an inter-enterprise conversation process standard for routing electronic commerce documents between enterprises. Particular aspects of the present invention are described in the claims, specification and drawings.

Abstract: The present application is directed to a data management system. The data management system is implemented within a computer system that includes one or more processors, one or more electronic memories, and a memory-mapped file facility that electronically stores data. The data management system, implemented by data management system control routines that are executed by the one or more processors, retrieves a particular projection of a multi-level, multi-dimension data set stored within the ONP-tree data structure that contains the multi-level, multi-dimension data set.

Abstract: A technique of recovering a failure in a data processing system comprises recording a number of input channels and sequence numbers for a number of input tuples transferred to a recipient task, recording a number of output channels and sequence numbers for a number of output tuples, and if a failure occurs, resolving the input and output channels.

Abstract: A technique may include generating a plurality of segments from sentences in a data set. The technique may further include determining the explanatoriness of each segment.

Abstract: The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.

Abstract: A nested chain of densest subgraphs is derived by a computer from a given graph that has multiple vertices and edges. The two ends of each edge are assigned with respective incident weights, and each vertex is given a vertex weight. A weight balancing process is carried out by the computer to iteratively go through the edges to adjust the incident weights of each edge and the vertex weights of the vertices connected by that edge to reduce a difference between the vertex weights of the two vertices. After the balancing, the vertex weights are put in an ordered sequence according to their values, and a nested chain of densest subgraphs is derived from the ordered sequence.

Abstract: For plural categorical values of a first attribute, more relevant categorical values of a second attribute are selected from among candidate categorical values of the second attribute, where the selecting uses a relevance determination process that considers frequencies of occurrence of respective pairs of the categorical values of the first and second attributes. A visualization that includes groups of cells corresponding to the respective pairs of categorical values of the first and second attributes is generated. At least one of the groups includes cells assigned visual indicators based on values of a third attribute.

Abstract: A method of generating discrete event simulation data using a query is provided herein. The method includes retrieving a trajectory specifying a service access event for a customer accessing a service in a simulation. The method also includes processing, in a relational database query, one or more pending events corresponding to one or more customers accessing the service before the customer. Additionally, the method includes processing, in the relational database query, the service access event. Processing the service access event occurs after processing the one or more pending events. The method also includes providing a result for the relational database query. The result comprises the trajectory, and the one or more trajectories.

Abstract: According to an example, a dataflow directed acyclic graph including nodes and edges connecting the nodes. Parameters for the nodes are calculated, and the parameters may include batch size and a degree of parallelism.