Abstract: One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example.

Abstract: Identifying entities in email signature blocks is described. A system scores each token, in a sequence of tokens from an email signature block, based on entity types, wherein each token is a word, a punctuation symbol, or an end-of-line character. The system identifies each entity sequence which includes a number of entities that matches the number of tokens in the sequence of tokens. The system identifies an entity sequence with a highest score based on applying scores for each token in the sequence of tokens to each identified entity sequence. The system outputs the sequence of tokens as an identified set of entities based on the entity sequence with the highest score.

Abstract: Embodiments relate to storing sparse matrices in an in-memory column-oriented database system. Specifically, recent hardware shifts of primary storage from disc into memory, allow execution of linear algebra queries directly in the database engine. Dynamic matrix manipulation operations (like online insertion or deletion of elements) are not covered by most linear algebra frameworks. Therefore a hybrid architecture comprises a read-optimized main structure, and a write-optimized delta structure. The resulting system layout derived from the Compressed Sparse Row (CSR) representation, integrates well with a columnar database design. Moreover, the resulting architecture is amenable to a wide range of non-numerical use cases when dictionary encoding is used. Performance in specific examples is evaluated for dynamic sparse matrix workloads, by applying work flows of nuclear science and network graphs.

Abstract: Techniques are described for implementing a cloud computer system (e.g., “a cloud service”) for facilitating the synchronization of enterprise data between mobile computing devices and enterprise computing systems (e.g., human resource management systems, business management systems, or the like). The cloud service may convert enterprise data received from different enterprise computing systems to a format that can be managed and updated easily by mobile computing devices. The converted format may enable distinct information to be easily identified. The enterprise data may be associated with policy information and version information to manage synchronization of the enterprise data. In some embodiments, the cloud service may manage synchronization with mobile computing devices based on classification of a communication connection the mobile computing devices have to a wireless network.

Abstract: Methods, systems, and computer programs are presented for an online community management system. One method calculates users' reputations that are based on the activities of each user in the online community. The reputation measures the quality of the user activities in the community. Further, the method includes operations for periodically calculating reputation statistical measures based on the users' reputations, and for sorting the users based on the reputation statistical measures. A user interface for a manager of the online community is provided, the user interface including a presentation of reputation information about a group of users of the online community identifying trends in changes of the reputation. The group of users is selected based on the sorting, and the user interface provides an option to select a first user from the group of users to obtain a display of events associated with the selected user in the online community.

Abstract: A data analysis system and method for determining a measure of overlap between data entries in a number N of columns in a database. Sorted hash lists are provided. An N×N matrix having cells Cij is provided. A set of N indexed read pointers pointing to the hash lists are provided. Each read pointer points to the first entry of the associated hash list. The value of cells Cij in the matrix having indices i,j, wherein i and j each correspond to any of the index numbers of the read pointers pointing to the lowest value are incremented. The read pointer(s) pointing to the lowest value are incremented to point to the next different hash value(s). This is repeated until the last read pointer(s) points to the last entry of the associated hash list.

Abstract: There is provided a method for determining, for a set of co-ordinate records associating co-ordinates with incident values, the numbers of incidents associated with co-ordinates within a query area. Co-ordinate data is stored as data representing a binary tree comprising leaf nodes, a root node and branch nodes wherein the leaf nodes are associated with individual items of co-ordinate data identified by the set of co-ordinate records, and the root node and branch nodes are each associated with a pair of child nodes, and are each associated with split values. In response to a query identifying a query area the binary tree is then recursively processed starting with the root node.

Abstract: Systems, methods, and other embodiments associated with identifying non-technical line loss using data from smart meters in an electric grid are described. In one embodiment, a method includes querying a utility database to collect meter data, wherein the meter data is from electric meters connected to a transformer in an electric grid. Querying the utility database includes collecting the data according to a plurality of intervals over a period of time. Electric consumption and voltage variances are analyzed for the set of meters to identify a first set of intervals that satisfy a threshold for electric consumption and to identify a second set of intervals that satisfy a threshold for voltage variances. The first set of intervals is compared with the second set of intervals to determine whether the set of meters are associated with non-technical line loss.

