Abstract: Data aggregation includes receiving, from an electronic device, a plurality of sensor data packets, wherein the plurality of sensor data packets are received from at least one sensor of the electronic device, and wherein each of the plurality of sensor data packets comprise a tag identifying a classification of the sensor data in the sensor data packet, applying a user-specific policy to the plurality of sensor data packets, aggregating the plurality of sensor data packets based on the user-specific policy to obtain aggregated sensor data, and transmitting the aggregated sensor data to a service broker.

Abstract: Aspects of the technology described herein increase the efficiency of a search session by determining whether fresh content is likely to be responsive to the user's query. Whether fresh content is likely to be responsive to a specific query is determined by retrieving social media posts that are responsive to the query. The social media posts are evaluated for virality, which is the tendency of a social media post to be circulated rapidly and widely from one Internet user to another. The virality of a social media post can be determined by comparing a number of times the social media post has been re-communicated by individual users. Queries that return viral social media posts may be classified as seeking fresh content.

Abstract: Video content can be analyzed to identify particular sections of the video content. Speech to text or similar techniques can be used to obtain a transcription of the video content. The transcription can be indexed (e.g., timestamped) to the video content. Information describing how users are interacting with or consuming the video content (e.g., social media information, viewing history data, etc.) can be collected and used to identify the particular sections. Once the particular sections have been identified, other services can be provided. For example, custom trailers and summaries of the video content can be generated based on the identified sections. Additionally, the video content can be augmented to include additional information relevant to the particular sections, such as production information, actor information, or other information. The additional information can be added so as not to interfere with the important sections.

Abstract: A method and an apparatus for querying a physical memory address where the method includes storing, into a prefetch buffer, page table entries of a second thread that is to perform addressing that are stored in a standby buffer, where the standby buffer stores page table entries that are not queried within a set time in a translation lookaside buffer (TLB), receiving a memory addressing request message that carries a virtual address and is sent by the second thread, and querying, in the TLB and the prefetch buffer, a corresponding physical address according to the virtual address.

Abstract: Embodiments relate to a method, system, and computer program product for data management. An aspect includes a search index that is created for a database. The search index has a reference value of a first or a second type associating data to a storage location in a first memory or a second memory respectively. Responsive to a data retrieval request, data is accessed using the reference value from the first or the second memory. If there is a data migration between the first and second memory storage, the reference values are then recalculated and altered in the search index accordingly.

Abstract: The present disclosure relates generally to REpresentational State Transfer (REST) services, and more particularly, to techniques for enhancing REST services with custom data. One of the techniques includes receiving a request from an end user for a service provided by a REST end point, implementing a data retrieval from the REST end point on behalf of the end user to obtain one or more representations of resources for the requested service, extracting a primary key from the one or more representations of resources, using the primary key to obtain custom data for the requested service, and merging the custom data with the one or more representations of resources to create a response to the request from the end user for the service.

Abstract: A data analysis system stores in-memory representation of a distributed data structure across a plurality of processors of a parallel or distributed system. Client applications interact with the in-memory distributed data structure to process queries using the in-memory distributed data structure and to modify the in-memory distributed data structure. The data analysis system creates uniform resource identifier (URI) to identify each in-memory distributed data structure. The URI can be communicated from one client application to another application using communication mechanisms outside the data analysis system, for example, by email, thereby allowing other client devices to interact with a particular in-memory distributed data structure. The in-memory distributed data structure can be a machine learning model that is trained by one client device and executed by another client device. A client application can interact with the in-memory distributed data structure using different programming languages.

Abstract: In one embodiment, a method includes receiving a search query input comprising a character string having a first number of characters; searching one or more indexes of one or more verticals to identify terms corresponding to the search query input, wherein if the first number is less than or equal to a threshold number, then searching one or more first indexes, wherein each first index is related to objects of a first object-type, and if the first number is greater than the threshold number, then searching the one or more first indexes and one or more second indexes, wherein each second index is related to objects of a second object-type different than the first object-type; and sending instructions for presenting one or more suggested queries, each suggested query comprising the character string of the search query input and one or more of the identified terms.

