Abstract: Methods and systems are disclosed using linear expressions for machine learning (ML) models for ranking search results. In one example, a method for a computer trains a ML model into a decision tree for ranking search results. The decision tree is converted into a linear expression including Boolean terms. The linear expression is transmitted to one or more search computers that use the linear expression to rank search results for a search query. According to another example, a method for a computer having a search engine includes receiving a linear expression including Boolean terms representing a decision tree. The search engine processes a search query and uses the linear expression to rank search results for the search query.

Abstract: In an approach for managing computing interruptions, a processor receives a computing interruption on a computing device. A processor monitors computing activity of a user on the computing device. A processor accesses user preferences, wherein the user preferences are based on an analysis of previous responses by the user to previous computing interruptions. A processor determines a minimum threshold, based on the computing activity of the user and the user preferences, wherein the minimum threshold identifies when a computing interruption is allowed to be presented to the user. A processor determines from the computing interruption, a sender and a context of the computing interruption. A processor assigns a ranking to the computing interruption based on the sender and the context of the computing interruption. A processor compares the ranking to the minimum threshold. A processor determines whether to present the computing interruption, based on the comparison.

Abstract: A differentially private security system is communicatively coupled to a database. The differentially private security system receives a request from a client device to perform a query of the database and identifies a level of differential privacy corresponding to the request. The identified level of differential privacy includes privacy parameters (?,?) indicating the degree of information released about the database. The differentially private security system performs a differentially private query upon a set of data in the database such that the performance of the query produces a result that is (?,?)-differentially private.

Abstract: Search systems and methods for searching structured data and enhancing the relevancy of search results provided to a requesting user or application. Enhanced search results are provided by searching a cache of a user's most recently used items to eliminate or reduce search indexing latency. Also, more relevant search results are provided by re-ranking results based on use history, data security models and/or hierarchical user role models.

Abstract: Systems, methods, and computer-readable media for determining at least one valid mood for a collection of media content items of a media library are provided.

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods provide systems and methods for determining and suggesting query auto-completions (QACs). In some embodiments, when a user is inputting a search query, the disclosed systems and methods can provide a QAC suggestion based on the inputted text in addition to application programs installed and/or executing on the user's device.

Abstract: A method includes performing, by a computing device, a clustering operation to group documents of a document corpus into clusters in a feature vector space. The document corpus includes one or more labeled documents and one or more unlabeled documents. Each of the one or more labeled documents is assigned to a corresponding class in classification data associated with the document corpus, and each of the one or more unlabeled document is not assigned to any class in the classification data. The method also includes generating, by the computing device, a prompt requesting classification of a particular document of the document corpus, where the particular document is selected based on a distance between the particular document and a labeled document of the one or more labeled documents.

Abstract: A digital assistant supported on a local device and/or a remote digital assistant service is disclosed herein. The device may interact with a user and perform various functions or tasks based on the user's input (e.g., web search, set calendar appointments, capture images or video). The digital assistant may identify and store artifacts associated with each action or function. Artifacts may include, for example, people in an image, search results from a web search, participants in a meeting, etc. Subsequently, the user may query the digital assistant for information about one of the artifacts, such as who the participants were in a meeting conducted the prior Thursday. The digital assistant can sift through the various artifacts and provide the user with the relevant information. Additionally, the digital assistant can suggest actions for the user based on the retrieved artifacts, such as to message one of the identified participants.

Abstract: Embodiments described herein may involve inconsistent queues. An example implementation may involve a computing device receiving a message indicating a playback queue corresponding to a playback zone of a media playback system. The playback queue may include first media items queued in a first order for playback by the playback zone. The computing device determines that a playlist at the computing device is to be queued for playback in the playback queue corresponding to the playback zone, the playlist including second media items in a second order. The computing device determines that the first media items in the first order is different from the second media items in the second order, and based on the determination, causes the first media items in the playback queue to be replaced with the second media items in the playlist.

