Abstract: A search engine: (i) receives a search query including a subject-matter-describing data set, a first boundary-condition-describing data set and a second boundary-condition-describing data set; (ii) determines a first boundary condition based on the first boundary-condition-describing data set; (iii) determines a second boundary condition based on the second boundary-condition-describing data set; and (iv) finds search results that meet the following criteria: (a) apparently relate to the subject matter of the subject-matter-describing data set, and (b) apparently fall between a first boundary condition and a second boundary condition. Also, a user specifies a document, along with a search query, and the search engine uses the document to limit and/or organize the search results.

Abstract: Disclosed aspects relate to data arrangement management in a distributed data cluster environment of a shared pool of configurable computing resources. In the distributed data cluster environment, a set of data is monitored for a data redistribution candidate trigger. The data redistribution candidate trigger is detected with respect to the set of data. Based on the data redistribution candidate trigger, the set of data is analyzed with respect to a candidate data redistribution action. Using the candidate data redistribution action, a new data arrangement associated with the set of data is determined. Accordingly, the new data arrangement is established.

Abstract: A method for tagging multimedia content elements is provided. The method comprises receiving at least one multimedia content element from a user device; generating at least one signature for the at least one multimedia content element; generating at least one tag based on the least one generated signature, wherein the at least one tag is searchable by the user device; and sending the tag generated for the received multimedia content element to storage on the user device.

Abstract: A new approach is proposed that contemplates systems and methods to determine temporality of a query in order to generate a search result including a list of objects that are not only based on matching of the objects to the query but also based on temporality analysis of the query. Here, the temporality of the query can be defined as the distribution over time of the objects matching the query, i.e., the chronology histogram of the query. Such distribution can be analyzed to provide a classification of the intent of the query. Classification of the intent of the query can result either in discrete classification of the query into categories, or in continuous classification of the query which may be a scalar or vector value resulting from transformations of the chronology histogram.

Abstract: A web page that includes content form fields may be modified to include an event observer module and an authored content module. Events generated during the authoring of content by a user are recorded by the event observer module and sent to an event server with an InteractionID. The authored content module inserts hidden fields into the form fields that are updated with the InteractionID when content is submitted to the web server. The web server provides the InteractionID in a bind request to the event server. The event server binds the content to the events used to create the content in response to the request.

Abstract: Providing a speculative search result for a search query prior to completion of the search query is described. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user.

Abstract: The present disclosure relates to apparatus, systems, and methods for analyzing characteristics of entities of interest. In particular, the present disclosure provides a mechanism for analyzing information about entities of interest and for rating or scoring the entities of interest based on the analyzed information. The rating or the score of an entity of interest can sometimes be referred to as a placerank value of an entity of interest.

Abstract: Disclosed aspects relate to using a database driver to manage application resiliency with respect to a shared pool of configurable computing resources. A transaction request having a set of command data is received. The set of command data for the transaction request is captured in a memory device coupled with the database driver. The transaction request is connected with a first asset of the shared pool of configurable computing resources. An error event is detected related to the first asset. It is ascertained that the error event indicates a configuration for an automatic client reroute (ACR) operation. Using the ACR operation, the transaction request is connected with a second asset of the shared pool of configurable computing resources. The set of command data for the transaction request is transmitted from the memory device coupled with the database driver to the second asset.

Abstract: An analyzer module may identify a plurality of users and a plurality of files that have been accessed by at least one of the users. Pairs of users may be identified where each user of a pair has accessed at least one same file. A weight value may be calculated for each of the identified pairs. The weight value may be calculated based on a number of same files that each of the users of an identified pair have accessed. Collaboration information associated with the users may be determined based on the weight values.

Abstract: In an approach for adding categories to a social media site, a computer identifies one or more semantic attributes of content uploaded on a social media site, wherein the identified one or more semantic attributes correspond to viewable characteristics of the content uploaded on the social media site. The computer maps the identified one or more semantic attributes to one or more categories based on shared viewable characteristics of the identified one or more sematic attributes. The computer associates the one or more mapped categories to the content uploaded on the social media site.

Abstract: Various techniques, including a method, system and computer program product for restoring encrypted files are disclosed. The method includes accessing a file table record for an encrypted file. The file table record includes an encrypted file stream and extent information identifying a location of one or more portions of the encrypted file in a virtual machine image. In response to accessing the file table record a consecutive data stream is stored. Storing the consecutive data stream includes encapsulating the encrypted file stream and the one or more portions of the encrypted file.