Abstract: The present teaching relates to searching encrypted data. In one example, a search request is received for encrypted documents. An encrypted query is generated based on the search request. The encrypted query is sent to a server that stores a first encrypted index and a second encrypted index. The first encrypted index maps encrypted keywords to full blocks each of which has a same size and is fully filled with encrypted document identities (IDs). The second encrypted index maps encrypted keywords to partial blocks each of which has the same size and is partially filled with encrypted document IDs. Based on the encrypted query, one or more encrypted document IDs are determined by searching against both the first encrypted index and the second encrypted index. A search result is generated based on the one or more encrypted document IDs. The search result is provided in response to the search request.

Abstract: A method is provided comprising: generating, by an electronic device, at least one context information log associated with content stored in a memory; grouping the content into a plurality of groups based on the at least one context information log; adding the plurality of groups to a first list, wherein each of the plurality of groups is associated with a respective time-out period; generating a first screen based on the first list, the first screen including a first group from the plurality; detecting an input to the first screen that selects the first group and in response, adding the first group to a second list; wherein the first group is removed from the first list when the respective time-out period of the first group expires, and the first group persists in the second list after the respective time-out period of the first group expires.

Abstract: A method for presenting a trusted tag cloud to a user. The method includes associating a number of tags with a first user who applies the tags, calculating a weight of the tags being examined by a second user. The weight may be based on the identity of the second user, the identity of the first user, and examining the relationship between the two. The tags may then be presented to the user in accordance with the value of the weight.

Abstract: The present disclosure is directed toward systems and methods for increasing an engagement level of a social media post among a community of social media users. For example, systems and method described herein involve building and training a data model that represents how a given community of social media users engages with social media posts. Furthermore, systems and method described herein utilize the trained data model to suggest one or more alternative word choices for use in a social media post, in order to increase or optimize the predicted level of engagement the social media post will receive from the community of social media users.

Abstract: Methods and apparatus are provided that are related to generating repair orders, including vehicular repair orders. A computing device can receive repair-related information associated with a repair order. The repair-related information can include information about a first repair attribute of one or more repair attributes. The computing device can determine a first ontology related to the first repair attribute. The first ontology can be further related to a first template. The computing device can determine modified repair-related information by at least utilizing the first template to modify at least a first portion of the repair-related information that includes the information about the first repair attribute. The computing device can generate an output related to the repair order that includes the modified repair-related information.

Abstract: Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.

Abstract: Various example embodiments are provided for inferring relationships between a first query comprising a plurality of first terms and a second query comprising a plurality of second terms. In an example, queries are related based on the identification of common terms between the queries. One or more dissimilar terms are identified between the plurality of first terms and the plurality of second terms. A first number of dissimilar terms included in the first query and a second number of dissimilar terms included in the second query are identified. A weight is assigned to the relationship between the first query and the second query based on a difference between the first number and the second number.

Abstract: As part of a columnar in-memory database, value identifiers are inserted into a backing array in-memory until such time that it is determined that such backing array does not have sufficient capacity. A new backing array is then generated that includes the value identifiers in the old backing array and which has sufficient capacity. The old backing array can be flushed from memory when there are no active operations using such backing array. Such an arrangement allows for readers and non-structural writers to operate concurrently.

Abstract: Embodiments include methods and devices for identifying record schemas in a non-relational database by assigning a record to a schema bucket according to structural characteristics of the record and identifying a record schema of the record within the schema bucket so that records with isomorphic record schemas in the non-relational database can be determined. Aspects also include encoding keys of a lowest level of a record according to a global codemap, sorting the keys of the lowest level that belong to different parent keys respectively and updating key names of corresponding parent keys in the parent level of a children level according to the codes of the keys of the children level.

Abstract: A distributed key-value storage system may include a master node. The key-value store may be distributed among first and second nodes. The master node may receive a publish request to publish one or more key-value pairs. Each key-value pair may be stored in a retransmit buffer and sent to all the first nodes using a communication protocol of a first kind that does not include a retransmit protocol mechanism. Some of the key-value pairs may be sent to one or more second node using a communication protocol of a second kind that includes a retransmit protocol mechanism.

