Abstract: A contact grouping method includes receiving media information sent by a contact; extracting a key characteristic of the media information; searching, according to a pre-stored correspondence between a key characteristic and a contact attribute, for a contact attribute corresponding to the key characteristic of the media information; and grouping the contact into a group corresponding to the found contact attribute. According to the contact grouping method and apparatus in embodiments of the present disclosure, contacts in an address book of various communications tools or communications applications can be grouped automatically and accurately, and when a user uses the communications tools or the applications to batch-send or share information, contacts in a target group can be precisely selected according to the group, thereby avoiding incorrect information delivery, information flooding, and a traffic waste on non-target contacts.

Abstract: A first question may be received. A first tag may be identified. The first tag may correspond to a first demographic trait. The first tag may be for use in providing a context for generating a first answer estimate to the first question. The first answer estimate may be generated using natural language processing and based on the first tag.

Abstract: A method for classifying information sources and content based on credibility, reliability, or trust. A content item describing an event is retrieved from an information provider and parsed for links. Each link is evaluated and attributed a sentiment score. The same event is identified in a set of know sources and an event score is calculated based on the credibility of each of the known sources. Finally, the content item is ranked based on the event and sentiment scores.

Abstract: A search method is disclosed. The method obtains a plurality of search results for a query based on first relevance scores, and classifies the plurality of search results into a plurality of classifications. Based on respective rankings of the plurality of search results in corresponding classifications of the plurality of classifications, second relevance scores for the plurality of search results are generated, and the plurality of search results are ranked based on the first relevance scores and the second relevance scores. The technique achieves lower consumption of system resources, faster computation speed and more flexibility in diversification of search results.

Abstract: In an approach to mobile application usage detection, one or more computer processors detect mobile application usage data of one or more computing devices in a first geographic area during a first time period. The one or more computer processors display the mobile application usage data on an electronic map, where the electronic map depicts at least the first geographic area.

Abstract: Systems, methods, and other embodiments associated with a data retention framework that enforces archive eligibility criteria beyond a simple retention period are described. In one embodiment, a method includes identifying a record that has been stored in a primary data store for at least a retention period prescribed for the record and evaluating the record to determine if archive eligibility criteria for the record are met. When the archive eligibility criteria is met, the record is marked as eligible for archiving. When the archive eligibility criteria is not met, the record is marked as not eligible for archiving.

Abstract: An information search system includes a terminal device and a communicator. The terminal device includes an obtainer, a processor, and a communicator. The obtainer obtains device specification information which is necessary for specifying a device installed in a plant. The processor obtains first information and second information. The first information is identification information of the device specified by using the device specification information. The second information represents a storage place of information which is necessary for maintaining the device. The communicator transmits the first information and the second information to a network. The, search server specifies a search place based on the second information transmitted from the terminal device through the network. The search server searches the search place by using the first information as a key. The search server transmits a search result to the terminal device.

Abstract: Systems, methods and devices process received media content to generate personalized media presentations on an end point device. Received media content may be buffered in a moving window buffer, and processed to create tokens by parsing a next content element, and, for each content element, identifying a speaker or actor, creating a text representation, and measuring perceptual properties such as pitch, timbre, volume, timing, and frame rate. The end point device may compare a segment of tokens within buffered media content to a list of replacement subject matter within a user profile to determine whether the segment matches any of the replacement subject matter, and identify substitute subject matter for the matched replacement subject matter. The end point device may create a replacement sequence by modifying the substitute subject matter using the perceptual properties of the tokens in the segment, and render a personalized media presentation including the replacement sequence.

Abstract: A web content builder tool is provided for rapidly creating multiple related web content layouts for dynamic serving to devices having, e.g., different form factors. Layouts can be selectably linked or unlinked. While linked, adding content items to one layout causes automatic propagation of family member content items to the other layouts, and changing content item attributes within one layout causes automatic propagation of changes to family member content items in other layouts. While unlinked, adding or changing content items in one layout does not automatically cause changes to other layouts.