Abstract: In certain embodiments, automatic modification-triggered transfer of a file among two or more computer systems associated with a user. In some embodiments, a copy of a first file may be received, via a first application at a first computer system, from a second application at a second computer system associated with a user. The first file copy may be automatically received from the second application responsive to the user modifying a content of the first file, where the first file copy is a version of the first file that is generated from the user modifying the content of the first file. Responsive to receiving the first file copy from the second computer system, the first file copy may be automatically transferred via the first application to a third computer system associated with the user to replace an older version of the first file stored on the third computer system.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, can be used to dynamically generate electronic maps with highlighted entity boundaries. In one aspect, a method includes receiving a request for an electronic map segment for a geographic region, with the request identifying a geographic entity to be highlighted in the requested electronic map segment. A plurality of layers of map data associated with the geographic region and data defining a boundary of the identified geographic entity are retrieved in response to the request. The electronic map segment is rendered based on the retrieved plurality of layers of map data and the data defining the boundary of the geographic entity, with one or more of the retrieved layers are rendered over a rendering of a highlighted boundary of the geographic entity. The rendered electronic map segment is transmitted in response to the request.

Abstract: Techniques to process a query and perform a join of tables that are distributed across nodes of a network. The join can be performed by analyzing a Where clause. An active flag structure can have flag values that identify table entries satisfying criteria of the Where clause. Keys of surviving entries of a first table can be used to generate a request for a second table to be joined. The request can be for second flags for the second table when the Where clause has criteria for the second table. A response can be used to update the first flags to change a first flag to False. After updating, data can be retrieved for first flags that are True. Requests can use identifiers associated with the first table that identify a location for sending the request, e.g., using RDMA or MPI.

Abstract: A data recipe may be automatically generated to provide requested information to a user. After the information is requested, one or more data sources may be interrogated to discover a plurality of data types of data stored in the data sources. The data types may be categorized to define a plurality of data recipe ingredients that are likely to be needed to provide the requested information. The data recipe ingredients may be compared with a reference data recipe. Based on the results of the comparison, a new data recipe that provides the requested information may be made by either modifying the reference data recipe or by proceeding independently of the reference data recipe. The new data recipe may, for example, calculate a key performance indicator used to measure organizational performance.

Abstract: Disclosed aspects relate to database object management for a shared pool of configurable computing resources. A set of database object profile data is collected. The set of database object profile data is for a set of database objects. Based on the set of database object profile data, a set of database object priority values is determined. The set of database object priority values is for the set of database objects. Based on the set of database object priority values, a management action is performed. The management action is performed with respect to the set of database objects.

Abstract: A mechanism is provided in a data processing system for extracting subgraphs from a multigraph with approximation. The mechanism receives a multigraph and a relevance function and a pattern generation component executing within the data processing system searches the multigraph for occurrences of at least one pattern based on an approximation function. A relevance computation component executing within the data processing system determines a relevance measure for the multigraph based on the relevance function and the occurrences of the at least one pattern. The mechanism provides output of relevant patterns based on the occurrences of the at least one pattern.

Abstract: A distributed object storage system comprises an encoding module configured to calculate for a plurality of predetermined values of the spreading requirement the cumulative size of the sub fragment files when stored on the file system with the predetermined block size; and select as a spreading requirement from said plurality of predetermined values a calculated value that is equal to one of said predetermined values for which the cumulative size is minimal.

Abstract: Embodiments provide a checklist function integrated with a process flow model. The process checklist utilizes a semi-automated visual approach to cover processes specific to a user and/or enterprise. A model of the process is generated and stored, for example utilizing an input template in XML format and according to the Business Process Model and Notation (BPMN) standard. Next, instances corresponding to runs of the mapped processes are created. Various internal documents can be linked together within a process instance, thereby allowing enterprises to define different relationships between documents independent of product-wide implementation and database complexity. In some embodiments the process models may be accessed interactively in a What-You-See-Is-What-You-Get manner, without being machine executed. This allows for relatively loose process definition/modelling, fostering interpretation reliant upon user intuition.

Abstract: An embodiment of the invention may include a method, computer program product, and system for data management. The embodiment may include receiving a login token and instruction from a user device. The login token is associated with a user of the user device. The instruction may be reading or writing profile data belonging to the user. The embodiment may include determining whether a user profile container exists for the user based on the received login token. The embodiment may include creating the user profile container for the user based on determining that the user profile container does not exist. Creating the user profile container for the user may include identifying profile data belonging to the user located in a plurality of locations within a file system and storing identified profile data belonging to the user within a single binary large object. The embodiment may include executing the received instruction.