Abstract: A computer-implemented method for analyzing organizational performance from episodic data is provided. Event objects for events is maintained in a database. A trigger for notifying beginning of an event is received. An event object is generated in response to the trigger. Activity data is created for the event object and each of the activity data includes notes of a subjective nature having received and messages of an objective nature. Each of the activity data is associated with event tags. Each of the event objects is classified in an event class and the event class includes a pattern of parameters. Analytics of the event objects is performed based on the event tags and the event class. Filters received from a reviewer is defined for search. A list of the analytics of the event objects which pattern of parameters matches with the filters is displayed on a display.

Abstract: Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.

Abstract: The subject matter disclosed herein provides methods for inserting and retrieving value identifiers from a dictionary encoded database using hash maps. A first value identifier and a first value can be accessed from a dictionary storing one or more value identifiers and one or more values. Each value identifier can correspond to a different value. The hash map and the first value can be used to determine a first index in a bucket list for inserting the first value identifier. The bucket list can have one or more indices. Each index can store at least one value identifier. The hash map can include a vector of one or more pointers. Each pointer can refer to at least one of the indices. Based on the determining, the first value identifier can be inserted at the first index without inserting the first value. Related apparatus, systems, techniques, and articles are also described.

Abstract: A system for frequent pattern mining uses two layers of processing: a plurality of computing nodes, and a plurality of processors within each computing node. Within each computing node, the data set against which the frequent pattern mining is to be performed is stored in shared memory, accessible concurrently by each of the processors. The search space is partitioned among the computing nodes, and sub-partitioned among the processors of each computing node. If a processor completes its sub-partition, it requests another sub-partition. The partitioning and sub-partitioning may be performed dynamically, and adjusted in real time.

Abstract: This disclosure relates to a system and method for creating a job advertisement. The job advertisement includes visual information which is presented an in organized, easily digestible manner. An example system according to the present disclosure includes, among other things, a first computing device a second computing device in communication with the first computing device. The second computing device is configured to receive an input of text describing a job from the first computing device and create a job advertisement including at least one image representative of at least a portion of the text.

Abstract: A Sort-on-the-Fly/Search-on-the-Fly search engine provides an intuitive means for searching databases, allowing a user to access data in the database without having to know anything about the database structure. A user selects a desired search term, and the search engine searches the database for all instances of the desired term, even if a specific file or table does not contain the instance. The user may specify other criteria, or constraints to narrow the search results, or for other reasons. The search engine then conducts a further search using these criteria and produces a second search result. Further narrowing or broadening of the search are permitted, with the search-on-the-fly search engine returning results based on any new constraints. If the returned data would be too large to be conveniently displayed at a terminal, the search engine executes a truncation routine so that the returned data is easily displayed.

Abstract: The present document relates to a system and method for searching a document using one or more search terms. In particular, the present document relates to a resource efficient method for searching a document within a database of documents. A method for determining an inverse index on an electronic device including a database is described. The inverse index is configured to map a plurality of text data entities from the database to a search term. The method includes determining a plurality of relevance vectors for a plurality of text data entities from the database. Determining a relevance vector for a text data entity from the database includes: selecting N terms which are descriptive of the text data entity; and determining the relevance vector from the selected N terms. Furthermore, the method includes determining the inverse index comprising a plurality of records.

Abstract: A language processing system collects similar queries and respective responses and aggregated by responses. Incorrect responses are determined and filtered by the aggregation. The remaining responses are then used to query a high precision system for attributes of entities specified by the queries. The attribute type is determined from the responses of the high precision system, and corresponding parse rules are generated. The parse rules are then associated with an operation that yields a response that specifies an attribute of the attribute type.

Abstract: A system and method for reducing communications overhead in a distributed transaction processing environment such as an XA environment. In accordance with an embodiment communication overhead is reduced in a transaction start method by deferring a transaction start communication. The deferred transaction start communication is determined from a subsequent transaction processing communication thereby reducing the number of networks calls required for each transaction and enhancing system performance.