Abstract: Aggregating database entry modifications for replay of database changes includes: inserting, in a journal modification table, of database entry modifications, where each database entry is associated with a relative record number; and, for each relative record number: aggregating, in the journal modification table, a plurality of the modifications into a single modification.

Abstract: It is provided a management server comprising a memory, a processor configured to access to the memory, and a network interface through which the management server holds communication to/from a storage apparatus and a file server. The storage apparatus includes a storage device, which is divided into pages each having a determined capacity to store data. The file server is configured to manage, on a file-by-file basis, data that is stored in the storage apparatus. The processor is configured to: obtain an I/O count per unit time of access to pages which stores data contained in the file; and compare a policy applied to the file and imbalance in I/O to a part of the data contained in the file, and output a changed policy in the case where it is found that the policy applied to the file needs to be changed as a result of the comparison.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include configuring a storage system to store multiple storage entities for access by one or more host computers in communication with the storage system, and specifying a compression condition including a minimum compression ratio. The storage system can then estimate an expected compression ratio for a given storage entity, compress the given storage entity upon the expected compression ratio meeting the compression condition, and provide, to a given host computer, access to the compressed given storage entity.

Abstract: A method of compressing a plurality of multi-dimensional keys includes receiving, by a computer, the plurality of multi-dimensional keys, where the plurality of multi-dimensional keys have a first length and determining a first plurality of bit slots that are common among the plurality of multi-dimensional keys, wherein the first plurality of bit slots are not a prefix. Also, the method includes forming a mask indicating the first plurality of bit slots and forming a pattern indicating values of the first plurality of bit slots. Additionally, the method includes determining a second plurality of bit slots that vary among the plurality of multi-dimensional keys and forming a plurality of compressed multi-dimensional keys indicating values of the second plurality of bit slots. Further, the method includes storing the mask, the pattern, and the plurality of compressed multi-dimensional keys.

Abstract: A stream of tuples can assigned identifiers to tuples to store only the nonduplicative tuples. In a streams processing environment, a stream application actor like an operator can receive a series of tuples, process them, and output another series of tuples. Each of the tuples can be assigned a tuple identifier. The tuple identifier can tag the tuple as associated with the operator. Another operator can receive the tuples, identify the duplicative tuples, and store only the nonduplicative tuples.

Abstract: A content management system synchronizes content items across client computing systems connected by a network. Each client device has a storage allocation for synchronized shared content items. If the storage allocation for shared content items on a client device is exceeded by the request to add or edit a content item such that it is enlarged, a client application or the host of content management system selects content items to remove from residence on the client device but keep remotely on content management system. Upon removal of the selected content items, the client application creates shadow items, representing the content item but only containing the metadata of the content item. This creates sufficient space while maintaining user access to all synchronized shared content items. When a shadow item is requested by an application running on the client device the client application may approve or deny the request.

Abstract: Aggregating database entry modifications for replay of database changes includes: inserting, in a journal modification table, of database entry modifications, where each database entry is associated with a relative record number; and, for each relative record number: aggregating, in the journal modification table, a plurality of the modifications into a single modification.

Abstract: A computer program product is provided for extending a clustered file system. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to define functions required by external services implemented on top of a clustered file system, identify at least one function that is not provided by the clustered file system, and extend the clustered file system to provide the at least one function.

Abstract: The embodiments of disclosure disclose a method and device for responding to a request, and a Distributed File System (DFS). The method comprises: receiving from a file access client a request for operating a target file, wherein the request carries a full path of the target file; determining a file identifier and a file location register identifier corresponding to the full path, wherein a file location register corresponding to the file location register identifier isg used for providing location information of a data block of the target file; sending the file identifier and the file location register identifier to the file access client. The embodiments of the disclosure solves the problem that a DFS has a high demand on a file location register hardware, lowers a demand on the file location register hardware, and improves a stability of the system.