Abstract: A system, computer readable storage medium, and computer-implemented method presents video search results responsive to a user keyword query. The video hosting system uses a machine learning process to learn a feature-keyword model associating features of media content from a labeled training dataset with keywords descriptive of their content. The system uses the learned model to provide video search results relevant to a keyword query based on features found in the videos. Furthermore, the system determines and presents one or more thumbnail images representative of the video using the learned model.

Abstract: An information processing system manages data on customers using tenants which are storage regions dedicated for the customers of a database and registers a message for processing data of a processing target in a queue. The data is processed by accessing the tenants corresponding to the data so as to refer to the tenants based on the message. The information processing system registers a message for processing a plurality of data of processing targets as a batch process in the queue in a case where the plurality of data satisfy the predetermined condition when the message for processing a plurality of data of processing targets is to be registered in the queue. In the process performed on the plurality of data, the different tenants are accessed to be referred to.

Abstract: Journey information is mapped by first identifying an acceptable trigger condition type, such as a photo trigger condition type, of a plurality of trigger condition types. Once a journey has begun, a trigger condition of the acceptable trigger condition type may be detected at a mobile computing device, for example when the mobile computing device captures a photo. A location of the mobile computing device is then identified in response to the detection of the trigger condition, and a marker is placed on a map identifying the location. The marker is also associated with data associated with the trigger condition, for example by allowing the photo captured by the mobile computing device to be viewable at the marker.

Abstract: A system and method for automatically acquiring, manipulating and publishing data includes an input/output module, configured to receive a user query, and an intermediary module, communicably connected to the input/output module. The intermediate module includes a data fetch module, configured to acquire data from a data source based on the user query, a manipulation module, configured to manipulate the data to better suit user query, and a publication module, configured to publish the manipulated data based on the user query.

Abstract: A mobile web page shows a hashtag and messages with that tag. The page shows one or more deep links or linkets, related to the topic of the messages. If a user clicks a deep link or linket, an app is launched on the mobile device, to connect to an app on a different device. The user interacts with a second user. The latter can be an instructor or teacher or observer of the topic. The first user can be a student. Extra interactive possibilities for mobile visitors to the website. The app can be more engaging than using a browser. The website charges for the linket ad. Similar steps are done for a page with an author's username, where the page shows messages by the author and the messages have hashtags. This page has a linket ad. If the ad is by the author, this lets the author promote herself or an item sold by her or an event (like a concert) where she will be playing. More incentive for her to write more hashtag messages, to garner a greater audience.

Abstract: Various aspects for managing input/output operations in a storage network are described. For instance, a method may include applying a hash function on a target data object to calculate a hash key for the target data object and identifying a target storage bucket for the target data object based on the hash key and a hash table map. The method may further include reading a data object key for a data object stored in the target storage bucket and comparing the data object key and the hash key to determine a match. The method may also include determining that the data object is the target data object if the data object key and the hash key match and reading the target data object from the target storage bucket when there is a match. Some methods can be performed using a single remote direct access request.

Abstract: Virtual-machine images (VMIs) can be compressed by identifying common cluster sequences shared across VMIs. To identify these sequences, hashes are generated for each cluster in each VMI, resulting in hash files for respective VMIs. The hashes are partitioned to address memory constraints. For each partition, its hashes are entered into buckets of a hash map according to their respective hash values. Each (non-empty) bucket associates a key hash value with one or more pointers to locations in the hash files. Clusters of hashes are fetched from the hash files referenced by multi-pointer buckets. The hash clusters are scanned across clusters to identify common hash sequences. Common cluster sequences are then identified based on the common hash sequences. This process works with files other than VMIs and with segment sizes other than clusters.

Abstract: Embodiments of search systems that leverage the search or access activities of a core group of users to improve search functionality and performance of such search systems are disclosed. Specifically, embodiments may utilize users' search activity to generate clusters of users and associated labels for those clusters. These clusters can be leveraged during a search to generate suggestions for a user conducting the search.