Abstract: Provided are a computer program product, system, and method for handling failure of a command to add a record to a log. The log has records at log addresses. A command is received to add a record to the log indicating a current log address at which the record is stored in the log. A determination is made as to whether the command has a resend parameter set, wherein the resend parameter indicates whether the command is being resent to add the record. A determination is made as to whether there is a log address in the log having the record following the current log address in response to determining that the resend parameter indicates that the command is being resent. The determined log address in the log is returned.

Abstract: A method and computer readable medium is described for directing a search engine web crawler's local web browser to refresh the top-level container that is currently displaying the content presented by a remote computer with the new content that a navigational link, within a remote desktop, remote application window, or remote graphical windowing user session, points to. Links can be modified so as to be recognizable by the remote machine as unique from traditional hyperlinks. Upon navigation action on such a link, the client of a remote desktop, remote graphical application window, or remote graphical windowing user session is redirected so that it wholly reloads its computing context with that provided by a destination URL or URI. Such a URL or URI may point to another remote desktop, remote application window, or remote graphical windowing user session.

Abstract: Images uploaded to photo sharing websites often include some tags or sentence descriptions. In an example embodiment, these tags or descriptions, which might be relevant to the image contents, become the weak labels of these images. The weak labels can be used to identify concepts for the images using an iterative hard instance learning algorithm to discover visual concepts from the label and visual feature representations in the weakly labeled images. The visual concept detectors can be directly applied to concept recognition and detection.

Abstract: The present disclosure relates to systems and methods for dynamic sharding of a database comprising data identifiable by keys comprised within a global ordered range. When handling a request for data of at least one key: providing the request to a predetermined shard store; the predetermined shard store verifying, by means of its local subrange collection, whether the at least one key is present in a local subrange of a shard stored on the predetermined shard store; and when at least one key is not present in a local subrange of a shard stored on the predetermined shard store, returning a message comprising the local subrange collection of the predetermined shard store.

Abstract: A method including obtaining search results for a search query, determining a type of the search query, calculating a degree of focus score for the search query when the type of the search query is a non-navigation type, determining one or more social annotations to provide for display along with the search results based on the degree of focus score, and providing the one or more social annotations for display with the search results.

Abstract: To provide an image forming device (20) able to perform an appropriate preview. A MFP (20) that generates an output image (27a) for at least one of transmission and printing (S102) and executes an output using an output image (27a) generated in S102. The MFP (20) generates a preview image (27b) for preview of the output image (27a), stores the preview image (27b) generated in S104 in a storage medium (30) outside of the MFP (20), and performs a preview using the preview image (27b) stored in the storage medium (30) in S109 (S111).

Abstract: A method includes identifying a plurality of user-interested multimedia files based at on one of a history of a plurality of user multimedia searches, a plurality of user multimedia views, or a history of multimedia sharing with other users. The method creates a catalog of the plurality of user-interested multimedia files, wherein the catalog includes one of more groups of the plurality of multimedia files based on one of a multimedia file length, the history of the plurality of user multimedia searches, the plurality of user multimedia views, or a history of multimedia shares with other users. The method generates a novel multimedia file, where combining one generates the novel multimedia file or more individual multimedia files selected from the catalog of multimedia files.

Abstract: A computer-implemented method, carried out by one or more processors, for consolidating an index entry of a dictionary. In an embodiment, the method comprises the steps of receiving, by one or more processors, a set of parameters, wherein the set of parameters indicates at least a length of prefix and a length of hash value; receiving, by one or more processors, a first term for entry into an index; converting, by one or more processors, the first term for entry into the index according to the set of parameters; and responsive to determining the converted first term is not present in the index, storing, by one or more processors, the first converted term into the index.