Abstract: A method, which provides a location context to an online object, includes (a) receiving identification information regarding the online object; (b) in a database, creating a relationship between the online object and a representation of a geographical location; (c) receiving a request for retrieving the relationship from the database based on the identification information or the geographical location; and (d) responding to the request by returning the relationship retrieved from the database. The request may originate from an application program that displays the representation of the geographical location graphically. The online object may correspond to an online business. In some implementations, the online object is unrelated in real life to a community located at the geographical location.

Abstract: In one embodiment, a method includes identifying a first node and a second node in a social graph. The historical location data is available for the first node and for the second node. The method also includes accessing one or more component metrics for computing a geo-metric. The geo-metric represents an assessment of a spatial commonality between the first node and the second node. The spatial commonalities are determined based on historical location data stored for the first node and historical location data stored for the second node. The method also includes accessing one or more coefficients each corresponding to one of the component metrics; calculating the geo-metric by applying the received coefficients to the component metrics and combining the component metrics; and providing the calculated geo-metric.

Abstract: In a map drawing apparatus (100), a map database (101) stores data representing a first map element as internal data. A first acquisition unit (103) acquires the internal data from the map database (101). A second acquisition unit (104) receives, via a network such as the Internet, data representing a second map element as external data. A determination unit (105) determines whether or not the first map element represented by the internal data and the second map element represented by the external data received by the second acquisition unit (104) are identical map elements. A drawing unit (106) draws, when the first map element and the second map element are determined to be identical map elements by the determination unit (105), only either one of the first map element and the second map element on a map.

Abstract: Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount (“false positives”). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed (“false negatives”).

Abstract: A social networking system generates a location store based on information received from its users. The location store includes entries having a physical location description and one or more terms associated with the physical location description. One or more entries associated with physical location descriptions within an area are identified. A local frequency of occurrence of each term in the identified entry is determined, and a global frequency of occurrence of each term in the identified entries within the location store is determined. Trending terms in the identified entries are determined based on the local frequencies and the global frequencies. Identified entries are compared to each other, with a score based on differing terms in compared entries and whether the differing terms are trending terms is generated. If a score is less than a threshold value, a combined entry is generated from the compared entries.

Abstract: A system, computer program, and method for storing and sharing images such as photographs via a communications network (16) and for permitting the identification of objects within the images. The invention allows the identification of objects such as persons within the photos without requiring the person submitting the photos to type in identification information for each and every photo in a photo album. The invention also allows users to automatically share their photos with others and to automatically search for photos and/or certain people in photos.

Abstract: A system and method of identifying objects is provided. In one aspect, the system and method includes a hand-held device with a display, camera and processor. As the camera captures images and displays them on the display, the processor compares the information retrieved in connection with one image with information retrieved in connection with subsequent images. The processor uses the result of such comparison to determine the object that is likely to be of greatest interest to the user. The display simultaneously displays the images the images as they are captured, the location of the object in an image, and information retrieved for the object.

Abstract: An information processing system includes: a terminal; an image retrieval device that retrieves an image similar to a retrieval subject image from a registration unit in which an image and association information are registered in an associated manner; a campaign-information registration unit that registers first campaign information and second campaign information in an associated manner, out of campaign information that includes an image and association information associated therewith; a storage unit that stores, as history information, the campaign information corresponding to the image based on a retrieval subject image transmitted from the terminal and identification information to identify the terminal in an associated manner; and a presenting unit that presents, to the terminal, association information that is included in the second campaign information registered in the campaign-information registration unit with being associated with the first campaign information that is associated with the identif