Abstract: A geographical information system (GIS) is described that enables querying, analysis and visualization of real-time streaming data pertaining to at least one moving object or entity (e.g., vehicles, people, sensors, weather phenomena, etc.) in conjunction with relatively static multi-temporal geospatial data. An application programming interface is provided to present the GIS functionality for handling dynamically moving objects or entities to clients.

Abstract: The present invention generally relates to systems and methods for document redaction. The disclosed techniques adapt to the needs of different levels of data sensitivity and different needs for disclosure or analysis by using pre-defined templates related to use cases, and mapping those to the relative sensitivity of private data types both in their natural form and after redaction by various redaction types. In this way, data is given the appropriate level of protection within the needs of a given use case.

Abstract: The present invention relates to a method and system for constructing a database for a product demand/supply connection network of a technology market connection and analysis apparatus comprising a microprocessor for controlling the construction of a database for implementing a product demand/supply connection network, and further comprising the database for a product demand/supply connection network, in which information relating to the database generated in accordance with the control of the microprocessor is stored.

Abstract: A computer-implemented method for clustering data may include (1) identifying a plurality of samples, (2) locating a sample, from within the plurality of samples, that is a centroid of a cluster, (3) locating another sample that is, among the plurality of samples, next closest to the centroid relative to a most-recently located sample, (4) determining whether an attribute of the next-closest sample matches an attribute of the centroid, (5) determining whether to adjust a radius of the cluster based on whether the attribute of the next-closest sample matches the attribute of the centroid, and (6) repeating the steps of locating the next-closest sample, determining whether the attributes match, and determining whether to adjust the radius of the cluster, until the attribute of the next-closest sample does not match the attribute of the centroid. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic partition selection. One of the methods includes receiving a representation of a query plan generated for a query, wherein the query plan includes a dynamic scan operator that represents a first computing node obtaining tuples of one or more partitions of a table from storage and transferring the tuples to a second computing node that executes a parent operator of the dynamic scan operator. A partition selector operator is generated corresponding to the dynamic scan operator. A location in the query plan is determined for the partition selector operator. A modified query plan is generated having the partition selector operator at the determined location.

Abstract: A device may receive information associated with a write operation to be performed on a storage volume included in a cloud computing environment, and may divide the information into a group of write frames. Each write frame may include a respective portion of the information. The device may determine information that identifies members of a replication set associated with the storage volume. The device may provide each write frame to each member. The device may receive a reply frame, associated with a write frame, from a member. The device may determine that the reply frame is a last reply frame associated with the write frame and may modify source information to form a modified reply frame. The device may provide the modified reply frame. The modified reply frame may be provided to indicate that the portion of the write operation, associated with the write frame, has been successfully performed.

Abstract: A mechanism is provided in a data processing system for personalized quantitative measure of accessibility. For a given web site or web application, the mechanism accesses existing crowd sourced user ratings. The mechanism generates a crowd source score for the given web site or web application based on the crowd sourced user ratings. The mechanism generates a compliance score for the given web site or web application based on compliance data published for the given web site or web application. The mechanism obtains a static analysis score for the given web site or web application. The mechanism generates weights for a given user based on user profile information of the given user and applies the weights to the crowd source score, the compliance score, and the static analysis score to form weighted data. The mechanism generates a personalized accessibility score based on the weighted data.

Abstract: Example apparatus and methods create and maintain a functional mirror of file system metadata for an active file system. The functional mirror may be implemented as a set of database tables that allow a journal functionality for information received from the active file system. Example apparatus and methods also restore the file system metadata from the functional mirror. Mirror creation and maintenance can operate in parallel. Mirror maintenance and metadata restore can also operate in parallel. The functional mirror may be created primarily using a systematic, system-wide, multi-threaded crawler approach whose results are updated using an event-driven approach that accounts for changes that may make obsolete information acquired during the crawler approach. The metadata may be restored using a systematic, system-wide, multi-threaded crawler approach acting together with an event-driven approach that restores certain files out of order as they are needed.