Abstract: Techniques for search with autosuggest and refinements are disclosed. In some embodiments, search with autosuggest includes determining a plurality of potential query suggestions for a partially entered query string; and automatically suggesting a plurality of queries based on a query count for each of the queries. For example, the query count can correspond to a popularity of the query. In some implementations, the query count can be determined based on a number of times that the query was received, and the plurality of queries can be listed based on the popularity of each of the plurality of queries (e.g., to facilitate display of more popular queries higher in the list of suggested queries).

Abstract: A system and method for preventing hidden data being passed using steganography by performing additional steganography to obscure the hidden data such that the hidden data is unrecoverable without information regarding the method of the additional steganography. This system and method allows for preventing hidden data without having to decipher the hidden data.

Abstract: A computer-implemented method for checking a search query used for retrieving information from a collection of records in an event sequence analysis system is disclosed. The method includes receiving a search query including a plurality of predicates and one or more constraints each associated with plural predicates, in which each predicate is specified to be positive or negative, and the plurality of the predicates forms a logical graph together with the one or more constraints. The method also includes generating from the graph a subgraph including one or more predicates specified to be positive among the plurality of the predicates. The method further includes determining whether the subgraph has plural components or not, and invalidating the search query in response to the subgraph being determined to have plural components.

Abstract: The described embodiments set forth techniques for managing the fragmentation of files at a computing device. Specifically, the techniques involve, for a given file, analyzing different extents of the file under a “segment window” basis to identify whether a fragmentation threshold is satisfied between the extents that correspond to the scope of the segment window. In turn, for each segment window that satisfies the threshold level of fragmentation, (1) the data for the extents is copied into an allocated area of contiguous memory, and (2) the extents are updated to reference the copied data. Additionally, the original data referred to by the extents can be freed for usage within the computing device, thereby increasing storage space. In this manner, the overall fragmentation of the file is substantially reduced under the segment window basis, thereby improving the overall performance of the computing device.

Abstract: Methods are disclosed for providing alternate reality (e.g., virtual reality) representations to users. Exemplary methods employ data collections (e.g., stacks) which affect the virtual representations of baseline virtual models. Data collections contain layers which contain deltas. The deltas specify modifications to the baseline virtual reality world or model. The deltas may be geocoded, while the layers that contain them may not be geocoded. Separately selectable layers are used to temporarily modify or substitute baseline data or virtual elements (e.g., virtual objects) that are ultimately presented to a user on an output device. Conflict resolution algorithms harmonize conflicts between layers of a collection.

Abstract: Technologies are provided for using a multi-user execution plan cache to process database queries. A database query processor can be configured to store execution plans in a multi-user execution plan cache. The query processor can determine whether an execution plan is shareable by multiple database users. If the execution plan is shareable, it can be stored in the cache in association with a sharing user identifier. When a database query is received, the query processor can determine that the query can be performed using the cached execution plan. If the cached execution plan is shareable, the database query can determine whether the cached execution plan is valid for a database user associated with the received database query. If the cached execution plan is valid for the database user, the query processor uses the cached execution plan to perform the query for the associated database user.

Abstract: In various aspects, a method, system and computer program product provides for concurrent changes to data of a document or a file by a plurality of users at a plurality of user devices. The documents or file may be rendered in JavaScript™ Object Notation (JSON) format. The documents may be patched or changed by employing new functional operations for applying metadata for elements of the arrays associated with the document or file, and to merge changes from made among the various users. The disclosure provides for maintaining and producing new versions of the document or the file, the changes controlled so that data of the arrays are merged atomically and the updates do not fail permitting simultaneous changes to the document or file by multiple users.

Abstract: This application relates to a first computing device that stores a first set of data that is associated with an event can be configured to implement a method for resolving inconsistencies in synchronized data among multiple computing devices by carrying out the techniques described herein. In particular, the method can include the steps of (1) receiving, from a second computing device, a second set of data that is associated with the event, (2) in response to receiving a request to present data associated with the event: determining a presence of at least one inconsistency between respective corresponding data of the first and second sets of data, (3) applying rules to the at least one inconsistency to form resolved data, and (4) presenting the data associated with the event, where the data includes at least the resolved data.