Abstract: As disclosed herein a method, executed by a computer, includes accessing a master schema defining one or more reference models, the master schema comprising a plurality of model elements each model element thereof comprising an element name and an element definition and fragmenting the master schema to provide a plurality of sub-projects. The method further includes identifying a change in a sub-project model element, updating the master schema according to the identified change to the sub-project model element, and distributing the updated master schema changes to other sub-projects that include the changed model element. A computer system, and a computer program product corresponding to the method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, includes accessing a master schema defining one or more reference models, the master schema comprising a plurality of model elements each model element thereof comprising an element name and an element definition and fragmenting the master schema to provide a plurality of sub-projects. The method further includes identifying a change in a sub-project model element, updating the master schema according to the identified change to the sub-project model element, and distributing the updated master schema changes to other sub-projects that include the changed model element. A computer system, and a computer program product corresponding to the method are also disclosed herein.

Abstract: The method includes identifying, by one or more computer processors, a first content consumed by a user. The method further includes identifying, by one or more computer processors, objects in the first content. The method further includes identifying, by one or more computer processors, a second content on the Internet that is similar to the first content, wherein the second content includes one or more objects that reach a threshold similarity to the identified objects in the first content. The method further includes identifying, by one or more computer processors, a date of creation for the identified first content and the date of creation of the second content. The method further includes arranging, by one or more computer processors, the identified first content and the identified second content in chronological order.

Abstract: Indexing data is disclosed. An image and a text data associated with a dataset are received. A tag is generated using one or more hierarchical classifiers. The image and the text data are input into at least one of the one or more hierarchical classifiers. A search index is generated based at least on the generated tag.

Abstract: Disclosed herein are systems and methods for implementing a RELATED command with a predictive query interface including means for generating indices from a dataset of columns and rows, the indices representing probabilistic relationships between the rows and the columns of the dataset; storing the indices within a database of a host organization; exposing the database of the host organization via a request interface; receiving, at the request interface, a query for the database specifying a RELATED command term and a specified column as a parameter for the RELATED command term; querying the database using the RELATED command term and passing the specified column to generate a predictive record set; and returning the predictive record set responsive to the query, the predictive record set having a plurality of elements therein, each of the returned elements including a column identifier and a confidence indicator for the specified column passed with the RELATED command term, wherein the confidence indicator in

Abstract: An index for large databases is disclosed. Data is grouped into clusters and the clusters are grouped into levels of detail. Analysis results are determined based on progressive data sampling. Sampling is conducted based on the level of detail required and/or the resources (time or computing resources) that are available. Larger, more concentrated clusters, at higher levels of detail, are sampled more sparsely. Smaller, more diffuse clusters, at lower levels of detail, are sampled more intensively. Analysis results, including outlier data, include proportional representation from the whole database up to the level of detail required. Results are quickly determined with specified degree of accuracy, based on initial sampling, and are refined with subsequent sampling.

Abstract: A system for use on a global computer network, such as the Internet, allows for the creation, development, maintenance and sharing of information in a particular formulated and structured method. Accredited members (users) are represented by a six-sided three dimensional graphical cube (block). A primary cluster of cubes provides for clustering of data relating to people, products, places and services (i.e., P3S), while secondary cube clusters are used to classify animals and plants, for example. The six sides of each cube correspond to the six generic questions about who, what, where, when, why and how (i.e., W5H) concerning P3S. The data information of each represented cube is stored on a page or book of pages that are arranged on the six sides of the cube to supply interaction and answers to W5H relating to P3S clusters. Members communicate and interact to access P3S clusters and obtain content about W5H.

Abstract: A system, method, and computer-readable medium for performing a dynamic data index restructure operation. The dynamic data index restructure operation restructures the data indexes within a business intelligence architecture based on usage patterns so as to support queries most likely to be generated by users of the business intelligence architecture. In certain embodiments, the dynamic data index restructure operation is performed via a dynamic data index restructure agent which may be positioned between a business intelligence application and the business intelligence database.