Abstract: Data compression with window-based selection from multiple prediction functions is provided. A predefined default predictor and a plurality of other predictors are applied to a floating point number to generate a plurality of predictions. A compression metric over a collection of floating point numbers is evaluated for the default predictor and the plurality of other predictors. Based on the compression metric, (i) the floating point number is encoded using the predefined default predictor, or (ii) the collection of floating point numbers is encoded using one of the other predictors. Stored indexes indicate which predictor was used for the encoding. A set of predictors out of a larger set of predictors can be determined for a specific data set based on a performance-based ranking. The default predictor and the alternate predictors can be represented as ensembles of predictors.

Abstract: The present invention extends to methods, systems, and computer program products for ranking tables for keyword search. Aspects of the invention include generating lists of candidate tables for inclusion in a search query response, computing table hit matrices, retrieving content from fields of candidate tables having keyword hits, generating ranking features of tables, and computing ranking scores for tables. Aspects of the invention can be used to match keywords against column names, to match keywords against values in subject and non-subject columns, and to match keywords against table descriptions like page titles, table captions, cell values, nearest headings and surrounding text. Which keywords are matched against which fields can depend on the table and/or the query (referred to as “late binding”).

Abstract: In response to a user-initiated interaction request sent by a user using an electronic communication, subsequent actions performed by other users that received the user-initiated interaction request are analyzed. A determination is made as to whether the subsequent actions performed by the other users that received the user-initiated interaction request correlate to an intended interaction result of the user-initiated interaction request. A visual representation of a collaboration model that correlates probabilities of successful collaborations between the user and the other users is generated in accordance with determined correlations between the subsequent actions performed by the other users and the intended interaction result.

Abstract: Devices, systems, and methods for performing particularized encryption of confidential information within real-world data files that are subsequently stored within a cloud environment are described. Specific rules/logic are executed in a local computing environment to identify the type(s) and/or magnitude(s) of confidential information contained within each real-world data file. The identified type(s) and/or magnitude(s) of confidential information is thereafter specifically encrypted using various encryption processes. Once encrypted, the data is packaged and stored within a cloud environment without the need for further encryption at either the local computing or cloud environments.

Abstract: A system for targeting advertising can include a communications interface and a processor. The communications interface can receive data associated with times of use of applications. The processor can be communicatively coupled to the communications interface and can categorize the applications by genres. The categorization is within a time of use group and is based on at least part of the retrieved data. The processor can also determine priority values associated with the genres based on levels of use of the applications during a period of time associated with the time of use group. The processor can also identify a current time and determine an advertisement according to at least one genre of the genres. The at least one genre can be associated with a highest priority value of the determined priority values. The period associated with the time of use group can correspond to the identified current time.

Abstract: A method includes identifying images associated with a user, where the image is identified as at least one of captured by a user device associated with the user, stored on the user device associated with the user, and stored in cloud storage associated with the user. The method also includes for each of the images, determining one or more labels, wherein the one or more labels are based on at least one of metadata and a primary annotation. The method also includes generating a mapping of the one or more labels to one or more confidence scores, wherein the one or more confidence scores indicate an extent to which the one or more labels apply to corresponding images. The method also includes interacting with the user to obtain identifying information that is used to categorize one or more of the images.

Abstract: Described herein are techniques for providing information regarding brands of items offered for acquisition by an offering service. The items may comprise tangible or intangible goods, products (e.g., electronics, sporting goods, digital music, etc.), services, or the like. A brand, meanwhile, may refer to a name, term, design, symbol, or any other feature that distinguishes a designer, maker, manufacturer, seller or the like from other entities.

Abstract: A method of accessing data includes storing a table that includes a plurality of tablets corresponding to distinct non-overlapping table portions. Respective pluralities of tablet access objects and application objects are stored in a plurality of servers. A distinct application object and distinct tablet are associated with each tablet access object. Each application object corresponds to a distinct instantiation of an application associated with the table. The tablet access objects and associated application objects are redistributed among the servers in accordance with a first load-balancing criterion. A first request directed to a respective tablet is received from a client. In response, the tablet access object associated with the respective tablet is used to perform a data access operation on the respective tablet, and the application object associated with the respective tablet is used to perform an additional computational operation to produce a result to be returned to the client.