Abstract: The described embodiments set forth techniques for preserving clone relationships between files at a computing device. In particular, the techniques involve identifying clone relationships between files in conjunction with performing operations on the files where it can be beneficial to preserve the clone relationships. The operations can include, for example, preserving clone relationships between files that are being copied from a source storage device (that supports file cloning) to a destination storage device that supports file cloning. Additionally, the operations can include preserving clone relationships when backing up and restoring files between a source storage device (that supports file cloning) and a destination storage device that does not support file cloning. In this manner, the various benefits afforded by the clone relationships between files can be retained even as the files are propagated to destination storage devices that may or may not support file cloning.

Abstract: A client computer includes a synchronization manager. The synchronization manager communicates with a remote content management system to determine a set of objects in a content navigation hierarchy. The synchronization manager provides a user interface with controls to allow a user to independently select multiple objects in the content navigation hierarchy for synchronization and receives an input, via the interface, that selects objects from the set of objects for synchronization. The synchronization manager stores local peers of the selected objects in a local cache in a local file system. The synchronization manager synchronizes changes to the selected objects at the content management system to the local peers in the file system.

Abstract: A file system manager implemented at a provider network identifies a storage device of a first group of storage devices of a provider network as an initial location of a file system object. Based on an access metric associated with the object, the file system manager initiates a transfer of contents of the object to a second storage device of a different storage device group, without receiving a client request specifying the transfer. In response to an access request received via a file system programmatic interface, contents of the object are provided from the second storage device. Based on a second access metric, the object is transferred back to the first group of storage devices.

Abstract: Embodiments of the present disclosure provide a method and device for a file system log. In some embodiments, there is provided a computer-implemented method. The method comprises: in response to receiving a write request for metadata associated with a first transaction, determining at least one zone associated with the first transaction from a plurality of zones of the metadata, the plurality of zones being formed by striping the metadata; requesting a resource slice for the at least one zone from a resource pool of a logging system; and recording to the resource slice a log that the first transaction modifies the at least one zone.

Abstract: A logical segmentation data processing system includes a data retrieval interface configured to receive, from a remote geo-caching data system, geo-caching data representing geographic locations specified by the remote geo-caching data system. The data processing system includes a logical segmentation engine configured to segment a geographic map into geo-areas, each geo-area comprising a subset of the geographic locations represented by the geo-caching data. The data processing system includes an evaluation engine configured to rank, for each of a plurality of the geo-areas, geographic locations in that geo-area. The data processing system includes an aggregation engine configured to select, from each of the plurality of geo-areas, one or more geographic locations with a higher ranking, relative to the rankings of other geographic locations in that geo-area, and to aggregate the selected geographic locations.

Abstract: Apparatus and methods for machine-based planning. The apparatus may cluster a plurality of geographically different resources into a plurality of clusters of proximate resources. The apparatus may calculate a cost of transporting each resource to each of a plurality of destinations. The apparatus may map each cluster to one of the destinations to determine a sum of costs of transporting all of the resources to the destinations. The apparatus may assign to each of the plurality of destinations only resources: that are mapped to the destination; for which the destination has sufficient capacity to accommodate the resources; and whose assignment to the destination does not exclude from the destination, by filling the capacity, a different resource that is: mapped to the destination; and has a net cost that is higher than a net cost of the resource of the assignment.

Abstract: In some implementations, a computing device can provide a map application providing a representation of a physical structure of venues (e.g., shopping centers, airports) identified by the application. The application can provide an inside view of the venue, which is accessible by other applications and programs on the user's device. Thus, whether intended or not, search results that are identified by the map application as having an inside view of the venue are also presented on a graphical user interface along with typical search results from the other applications.

Abstract: An image processing apparatus includes a storage device where one or plural document boxes are arranged, and a box save processing unit. The box save processing unit is configured to determine a document box as a save location of an image file of a document image among the one or plural document boxes, specify a file name of the document image, and save the image file in the determined document box. Further, the box save processing unit (a) determines a file name extraction rule in box property data of the determined document box, (b) extracts a file name from an area specified by the file name extraction rule in the document image, and (c) specifies the extracted file name to the image file and saves the image file in the determined document box.