Abstract: A method for processing a dataset in a partitioned distributed storage system having data stored in a base table and an index stored in an index table, may include receiving base and index table metadata from the partitioned distributed storage system, where the base and index table metadata includes respective table partition information. The method may further include partitioning the dataset into a set of base-delta files according to the base table metadata, and generating a set of index-delta files corresponding with the base-delta files according to the index table metadata. The method may additionally include updating the partitioned distributed storage system with the set of base-delta and the set of index-delta files, where a first update of the base table is synchronous with a second update of the index table.

Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables on a bucket, where the bucket is an allocation of a partitioned storage in a node of one or more nodes of a swarm database, the bucket having at least one replica, and where no two identical bucket replicas reside on a single node. An identifier and a data storage hierarchical level are assigned to the data. The data is mapped to an index and the data is stored in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the bucket and recording a write operation into a transaction log of the node. A plurality of write operations are received, and a plurality of write tasks of the bucket are combined for a predetermined time period.

Abstract: An artifact in an application is assigned with a tag. The tag is a string that characterizes the artifact. A list of suggested tags is provided, which includes tags assigned to similar artifacts maintained by the application. The list of suggested tags also includes newly suggested tags based on analysis of the artifact. The tags within the application are maintained and operations such as deletion, renaming, or unification of tags are performed. Unification of tags is performed through determining similarities between at least two tags. The similarity is determined based on existence of a trigram in the at least two tags after normalization of tags and based on edit distance between each two tags from the at least two tags. A tag cloud is provided for navigation between artifacts in the application. Tag cloud is defined based on frequency of use and selectiveness of tags.

Abstract: Data from a plurality of data sources is provided to a multi-source data management system, which stores the data and provides it to a data accuracy system for purposes of assessing the accuracy of data records and the individual fields within data records. Data accuracy scores may be stored at the data management system with the data records to which they pertain. Accuracy scores may be periodically recalculated and monitored, and alerts provided if an accuracy score changes a predetermined amount over a given period of time. Also, data records may be provided by a data user for accuracy assessment, using other data records stored at the multi-sourced data management system.

Abstract: A computer system is provided comprising one or more processors, one or more memories and one or more programs stored in one or more of the memories for execution by one or more of the processors, the system updating a database that links organizations with intellectual property rights to create associations between related organizations, and being programmed to carry out the process of: performing a search, using an internet search engine, for a first entry from the database containing data indicative of the name of an organization associated with one or more rights to produce a first set of web page results for the first entry; performing a search, using an internet search engine, for a second entry from the database containing data indicative of the name of an organization associated with one or more rights to produce a second set of web page results for the second entry; comparing the first set of results and the second set of results to identify matches between the first set of results and the second set

Abstract: Systems and methods are disclosed in which a self-describing file is generated and utilized to provide applications with the ability to properly preserve unknown file content. A self-describing file may contain, or be associated with, an extension section that provides information that an application can use to properly calculate unknown file content. The extension section may include functions of formulas that the application can use to calculate values for data that the application would not otherwise support. This allows for the content of the self-describing file to be modified by an application that does not support all of the capabilities of the file while maintaining the integrity of the file and user experience when the file is subsequently accessed by a full featured application.

Abstract: Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.

Abstract: The method includes generating, by one or more computer processors, a first piece of data based on a defined set of data characteristics. The method further includes generating a first bit, wherein the first bit corresponds to the first generated piece of data. The method further includes sending the first generated piece of data to a target location. The method further includes receiving the first generated piece of data from the target location. The method further includes determining whether to validate the first generated piece of data received from the target location. The method further includes adjusting the first generated bit based on the determination of whether to validate the first generated piece of data.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for managing conflicts in an import operation. The method includes one or more processors identifying a conflict in an import operation of an incoming set of data into an existing database, wherein the incoming set of data includes an incoming entry, and the existing database includes an existing entry that corresponds to the identified conflict. The method further includes one or more processors determining a probability to preserve the existing entry in the existing database based on a set of rules associated with the import operation. The method further includes one or more processors determining whether to overwrite the existing entry in the existing database with the incoming entry from the incoming set of data based on comparing the determined probability to a threshold probability.