Abstract: Methods and apparatus are provided for compression and decompression of heteroscedastic data, such as seismic data, using Autoregressive Integrated Moving Average (ARIMA)-Generalized Autoregressive Conditional Heteroscedasticity (GARCH) model estimation. Heteroscedastic data is compressed by obtaining the heteroscedastic data; applying the heteroscedastic data to an ARIMA-GARCH model; determining residuals between the obtained heteroscedastic data and the ARIMA-GARCH model; and compressing parameters of the ARIMA-GARCH model and the residuals using entropy encoding, such as an arithmetic encoding, to generate compressed residual data. Parameters of the ARIMA-GARCH model are adapted to fit the obtained heteroscedastic data. The compressed residual data is decompressed by performing an entropy decoding and obtaining the parameters of the ARIMA-GARCH model and the residuals. The ARIMA-GARCH model predicts heteroscedastic data values and then the decompressed residuals are added.

Abstract: The present disclosure relates to a lock releasing method of an electronic device, an apparatus thereof, and a medium storing a program source for the method. The lock releasing method includes: in response to a request for lock releasing, outputting reference data to be used for deciphering of a password; receiving a password input by a user; and, determining a correlation between the reference data and the password input by the user, and releasing the lock when the password input by the user has a correlation with the reference data. According to the present disclosure, it is possible to flexibly change a password for releasing a lock of various electronic devices, so as prevent the leakage of a password, and thus protect private information of a user and improve system security.

Abstract: A KVS data processing unit, upon receiving a KVS type command of a database system in which index data and actual data are stored in a pair, manipulates data stored in a storage device based on said command. An SQL command execution unit, upon receiving an SQL command, serializes this command, generates KVS type data, and passes this data to the KVS data processing unit. A KVS command processing unit, upon receiving a KVS command, serializes this command, and transmits this data to the KVS data processing unit.

Abstract: In one example of a method to access data, selected data stored in a virtual tape library (“VTL”) maintained in a selected format in a first non-tape storage medium is examined. One or more first directories and one more first files are identified within the selected data. One or more second directories, and one or more second files, comprising information identifying at least one of the one or more first files, are generated and are stored in a second non-tape storage medium. A request specifying at least one of the one or more second files is received from a device, and information identifying at least one of the one or more first files is retrieved from the specified second file. The at least one first file is accessed based at least in part on the information, and data from the at least one first file is provided to the device. Systems are also disclosed. Methods and systems to enable users without system administrator rights to access and store data in a backup storage system are also disclosed.

Abstract: A method, system, and computer program product for pricing data according to provenance-based use in a query are provided in the illustrative embodiments. A set of data cubes is identified. A data cube in the set comprises a quantum of data configured for trading in exchange for a payment, the set being usable for answering the query. A first portion of a price for performing the query is computed, which includes a price of a first data cube computed using a first set of provenance attributes and a first provenance-based pricing adjustment from a first pricing definition, the first data cube being included in the set. A confidence level of a result set of the query is computed. The set of data cubes, the first set of provenance attributes, the first portion of the price, and the confidence level are presented in a pricing preview of the query.

Abstract: A device for capturing rendered text is described. The device incorporates one or more visual sensors that receive visual information as a part of capturing rendered text. The visual sensors are collectively capable of capturing both text that is permanently printed on a page, and text that is displayed transitorily on a dynamic device. The device further incorporates a visual information disposition subsystem for disposing of visual information received by the visual sensors. The device further incorporates a package that bears the visual sensors and the visual information disposition subsystem, and is suitable to be held in a human hand.

Abstract: Task-based semantic searches fetch user profile data including a role of the user within an enterprise entity from log-in identity data of the user in response to receiving a query text input. Object and task search predicates limit, as a function of the user role, scopes of objects returnable from search of an object index, and tasks returnable from search of a task index, in satisfaction of the query text as a function of the user role. Task and object index searching results are matched into task and object pairs that are allowed by the user role as a function of the enterprise entitlement system, and the task and object pairs are presented to the user in a graphical user interface as task-object pair hypertext references that invoke the task of each pair as a callable action on the object of each pair.