Abstract: A system, method and program product for implementing a sketch-based retrieval system. A system is disclosed that includes: an interface having a canvas for entering inputs including user generated strokes, and extracting features associated with the inputs; a hierarchy system for assigning an importance to the inputs; a matching system for retrieving matches from a database based on extracted features and importance associated with the extracted features; a feedback system that provides real-time feedback on the canvas to suggest improved inputs for the user; and a ranking system that ranks retrieved matches for output in the interface by incorporating user interaction history.

Abstract: Systems, methods, and computer-readable media for reducing a number of unverified persons detected in media content are provided.

Abstract: The present disclosure relates to an information display method and device. The method includes: displaying a user interface of an application, where the user interface includes at least one picture; receiving a selection operation triggered on the user interface, where the selection operation is configured to select a target picture from the at least one picture; acquiring search result information corresponding to content of the target picture; and displaying the search result information.

Abstract: Technologies are described for facilitating the processing of requests for database operations in a distributed database environment. Criteria are defined for processing a request for a database operation according to first or second snapshot isolation protocols. A request for a database operation is received and it is determined if the snapshot isolation protocol criteria are met. If the criteria are met, the request can be processed using a local snapshot identifier value of a worker node. If the criteria are not met, the local snapshot identifier value is synchronized with another node, and the request processed using the updated snapshot identifier value.

Abstract: Data sharding partitions data associated with an application into multiple shards in which each shard stores a subset of the data. A shard is further divided into multiple microshards in which each microshard contains a subset of the shard data. A set of microshards are assigned to a specified shard. The assignment of microshards can change, e.g., when new shards are added and microshards are migrated from one shard to another shard. A microshard map, which indicates a mapping between the microshards and shards, is updated automatically when the assignments change. After identifying the shard to which a specified microshard is assigned using the microshard map, a data access request from a client device is automatically forwarded to the appropriate shard. Because data can be accessed efficiently regardless of whether the number of shards changes, the data sharding facilitates provisioning of the shards on a need basis.

Abstract: An optimization method and system configured to perform a continuous optimization of a value chain of an investigated manufactured system, wherein in each stage of the value chain items related to the investigated system include associated sets of failure modes, fm, with corresponding measures, m, wherein each failure mode, fm, refers to a global system effect, e, of the investigated system, wherein each stage of the value chain of the investigated system is adapted to report separately its measures, m, effectiveness values, ev1, and effort values, ev2, to update a global FMEA data model using a meta model, MM, wherein the optimization system includes a calculation unit configured to perform a global failure mode effect, FMEA, analysis of the investigated system for its entire value chain using the updated global FMEA data model to generate an optimized set, M, of measures, m.

Abstract: The invention relates to electronic indexing, and more particularly, to the indexing, in a cloud, data held in a cloud. Systems and methods of the invention index data by accessing the data in place in the cloud and breaking a job into work items and sending the work items to multiple cloud processes that can each determine whether to index data associated with the work item or to create a new work item and have a different cloud process index the data. Each cloud process is proximal to an item that it indexes. This gives the system scale as well as an internal load-balancing.

Abstract: A database includes a plurality of data blocks. Each of the plurality of data blocks includes a plurality of data pages in which a plurality of column values recorded in one or more records corresponding to the data block are stored. Each of the plurality of data pages has two or more column values in one column corresponding to the data page stored therein. A database server selects a data block from the plurality of data blocks and specifies a data page to be scanned from the selected data block.

Abstract: In accordance with an embodiment, described herein is a system and method for generating a data cube for analytics. A map-reduce program running in a data processing cluster can read each line of a source data, and generate a key-value pair for each of a plurality of data combinations in that line of data. Values paired with the same key can be aggregated to generate one or more frequency values or one or more aggregate values, for representing the result of a query on the source data. Each query result can be stored in an output file, and can be encapsulated into a data cube cached in a distributed file system of the data processing cluster. The data cube can map a query from a client application to an output file, and can return a pre-computed result in the output file from the data cube to the client application.