Abstract: Disclosed is an apparatus for estimating a usability and a quality of data. The apparatus for estimating a usability and a quality of data includes: a database configured to store a quality of first analysis data according to comment information on a data pattern included in the first analysis data and interpretation information on a part corresponding to a set search pattern among the first analysis data; and a data estimating unit configured to automatically derive a quality of second analysis data according to the comment information and the interpretation information allocated to a part of the second analysis data corresponding to the data pattern and the search pattern.

Abstract: A method includes receiving information indicative of an output dataset generated by a data processing system; identifying, based on data lineage information relating to the output dataset, one or more upstream datasets on which the output dataset depends; analyzing one or more of the identified one or more upstream datasets on which the output dataset depends. The analyzing includes, for each particular upstream dataset of the one or more upstream datasets, applying one or more of: (i) a first rule indicative of an allowable deviation between a profile of the particular upstream dataset and a reference profile for the particular upstream dataset, and (ii) a second rule indicative of one or more allowable values or prohibited values for each of one or more data elements in the particular upstream dataset, and based on the results of applying the one or more rules, selecting one or more of the upstream datasets.

Abstract: A second synthetic dataset is generated having internal consistencies with a previously generated first synthetic dataset. The synthetic data of the second dataset can be generated based on a set of rules loaded into a computer data generator for defining entities and interrelationships among events associated with the entities consistent with at least some of the rules previously used for generating the first synthetic dataset. Entities and historical information about the entities within a first observation spanning a first time period can be derived from the first synthetic dataset stored in a computer-readable memory. A second observation window can be established spanning a second time period that is different from the first time period.

Abstract: Validating a write of a replica record to a replica data store in a transaction processing system. The source record is written to a location in the source data store, and the location is recorded in a transaction log file. The transaction processing system obtains from the transaction log file the location, and the location in the replica data store to which the replica record will be written is predicted, based on the location and length of the previous replica record. If the obtained location of the source record corresponds to the predicted location of the replica record location, the replica record is written to a location in the replica data store.

Abstract: New data messages for updating a database can indicate a latency tolerance. The latency tolerance can constrain new data records based on such new data messages to also indicate the latency tolerance. Latency-tolerant data records can be constrained to remain in the working database for a minimum duration. Data records present in the working database can be prioritized according to prioritization criteria that increases priority of data records indicating latency tolerance. Matching incoming data messages with the data records present in the working database can be based on such prioritization. A matched data record can be updated or deleted upon successful match with an incoming data message. The latency tolerance can be applied to trading systems for financial instruments or interests as a long-life order that rests in an order book without being able to be cancelled or updated for the minimum duration in exchange for priority during order matching.

Abstract: A method begins by a distributed storage (DS) processing module transmitting a set of requests to a set of DS units regarding a set of data elements and receiving a set of respective requests from the set of DS units. When the set of respective requests is in accordance with a current distributed task/data responsibility allocation period, the method continues with the DS processing module issuing a set of responses to the set of DS units. The method continues with the DS processing module receiving a set of respective responses from the set of DS units. When the set of received respective responses is in accordance with the current distributed task/data responsibility allocation period, the method continues with the DS processing module processing the set of received respective responses in accordance with the current distributed task/data responsibility allocation period to produce one of a set of results.

Abstract: The method includes generating, by one or more computer processors, a first piece of data based on a defined set of data characteristics. The method further includes generating a first bit, wherein the first bit corresponds to the first generated piece of data. The method further includes sending the first generated piece of data to a target location. The method further includes receiving the first generated piece of data from the target location. The method further includes determining whether to validate the first generated piece of data received from the target location. The method further includes adjusting the first generated bit based on the determination of whether to validate the first generated piece of data.