Abstract: A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations comprising monitoring access to a plurality of rows in a database partition, a first portion of the plurality of rows stored in a persistent page store and a second portion of the plurality of rows stored in an in-memory row store. The operations can further comprise determining workload parameters based on the monitoring, selecting a location for performing a database operation on the database partition based on the workload parameters, and performing the database operation on the database partition within the selected location (e.g., the persistent page store or the in-memory row store). Related systems, methods, and articles of manufacture are also described.

Abstract: Disclosed are system and methods for processing and storing data files, using a data edge file format. The data edge file separates information about what symbols are in a data file and information about the corresponding location of those symbols in the data file. The described technique for converting a source file comprising symbols into a data edge file includes: generating a locality file of symbol location from the source file to identify locations of the symbols in the source file, generating a symbol file to identify symbols in the source file, and then modifying the locality file of symbol location to associate each symbol from the symbol file with a location in the source file.

Abstract: An automatic user biographical data updater (BDU) computing device for automatically updating user biographical data is provided. The BDU computing device includes at least one processor in communication with at least one memory device. The BDU computing device is configured to receive user biographical data, to store the user biographical data in the at least one memory device, and to receive a data access request for the user biographical data from a trusted party. The BDU computing device is also configured to generate a trusted party data access link, to transmit the trusted party data access link to the trusted party, to receive updated user biographical data, to store the updated user biographical data, and to electronically link the stored updated user biographical data to the trusted party data access link. The BDU computing device is also configured to transmit an updated data notification message to the trusted party.

Abstract: In various example embodiments, multiple workspaces have access to modify values in a graph database. The graph database can comprise a collection of entity nodes, where each entity node is connected to an identifier node and one or more state nodes. An update to an entity node can be recorded by generating a new state node to store the update and connecting the new state node to the entity node. How each workspace views the database is based, at least in part, on which state nodes are associated with each workspace. The workspaces are independent of one another, and changes made to an entity node in one workspace do not affect how another workspace views the same entity node. By managing database data for each of the workspaces using the same graph database and recording changes in state nodes in an additive manner, the computational overhead is greatly reduced and simplified.

Abstract: A system includes reception of a first instruction at a first system to effect a first change to a hierarchy data model, storage of a first record including first values specifying the first change in a local memory of the first system, reception of a second instruction to effect a second change to the hierarchy data model, storage of a second record including second values specifying the second change in the local memory of the first computer system, reception of an instruction to save the changed hierarchy data model, and, in response to the instruction, transmit the first record and the second record to a second system. The first record and the second record are received and merged to generate a third record including third values specifying a third change to the hierarchy data model, and a query language statement is generated to effect the third change to the hierarchy data model based on the third record.

Abstract: An apparatus includes one or more processors configured to execute instructions to generate a plurality of event results that includes a first event result and a second event result. The apparatus further includes a first buffer coupled to the one or more processors and a second buffer coupled to the first buffer. The first buffer is configured to store the plurality of event results. The apparatus further includes a circuit coupled to the first buffer. The first buffer is further configured to provide the first event result to the second buffer in response to detection by the circuit of a failure condition associated with the first event result.

Abstract: Technologies are described for facilitating transaction processing in a distributed database environment. A database client sends database operations to a slave node, which mediates execution of the transaction. A connection between the database client and the slave node is associated with an identifier, and the transaction has an identifier. The database client sends a commit request to a master node over a network connection between the master node and the database client. The commit request includes the transaction identifier. The commit request can also include an indication of database nodes executing operations in the transaction.

Abstract: A method, system and computer program product for operating a database includes: receiving a query including a first component indicating a criteria for generating a materialized query table (MQT) from the database and a second component having a condition for generating a reference value indicating a state of one or more items in the database; generating the MQT from the database where the MQT includes data items satisfying the criteria; generating, by executing the second component in response to receiving the query, a first reference value; receiving, subsequent to generating the first reference value, a second query for retrieving a data item from the MQT; generating, by executing the second component in response to receiving the second query, a second reference value; determining whether the first and second reference values are equal; and updating the MQT when the first reference value is not equal to the second reference value.